/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_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:24:30,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:24:30,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:24:30,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:24:30,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:24:30,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:24:30,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:24:30,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:24:30,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:24:30,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:24:30,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:24:30,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:24:30,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:24:30,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:24:30,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:24:30,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:24:30,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:24:30,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:24:30,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:24:30,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:24:30,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:24:30,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:24:30,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:24:30,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:24:30,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:24:30,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:24:30,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:24:30,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:24:30,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:24:30,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:24:30,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:24:30,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:24:30,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:24:30,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:24:30,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:24:30,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:24:30,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:24:30,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:24:30,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:24:30,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:24:30,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:24:30,330 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 23:24:30,342 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:24:30,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:24:30,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:24:30,344 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:24:30,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:24:30,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:24:30,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:24:30,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:24:30,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:24:30,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:24:30,345 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:24:30,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:24:30,346 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:24:30,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:24:30,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:24:30,346 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:24:30,347 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:24:30,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:24:30,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:24:30,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:24:30,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:24:30,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:24:30,348 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 23:24:30,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:24:30,819 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:24:30,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:24:30,828 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:24:30,829 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:24:30,830 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2020-09-04 23:24:30,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/01d36f485/3efe49e97f1c422b967b7dfce3524942/FLAG0f6a6c487 [2020-09-04 23:24:31,445 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:24:31,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/verifythis/tree_del_iter.c [2020-09-04 23:24:31,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/01d36f485/3efe49e97f1c422b967b7dfce3524942/FLAG0f6a6c487 [2020-09-04 23:24:31,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/01d36f485/3efe49e97f1c422b967b7dfce3524942 [2020-09-04 23:24:31,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:24:31,745 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:24:31,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:24:31,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:24:31,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:24:31,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:24:31" (1/1) ... [2020-09-04 23:24:31,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b3ac5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:31, skipping insertion in model container [2020-09-04 23:24:31,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:24:31" (1/1) ... [2020-09-04 23:24:31,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:24:31,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:24:32,064 WARN L1484 CHandler]: Possible shadowing of function min [2020-09-04 23:24:32,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:24:32,097 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:24:32,210 WARN L1484 CHandler]: Possible shadowing of function min [2020-09-04 23:24:32,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:24:32,243 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:24:32,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:32 WrapperNode [2020-09-04 23:24:32,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:24:32,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:24:32,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:24:32,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:24:32,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:32" (1/1) ... [2020-09-04 23:24:32,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:32" (1/1) ... [2020-09-04 23:24:32,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:32" (1/1) ... [2020-09-04 23:24:32,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:32" (1/1) ... [2020-09-04 23:24:32,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:32" (1/1) ... [2020-09-04 23:24:32,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:32" (1/1) ... [2020-09-04 23:24:32,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:32" (1/1) ... [2020-09-04 23:24:32,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:24:32,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:24:32,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:24:32,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:24:32,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:32" (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 23:24:32,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:24:32,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:24:32,387 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-09-04 23:24:32,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 23:24:32,387 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-09-04 23:24:32,388 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-09-04 23:24:32,388 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-09-04 23:24:32,388 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-09-04 23:24:32,388 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-09-04 23:24:32,388 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-09-04 23:24:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:24:32,389 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-09-04 23:24:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 23:24:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 23:24:32,389 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 23:24:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 23:24:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-09-04 23:24:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-09-04 23:24:32,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:24:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 23:24:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-09-04 23:24:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 23:24:32,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 23:24:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 23:24:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-09-04 23:24:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 23:24:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 23:24:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-09-04 23:24:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 23:24:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-09-04 23:24:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-09-04 23:24:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-09-04 23:24:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 23:24:32,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-09-04 23:24:32,394 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:24:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:24:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:24:32,998 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:24:32,999 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-09-04 23:24:33,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:24:33 BoogieIcfgContainer [2020-09-04 23:24:33,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:24:33,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:24:33,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:24:33,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:24:33,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:24:31" (1/3) ... [2020-09-04 23:24:33,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed2d317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:24:33, skipping insertion in model container [2020-09-04 23:24:33,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:32" (2/3) ... [2020-09-04 23:24:33,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed2d317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:24:33, skipping insertion in model container [2020-09-04 23:24:33,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:24:33" (3/3) ... [2020-09-04 23:24:33,017 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2020-09-04 23:24:33,029 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:24:33,040 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:24:33,063 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:24:33,093 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:24:33,093 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:24:33,093 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:24:33,093 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:24:33,093 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:24:33,094 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:24:33,094 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:24:33,094 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:24:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2020-09-04 23:24:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-09-04 23:24:33,143 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:33,144 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 23:24:33,145 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:33,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:33,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1657225032, now seen corresponding path program 1 times [2020-09-04 23:24:33,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:33,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [939315689] [2020-09-04 23:24:33,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:33,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:33,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:24:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:33,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:24:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:33,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:24:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:33,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-09-04 23:24:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:33,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 23:24:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:33,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 23:24:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:33,671 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 23:24:33,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [939315689] [2020-09-04 23:24:33,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:24:33,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 23:24:33,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308124621] [2020-09-04 23:24:33,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 23:24:33,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:33,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 23:24:33,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-09-04 23:24:33,704 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 11 states. [2020-09-04 23:24:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:34,970 INFO L93 Difference]: Finished difference Result 366 states and 427 transitions. [2020-09-04 23:24:34,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 23:24:34,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-09-04 23:24:34,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:34,992 INFO L225 Difference]: With dead ends: 366 [2020-09-04 23:24:34,992 INFO L226 Difference]: Without dead ends: 210 [2020-09-04 23:24:34,999 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2020-09-04 23:24:35,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-09-04 23:24:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2020-09-04 23:24:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-09-04 23:24:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 220 transitions. [2020-09-04 23:24:35,098 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 220 transitions. Word has length 60 [2020-09-04 23:24:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:35,099 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 220 transitions. [2020-09-04 23:24:35,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 23:24:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 220 transitions. [2020-09-04 23:24:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-09-04 23:24:35,113 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:35,113 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 23:24:35,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:24:35,114 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:35,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:35,114 INFO L82 PathProgramCache]: Analyzing trace with hash -290171790, now seen corresponding path program 1 times [2020-09-04 23:24:35,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:35,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1476269168] [2020-09-04 23:24:35,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:35,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:35,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:24:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:35,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:24:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:35,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-09-04 23:24:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:35,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:24:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:35,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 23:24:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:35,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2020-09-04 23:24:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:35,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-09-04 23:24:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:35,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 23:24:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:35,479 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 23:24:35,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1476269168] [2020-09-04 23:24:35,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:35,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:24:35,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681518153] [2020-09-04 23:24:35,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:24:35,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:35,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:24:35,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:24:35,493 INFO L87 Difference]: Start difference. First operand 196 states and 220 transitions. Second operand 12 states. [2020-09-04 23:24:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:36,871 INFO L93 Difference]: Finished difference Result 354 states and 400 transitions. [2020-09-04 23:24:36,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 23:24:36,872 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2020-09-04 23:24:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:36,877 INFO L225 Difference]: With dead ends: 354 [2020-09-04 23:24:36,877 INFO L226 Difference]: Without dead ends: 209 [2020-09-04 23:24:36,881 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 23:24:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-09-04 23:24:36,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 198. [2020-09-04 23:24:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-09-04 23:24:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2020-09-04 23:24:36,915 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 80 [2020-09-04 23:24:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:36,916 INFO L479 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2020-09-04 23:24:36,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:24:36,916 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2020-09-04 23:24:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-09-04 23:24:36,918 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:36,918 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 23:24:36,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:24:36,918 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:36,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1366806748, now seen corresponding path program 1 times [2020-09-04 23:24:36,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:36,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1416799464] [2020-09-04 23:24:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:37,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:37,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:24:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:37,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:24:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:37,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:24:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:37,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:24:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:37,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 23:24:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:37,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:24:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:37,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 23:24:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:37,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-09-04 23:24:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:37,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 23:24:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:37,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-09-04 23:24:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:37,246 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 23:24:37,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1416799464] [2020-09-04 23:24:37,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:24:37,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 23:24:37,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376378016] [2020-09-04 23:24:37,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 23:24:37,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:37,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 23:24:37,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:24:37,249 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand 14 states. [2020-09-04 23:24:38,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:38,637 INFO L93 Difference]: Finished difference Result 353 states and 399 transitions. [2020-09-04 23:24:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 23:24:38,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 101 [2020-09-04 23:24:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:38,641 INFO L225 Difference]: With dead ends: 353 [2020-09-04 23:24:38,641 INFO L226 Difference]: Without dead ends: 211 [2020-09-04 23:24:38,642 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 23:24:38,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-09-04 23:24:38,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 200. [2020-09-04 23:24:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-09-04 23:24:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 226 transitions. [2020-09-04 23:24:38,676 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 226 transitions. Word has length 101 [2020-09-04 23:24:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:38,676 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 226 transitions. [2020-09-04 23:24:38,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 23:24:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 226 transitions. [2020-09-04 23:24:38,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-09-04 23:24:38,679 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:38,679 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 23:24:38,679 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:24:38,679 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:38,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1397703292, now seen corresponding path program 1 times [2020-09-04 23:24:38,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:38,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [164321425] [2020-09-04 23:24:38,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:24:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 23:24:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 23:24:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 23:24:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 23:24:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-09-04 23:24:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 23:24:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 23:24:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 23:24:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2020-09-04 23:24:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 23:24:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:38,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 23:24:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:39,033 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 23:24:39,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [164321425] [2020-09-04 23:24:39,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:24:39,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 23:24:39,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951604042] [2020-09-04 23:24:39,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 23:24:39,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:39,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 23:24:39,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-09-04 23:24:39,036 INFO L87 Difference]: Start difference. First operand 200 states and 226 transitions. Second operand 14 states. [2020-09-04 23:24:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:40,501 INFO L93 Difference]: Finished difference Result 336 states and 378 transitions. [2020-09-04 23:24:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 23:24:40,502 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2020-09-04 23:24:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:40,506 INFO L225 Difference]: With dead ends: 336 [2020-09-04 23:24:40,506 INFO L226 Difference]: Without dead ends: 211 [2020-09-04 23:24:40,507 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2020-09-04 23:24:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-09-04 23:24:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 202. [2020-09-04 23:24:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-09-04 23:24:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 230 transitions. [2020-09-04 23:24:40,536 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 230 transitions. Word has length 127 [2020-09-04 23:24:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:40,537 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 230 transitions. [2020-09-04 23:24:40,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 23:24:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 230 transitions. [2020-09-04 23:24:40,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-09-04 23:24:40,539 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:40,540 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 23:24:40,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:24:40,540 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:40,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:40,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1130815571, now seen corresponding path program 1 times [2020-09-04 23:24:40,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:40,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [91290491] [2020-09-04 23:24:40,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:24:40,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:24:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 23:24:40,653 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 23:24:40,725 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 23:24:40,725 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 23:24:40,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:24:40,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:24:40 BoogieIcfgContainer [2020-09-04 23:24:40,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:24:40,862 INFO L168 Benchmark]: Toolchain (without parser) took 9113.08 ms. Allocated memory was 145.8 MB in the beginning and 310.4 MB in the end (delta: 164.6 MB). Free memory was 102.5 MB in the beginning and 197.0 MB in the end (delta: -94.5 MB). Peak memory consumption was 70.1 MB. Max. memory is 7.1 GB. [2020-09-04 23:24:40,863 INFO L168 Benchmark]: CDTParser took 0.87 ms. Allocated memory is still 145.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 23:24:40,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 497.85 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 179.3 MB in the end (delta: -77.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2020-09-04 23:24:40,867 INFO L168 Benchmark]: Boogie Preprocessor took 62.23 ms. Allocated memory is still 203.4 MB. Free memory was 179.3 MB in the beginning and 176.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-09-04 23:24:40,867 INFO L168 Benchmark]: RCFGBuilder took 700.25 ms. Allocated memory is still 203.4 MB. Free memory was 176.7 MB in the beginning and 132.1 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2020-09-04 23:24:40,868 INFO L168 Benchmark]: TraceAbstraction took 7847.60 ms. Allocated memory was 203.4 MB in the beginning and 310.4 MB in the end (delta: 107.0 MB). Free memory was 131.4 MB in the beginning and 197.0 MB in the end (delta: -65.6 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2020-09-04 23:24:40,875 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.87 ms. Allocated memory is still 145.8 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 497.85 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 179.3 MB in the end (delta: -77.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.23 ms. Allocated memory is still 203.4 MB. Free memory was 179.3 MB in the beginning and 176.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 700.25 ms. Allocated memory is still 203.4 MB. Free memory was 176.7 MB in the beginning and 132.1 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7847.60 ms. Allocated memory was 203.4 MB in the beginning and 310.4 MB in the end (delta: 107.0 MB). Free memory was 131.4 MB in the beginning and 197.0 MB in the end (delta: -65.6 MB). Peak memory consumption was 41.4 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: [L108] 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}] [L108] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L108] CALL task(nondet_tree()) VAL [t={-1:0}] [L84] 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}] [L84] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L84] int a = min(t); VAL [a=2147483647, min(t)=2147483647, t={-1:0}, t={-1:0}] [L85] int b; VAL [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}] [L87] CALL, EXPR size(t) VAL [t={-1:0}] [L79] COND FALSE !(!t) VAL [t={-1:0}, t={-1:0}] [L80] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L80] CALL, EXPR size(t->left) VAL [t={0:0}] [L79] COND TRUE !t VAL [t={0:0}, t={0:0}] [L79] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L80] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L80] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L80] CALL, EXPR size(t->right) VAL [t={0:0}] [L79] COND TRUE !t VAL [t={0:0}, t={0:0}] [L79] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L80] 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}] [L80] 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}] [L87] RET, EXPR size(t) VAL [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}] [L87] int n = size(t); VAL [a=2147483647, b={2:0}, n=1, size(t)=1, t={-1:0}, t={-1:0}] [L88] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}] [L89] 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}] [L89] 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}] [L90] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L68] COND FALSE !(!t) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}] [L71] 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}] [L71] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L68] COND TRUE !t VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L69] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L71] 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] [L71] 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] [L72] EXPR i++ VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, i++=1, t={-1:0}, t={-1:0}] [L72] 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] [L72] 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] [L73] 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}] [L73] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L68] COND TRUE !t VAL [\old(i)=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L69] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L73] 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] [L73] 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] [L74] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L90] 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}] [L91] 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] [L91] 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, 206 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.6s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 726 SDtfs, 1454 SDslu, 2163 SDs, 0 SdLazy, 4521 SolverSat, 495 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.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred 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, 4 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s 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...