/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:23:32,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:23:32,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:23:32,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:23:32,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:23:32,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:23:32,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:23:33,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:23:33,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:23:33,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:23:33,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:23:33,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:23:33,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:23:33,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:23:33,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:23:33,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:23:33,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:23:33,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:23:33,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:23:33,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:23:33,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:23:33,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:23:33,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:23:33,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:23:33,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:23:33,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:23:33,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:23:33,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:23:33,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:23:33,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:23:33,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:23:33,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:23:33,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:23:33,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:23:33,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:23:33,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:23:33,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:23:33,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:23:33,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:23:33,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:23:33,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:23:33,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:23:33,117 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:23:33,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:23:33,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:23:33,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:23:33,120 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:23:33,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:23:33,120 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:23:33,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:23:33,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:23:33,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:23:33,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:23:33,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:23:33,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:23:33,123 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:23:33,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:23:33,124 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:23:33,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:23:33,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:23:33,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:23:33,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:23:33,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:23:33,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:23:33,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:23:33,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:23:33,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:23:33,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:23:33,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:23:33,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:23:33,131 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:23:33,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:23:33,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:23:33,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:23:33,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:23:33,587 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:23:33,587 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:23:33,589 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2020-09-04 13:23:33,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/397945090/9871f400f8f64abda7f43e3ad55efd9d/FLAG22696ff23 [2020-09-04 13:23:34,304 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:23:34,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2020-09-04 13:23:34,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/397945090/9871f400f8f64abda7f43e3ad55efd9d/FLAG22696ff23 [2020-09-04 13:23:34,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/397945090/9871f400f8f64abda7f43e3ad55efd9d [2020-09-04 13:23:34,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:23:34,601 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:23:34,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:23:34,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:23:34,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:23:34,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:23:34" (1/1) ... [2020-09-04 13:23:34,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b0c8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:34, skipping insertion in model container [2020-09-04 13:23:34,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:23:34" (1/1) ... [2020-09-04 13:23:34,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:23:34,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:23:34,882 WARN L1484 CHandler]: Possible shadowing of function min [2020-09-04 13:23:34,884 WARN L1484 CHandler]: Possible shadowing of function min [2020-09-04 13:23:34,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:23:34,924 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:23:35,040 WARN L1484 CHandler]: Possible shadowing of function min [2020-09-04 13:23:35,042 WARN L1484 CHandler]: Possible shadowing of function min [2020-09-04 13:23:35,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:23:35,080 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:23:35,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:35 WrapperNode [2020-09-04 13:23:35,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:23:35,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:23:35,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:23:35,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:23:35,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:35" (1/1) ... [2020-09-04 13:23:35,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:35" (1/1) ... [2020-09-04 13:23:35,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:35" (1/1) ... [2020-09-04 13:23:35,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:35" (1/1) ... [2020-09-04 13:23:35,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:35" (1/1) ... [2020-09-04 13:23:35,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:35" (1/1) ... [2020-09-04 13:23:35,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:35" (1/1) ... [2020-09-04 13:23:35,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:23:35,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:23:35,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:23:35,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:23:35,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:35" (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 13:23:35,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:23:35,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:23:35,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 13:23:35,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 13:23:35,253 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-09-04 13:23:35,253 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-09-04 13:23:35,254 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-09-04 13:23:35,254 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-09-04 13:23:35,254 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-09-04 13:23:35,254 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-09-04 13:23:35,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:23:35,255 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-09-04 13:23:35,255 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 13:23:35,255 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 13:23:35,255 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 13:23:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:23:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-09-04 13:23:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 13:23:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 13:23:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:23:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 13:23:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-09-04 13:23:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 13:23:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 13:23:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 13:23:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-09-04 13:23:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 13:23:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-09-04 13:23:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 13:23:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 13:23:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-09-04 13:23:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-09-04 13:23:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-09-04 13:23:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 13:23:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-09-04 13:23:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:23:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:23:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:23:35,780 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:23:35,780 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 13:23:35,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:23:35 BoogieIcfgContainer [2020-09-04 13:23:35,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:23:35,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:23:35,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:23:35,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:23:35,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:23:34" (1/3) ... [2020-09-04 13:23:35,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fe7df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:23:35, skipping insertion in model container [2020-09-04 13:23:35,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:35" (2/3) ... [2020-09-04 13:23:35,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fe7df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:23:35, skipping insertion in model container [2020-09-04 13:23:35,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:23:35" (3/3) ... [2020-09-04 13:23:35,811 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2020-09-04 13:23:35,824 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:23:35,838 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:23:35,860 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:23:35,889 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:23:35,890 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:23:35,890 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:23:35,890 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:23:35,890 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:23:35,890 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:23:35,891 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:23:35,891 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:23:35,918 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2020-09-04 13:23:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 13:23:35,930 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:35,932 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] [2020-09-04 13:23:35,932 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:35,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:35,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1217563597, now seen corresponding path program 1 times [2020-09-04 13:23:35,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:35,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397409637] [2020-09-04 13:23:35,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:36,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:36,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:23:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:36,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:23:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:36,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 13:23:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:36,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:23:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:36,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:23:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:36,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 13:23:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:36,357 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 13:23:36,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397409637] [2020-09-04 13:23:36,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:36,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 13:23:36,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159280460] [2020-09-04 13:23:36,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:23:36,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:36,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:23:36,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:23:36,390 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 6 states. [2020-09-04 13:23:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:36,976 INFO L93 Difference]: Finished difference Result 165 states and 215 transitions. [2020-09-04 13:23:36,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:23:36,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-09-04 13:23:36,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:36,996 INFO L225 Difference]: With dead ends: 165 [2020-09-04 13:23:36,996 INFO L226 Difference]: Without dead ends: 93 [2020-09-04 13:23:37,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:23:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-09-04 13:23:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-09-04 13:23:37,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-09-04 13:23:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2020-09-04 13:23:37,079 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 44 [2020-09-04 13:23:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:37,079 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2020-09-04 13:23:37,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:23:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2020-09-04 13:23:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 13:23:37,083 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:37,084 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] [2020-09-04 13:23:37,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:23:37,084 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:37,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:37,085 INFO L82 PathProgramCache]: Analyzing trace with hash -471380145, now seen corresponding path program 1 times [2020-09-04 13:23:37,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:37,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206285104] [2020-09-04 13:23:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:37,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:37,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:23:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:37,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:23:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:37,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 13:23:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:37,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:23:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:37,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:23:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:37,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 13:23:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:37,358 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 13:23:37,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206285104] [2020-09-04 13:23:37,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:37,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 13:23:37,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176090304] [2020-09-04 13:23:37,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:23:37,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:37,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:23:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:23:37,363 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 11 states. [2020-09-04 13:23:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:38,106 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2020-09-04 13:23:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:23:38,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-09-04 13:23:38,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:38,110 INFO L225 Difference]: With dead ends: 151 [2020-09-04 13:23:38,111 INFO L226 Difference]: Without dead ends: 95 [2020-09-04 13:23:38,113 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2020-09-04 13:23:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-09-04 13:23:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2020-09-04 13:23:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-09-04 13:23:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2020-09-04 13:23:38,132 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 44 [2020-09-04 13:23:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:38,132 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2020-09-04 13:23:38,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:23:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2020-09-04 13:23:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 13:23:38,135 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:38,135 INFO L422 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] [2020-09-04 13:23:38,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:23:38,136 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:38,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:38,136 INFO L82 PathProgramCache]: Analyzing trace with hash 800610240, now seen corresponding path program 1 times [2020-09-04 13:23:38,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:38,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930081988] [2020-09-04 13:23:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:38,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:38,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:23:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:38,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:23:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:38,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 13:23:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:38,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:23:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:38,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:23:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:38,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-09-04 13:23:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:38,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:23:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:38,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 13:23:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 13:23:38,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930081988] [2020-09-04 13:23:38,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942460441] [2020-09-04 13:23:38,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:23:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:38,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 25 conjunts are in the unsatisfiable core [2020-09-04 13:23:38,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:23:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 13:23:38,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:23:38,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 13 [2020-09-04 13:23:38,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470365100] [2020-09-04 13:23:38,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:23:38,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:23:38,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:23:38,732 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand 13 states. [2020-09-04 13:23:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:39,799 INFO L93 Difference]: Finished difference Result 161 states and 206 transitions. [2020-09-04 13:23:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:23:39,800 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2020-09-04 13:23:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:39,802 INFO L225 Difference]: With dead ends: 161 [2020-09-04 13:23:39,802 INFO L226 Difference]: Without dead ends: 94 [2020-09-04 13:23:39,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2020-09-04 13:23:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-04 13:23:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2020-09-04 13:23:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-09-04 13:23:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2020-09-04 13:23:39,838 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 56 [2020-09-04 13:23:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:39,839 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2020-09-04 13:23:39,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:23:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2020-09-04 13:23:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-04 13:23:39,845 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:39,845 INFO L422 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] [2020-09-04 13:23:40,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-09-04 13:23:40,047 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:40,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:40,048 INFO L82 PathProgramCache]: Analyzing trace with hash 487198237, now seen corresponding path program 1 times [2020-09-04 13:23:40,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:40,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685412846] [2020-09-04 13:23:40,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:40,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:40,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:23:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:40,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:23:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:40,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:40,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:23:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:40,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:23:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:40,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:23:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:40,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:23:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:40,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 13:23:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:40,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 13:23:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:40,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:23:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-04 13:23:40,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685412846] [2020-09-04 13:23:40,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:40,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:23:40,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657226703] [2020-09-04 13:23:40,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:23:40,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:40,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:23:40,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:23:40,333 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand 13 states. [2020-09-04 13:23:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:41,274 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2020-09-04 13:23:41,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 13:23:41,275 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2020-09-04 13:23:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:41,280 INFO L225 Difference]: With dead ends: 160 [2020-09-04 13:23:41,280 INFO L226 Difference]: Without dead ends: 96 [2020-09-04 13:23:41,283 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2020-09-04 13:23:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-09-04 13:23:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2020-09-04 13:23:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 13:23:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2020-09-04 13:23:41,300 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 66 [2020-09-04 13:23:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:41,301 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2020-09-04 13:23:41,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:23:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2020-09-04 13:23:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 13:23:41,303 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:41,303 INFO L422 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] [2020-09-04 13:23:41,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:23:41,304 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:41,304 INFO L82 PathProgramCache]: Analyzing trace with hash -505239167, now seen corresponding path program 1 times [2020-09-04 13:23:41,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:41,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048408942] [2020-09-04 13:23:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:23:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:23:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:23:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:23:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:23:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:23:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:23:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:23:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:23:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:23:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 13:23:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:23:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-09-04 13:23:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:23:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-09-04 13:23:41,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048408942] [2020-09-04 13:23:41,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:23:41,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:23:41,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633925484] [2020-09-04 13:23:41,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:23:41,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:23:41,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:23:41,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:23:41,629 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand 13 states. [2020-09-04 13:23:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:23:42,508 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2020-09-04 13:23:42,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 13:23:42,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2020-09-04 13:23:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:23:42,513 INFO L225 Difference]: With dead ends: 148 [2020-09-04 13:23:42,513 INFO L226 Difference]: Without dead ends: 96 [2020-09-04 13:23:42,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:23:42,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-09-04 13:23:42,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2020-09-04 13:23:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 13:23:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2020-09-04 13:23:42,543 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 79 [2020-09-04 13:23:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:23:42,546 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2020-09-04 13:23:42,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:23:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2020-09-04 13:23:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-04 13:23:42,548 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:23:42,548 INFO L422 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] [2020-09-04 13:23:42,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:23:42,549 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:23:42,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:23:42,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1062270604, now seen corresponding path program 1 times [2020-09-04 13:23:42,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:23:42,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154394032] [2020-09-04 13:23:42,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:23:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:23:42,629 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:23:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:23:42,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:23:42,764 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:23:42,765 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:23:42,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:23:42,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:23:42 BoogieIcfgContainer [2020-09-04 13:23:42,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:23:42,863 INFO L168 Benchmark]: Toolchain (without parser) took 8261.28 ms. Allocated memory was 140.5 MB in the beginning and 303.0 MB in the end (delta: 162.5 MB). Free memory was 101.8 MB in the beginning and 270.2 MB in the end (delta: -168.4 MB). Peak memory consumption was 143.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:23:42,867 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:23:42,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.86 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.6 MB in the beginning and 181.3 MB in the end (delta: -79.7 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:23:42,871 INFO L168 Benchmark]: Boogie Preprocessor took 91.78 ms. Allocated memory is still 204.5 MB. Free memory was 181.3 MB in the beginning and 178.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-09-04 13:23:42,871 INFO L168 Benchmark]: RCFGBuilder took 621.16 ms. Allocated memory is still 204.5 MB. Free memory was 178.7 MB in the beginning and 145.3 MB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2020-09-04 13:23:42,872 INFO L168 Benchmark]: TraceAbstraction took 7062.56 ms. Allocated memory was 204.5 MB in the beginning and 303.0 MB in the end (delta: 98.6 MB). Free memory was 144.7 MB in the beginning and 270.2 MB in the end (delta: -125.5 MB). Peak memory consumption was 122.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:23:42,878 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.59 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 478.86 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.6 MB in the beginning and 181.3 MB in the end (delta: -79.7 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.78 ms. Allocated memory is still 204.5 MB. Free memory was 181.3 MB in the beginning and 178.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 621.16 ms. Allocated memory is still 204.5 MB. Free memory was 178.7 MB in the beginning and 145.3 MB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7062.56 ms. Allocated memory was 204.5 MB in the beginning and 303.0 MB in the end (delta: 98.6 MB). Free memory was 144.7 MB in the beginning and 270.2 MB in the end (delta: -125.5 MB). Peak memory consumption was 122.3 MB. 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: [L96] CALL, EXPR nondet_tree() [L23] COND FALSE !(__VERIFIER_nondet_bool()) [L26] struct node *n = (struct node *)malloc(sizeof(struct node)); [L27] n->data = __VERIFIER_nondet_int() [L28] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() [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() [L29] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() [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() [L30] return n; VAL [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L96] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L96] CALL task(nondet_tree()) VAL [t={-1:0}] [L74] CALL, EXPR min(t) VAL [n={-1:0}] [L35] COND FALSE !(!n) [L38] EXPR n->left VAL [n={-1:0}, n={-1:0}, n->left={0:0}] [L38] CALL, EXPR min(n->left) VAL [n={0:0}] [L35] COND TRUE !n [L36] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L38] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L38] int a = min(n->left); [L39] EXPR n->right VAL [a=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L39] CALL, EXPR min(n->right) VAL [n={0:0}] [L35] COND TRUE !n [L36] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L39] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L39] int b = min(n->right); [L40] COND TRUE a <= b [L40] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-1:0}, n={-1:0}] [L74] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L74] int a = min(t); [L75] int b; VAL [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}] [L77] CALL, EXPR size(t) VAL [t={-1:0}] [L69] COND FALSE !(!t) [L70] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L70] CALL, EXPR size(t->left) VAL [t={0:0}] [L69] COND TRUE !t [L69] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L70] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L70] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L70] CALL, EXPR size(t->right) VAL [t={0:0}] [L69] COND TRUE !t [L69] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L70] 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}] [L70] return size(t->left) + size(t->right) + 1; [L77] RET, EXPR size(t) VAL [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}] [L77] int n = size(t); [L78] CALL assume_abort_if_not(n != 0) VAL [\old(cond)=1] [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume_abort_if_not(n != 0) VAL [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}] [L79] 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}] [L79] 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}] [L80] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L58] COND FALSE !(!t) [L61] 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}] [L61] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L58] COND TRUE !t [L59] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L61] 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] [L61] i = tree_inorder(t->left, a, i) [L62] EXPR i++ [L62] EXPR t->data [L62] a[i++] = t->data [L63] 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}] [L63] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L58] COND TRUE !t [L59] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L63] 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] [L63] i = tree_inorder(t->right, a, i) [L64] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L80] 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}] [L81] 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] [L81] 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, 95 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.8s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 428 SDtfs, 603 SDslu, 1487 SDs, 0 SdLazy, 1940 SolverSat, 649 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred 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.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 54010 SizeOfPredicates, 6 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 74/78 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...