/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:21:50,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:21:50,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:21:50,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:21:50,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:21:50,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:21:50,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:21:50,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:21:50,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:21:50,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:21:50,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:21:50,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:21:50,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:21:50,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:21:50,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:21:50,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:21:50,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:21:50,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:21:50,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:21:50,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:21:50,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:21:50,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:21:50,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:21:50,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:21:50,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:21:50,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:21:50,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:21:50,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:21:50,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:21:50,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:21:50,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:21:50,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:21:50,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:21:50,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:21:50,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:21:50,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:21:50,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:21:50,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:21:50,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:21:50,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:21:50,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:21:50,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:21:50,398 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:21:50,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:21:50,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:21:50,401 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:21:50,401 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:21:50,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:21:50,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:21:50,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:21:50,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:21:50,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:21:50,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:21:50,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:21:50,403 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:21:50,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:21:50,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:21:50,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:21:50,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:21:50,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:21:50,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:21:50,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:21:50,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:21:50,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:21:50,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:21:50,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:21:50,406 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:21:50,406 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:21:50,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:21:50,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:21:50,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:21:50,897 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:21:50,898 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:21:50,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2021-01-06 19:21:50,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/422df2853/c5f29632d5544820a25d7a5566aa7deb/FLAG4686f2018 [2021-01-06 19:21:51,563 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:21:51,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2021-01-06 19:21:51,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/422df2853/c5f29632d5544820a25d7a5566aa7deb/FLAG4686f2018 [2021-01-06 19:21:51,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/422df2853/c5f29632d5544820a25d7a5566aa7deb [2021-01-06 19:21:51,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:21:51,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:21:51,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:21:51,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:21:51,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:21:51,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:21:51" (1/1) ... [2021-01-06 19:21:51,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13463377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:51, skipping insertion in model container [2021-01-06 19:21:51,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:21:51" (1/1) ... [2021-01-06 19:21:51,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:21:51,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:21:52,145 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],StructAccessExpression[IdentifierExpression[~n~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] [2021-01-06 19:21:52,163 WARN L1512 CHandler]: Possible shadowing of function min left hand side expression in assignment: address: IdentifierExpression[~min,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] [2021-01-06 19:21:52,166 WARN L1512 CHandler]: Possible shadowing of function min left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~t,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~t,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[#t~post24,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 19:21:52,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:21:52,202 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:21:52,217 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],StructAccessExpression[IdentifierExpression[~n~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] [2021-01-06 19:21:52,223 WARN L1512 CHandler]: Possible shadowing of function min left hand side expression in assignment: address: IdentifierExpression[~min,] left hand side expression in assignment: lhs: VariableLHS[~r~0,] [2021-01-06 19:21:52,225 WARN L1512 CHandler]: Possible shadowing of function min left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~t,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~t,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~a,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[#t~post24,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] [2021-01-06 19:21:52,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:21:52,261 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:21:52,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:52 WrapperNode [2021-01-06 19:21:52,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:21:52,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:21:52,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:21:52,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:21:52,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:52" (1/1) ... [2021-01-06 19:21:52,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:52" (1/1) ... [2021-01-06 19:21:52,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:21:52,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:21:52,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:21:52,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:21:52,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:52" (1/1) ... [2021-01-06 19:21:52,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:52" (1/1) ... [2021-01-06 19:21:52,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:52" (1/1) ... [2021-01-06 19:21:52,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:52" (1/1) ... [2021-01-06 19:21:52,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:52" (1/1) ... [2021-01-06 19:21:52,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:52" (1/1) ... [2021-01-06 19:21:52,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:52" (1/1) ... [2021-01-06 19:21:52,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:21:52,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:21:52,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:21:52,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:21:52,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 19:21:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 19:21:52,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:21:52,484 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2021-01-06 19:21:52,484 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2021-01-06 19:21:52,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 19:21:52,485 INFO L130 BoogieDeclarations]: Found specification of procedure min [2021-01-06 19:21:52,485 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2021-01-06 19:21:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 19:21:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 19:21:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2021-01-06 19:21:52,489 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2021-01-06 19:21:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:21:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 19:21:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure size [2021-01-06 19:21:52,490 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2021-01-06 19:21:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:21:52,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:21:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2021-01-06 19:21:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2021-01-06 19:21:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 19:21:53,171 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:21:53,171 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2021-01-06 19:21:53,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:21:53 BoogieIcfgContainer [2021-01-06 19:21:53,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:21:53,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:21:53,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:21:53,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:21:53,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:21:51" (1/3) ... [2021-01-06 19:21:53,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37017737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:21:53, skipping insertion in model container [2021-01-06 19:21:53,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:21:52" (2/3) ... [2021-01-06 19:21:53,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37017737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:21:53, skipping insertion in model container [2021-01-06 19:21:53,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:21:53" (3/3) ... [2021-01-06 19:21:53,182 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2021-01-06 19:21:53,189 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:21:53,195 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2021-01-06 19:21:53,214 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-01-06 19:21:53,248 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:21:53,249 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:21:53,249 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:21:53,249 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:21:53,249 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:21:53,249 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:21:53,249 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:21:53,249 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:21:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2021-01-06 19:21:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 19:21:53,277 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:53,278 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] [2021-01-06 19:21:53,278 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1095170897, now seen corresponding path program 1 times [2021-01-06 19:21:53,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:53,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129349148] [2021-01-06 19:21:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:53,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:53,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-01-06 19:21:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:53,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-01-06 19:21:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:53,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-01-06 19:21:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:21:53,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129349148] [2021-01-06 19:21:53,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:21:53,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:21:53,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942498043] [2021-01-06 19:21:53,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:21:53,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:53,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:21:53,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:21:53,637 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2021-01-06 19:21:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:53,972 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2021-01-06 19:21:53,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:21:53,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2021-01-06 19:21:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:53,988 INFO L225 Difference]: With dead ends: 142 [2021-01-06 19:21:53,989 INFO L226 Difference]: Without dead ends: 81 [2021-01-06 19:21:53,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:21:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-01-06 19:21:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2021-01-06 19:21:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2021-01-06 19:21:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2021-01-06 19:21:54,124 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 30 [2021-01-06 19:21:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:54,128 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2021-01-06 19:21:54,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:21:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2021-01-06 19:21:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 19:21:54,138 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:54,138 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] [2021-01-06 19:21:54,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:21:54,139 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:54,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:54,143 INFO L82 PathProgramCache]: Analyzing trace with hash -394106319, now seen corresponding path program 1 times [2021-01-06 19:21:54,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:54,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159788745] [2021-01-06 19:21:54,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:54,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:54,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-01-06 19:21:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:54,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-01-06 19:21:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:54,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-01-06 19:21:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:21:54,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159788745] [2021-01-06 19:21:54,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:21:54,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:21:54,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902511335] [2021-01-06 19:21:54,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:21:54,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:54,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:21:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:21:54,402 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 7 states. [2021-01-06 19:21:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:54,770 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2021-01-06 19:21:54,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:21:54,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2021-01-06 19:21:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:54,774 INFO L225 Difference]: With dead ends: 136 [2021-01-06 19:21:54,775 INFO L226 Difference]: Without dead ends: 83 [2021-01-06 19:21:54,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:21:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-01-06 19:21:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2021-01-06 19:21:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-01-06 19:21:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2021-01-06 19:21:54,797 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 30 [2021-01-06 19:21:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:54,797 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2021-01-06 19:21:54,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:21:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2021-01-06 19:21:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 19:21:54,800 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:54,800 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] [2021-01-06 19:21:54,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:21:54,801 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:54,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:54,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1904559170, now seen corresponding path program 1 times [2021-01-06 19:21:54,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:54,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235055578] [2021-01-06 19:21:54,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:54,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:54,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-01-06 19:21:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:54,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-01-06 19:21:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:21:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-01-06 19:21:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:21:55,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235055578] [2021-01-06 19:21:55,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125269123] [2021-01-06 19:21:55,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 19:21:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:55,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-06 19:21:55,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:21:55,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:21:55,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2021-01-06 19:21:55,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479478611] [2021-01-06 19:21:55,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:21:55,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:55,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:21:55,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:21:55,465 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand 9 states. [2021-01-06 19:21:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:55,929 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2021-01-06 19:21:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:21:55,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2021-01-06 19:21:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:55,932 INFO L225 Difference]: With dead ends: 142 [2021-01-06 19:21:55,933 INFO L226 Difference]: Without dead ends: 83 [2021-01-06 19:21:55,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:21:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-01-06 19:21:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2021-01-06 19:21:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2021-01-06 19:21:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2021-01-06 19:21:55,950 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 42 [2021-01-06 19:21:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:55,951 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2021-01-06 19:21:55,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:21:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2021-01-06 19:21:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 19:21:55,954 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:55,954 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] [2021-01-06 19:21:56,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 19:21:56,168 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:56,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:56,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1838253317, now seen corresponding path program 1 times [2021-01-06 19:21:56,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:56,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026776832] [2021-01-06 19:21:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:21:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:21:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-01-06 19:21:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:21:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:21:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-01-06 19:21:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 19:21:56,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026776832] [2021-01-06 19:21:56,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:21:56,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:21:56,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666975812] [2021-01-06 19:21:56,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:21:56,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:56,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:21:56,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:21:56,512 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 10 states. [2021-01-06 19:21:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:56,916 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2021-01-06 19:21:56,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:21:56,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2021-01-06 19:21:56,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:56,918 INFO L225 Difference]: With dead ends: 142 [2021-01-06 19:21:56,919 INFO L226 Difference]: Without dead ends: 85 [2021-01-06 19:21:56,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:21:56,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-01-06 19:21:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2021-01-06 19:21:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-01-06 19:21:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2021-01-06 19:21:56,934 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 52 [2021-01-06 19:21:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:56,935 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2021-01-06 19:21:56,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:21:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2021-01-06 19:21:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:21:56,938 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:56,938 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] [2021-01-06 19:21:56,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:21:56,939 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1543692906, now seen corresponding path program 1 times [2021-01-06 19:21:56,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:56,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203445095] [2021-01-06 19:21:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-01-06 19:21:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-06 19:21:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-01-06 19:21:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:21:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-01-06 19:21:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:21:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-01-06 19:21:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-01-06 19:21:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-01-06 19:21:57,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203445095] [2021-01-06 19:21:57,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120709199] [2021-01-06 19:21:57,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:21:57,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-06 19:21:57,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:21:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-01-06 19:21:57,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:21:57,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 17 [2021-01-06 19:21:57,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037151542] [2021-01-06 19:21:57,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:21:57,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:21:57,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:21:57,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:21:57,750 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand 8 states. [2021-01-06 19:21:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:21:57,896 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2021-01-06 19:21:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:21:57,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2021-01-06 19:21:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:21:57,903 INFO L225 Difference]: With dead ends: 134 [2021-01-06 19:21:57,903 INFO L226 Difference]: Without dead ends: 84 [2021-01-06 19:21:57,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-01-06 19:21:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-01-06 19:21:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-01-06 19:21:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-06 19:21:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2021-01-06 19:21:57,941 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 65 [2021-01-06 19:21:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:21:57,942 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2021-01-06 19:21:57,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:21:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2021-01-06 19:21:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:21:57,952 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:21:57,953 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] [2021-01-06 19:21:58,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:21:58,168 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:21:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:21:58,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1767582969, now seen corresponding path program 1 times [2021-01-06 19:21:58,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:21:58,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959857190] [2021-01-06 19:21:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:21:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:21:58,234 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:21:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:21:58,287 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:21:58,345 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 19:21:58,346 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 19:21:58,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:21:58,391 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,392 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,393 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,393 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,394 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,394 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,394 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,395 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,395 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,397 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,398 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,398 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 07:21:58 BoogieIcfgContainer [2021-01-06 19:21:58,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 19:21:58,462 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 19:21:58,462 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 19:21:58,462 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 19:21:58,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:21:53" (3/4) ... [2021-01-06 19:21:58,465 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 19:21:58,473 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,473 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,474 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,474 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,475 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,475 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,475 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,475 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,476 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,476 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,476 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,476 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2021-01-06 19:21:58,597 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/verifythis/tree_del_rec_incorrect.c-witness.graphml [2021-01-06 19:21:58,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 19:21:58,605 INFO L168 Benchmark]: Toolchain (without parser) took 6676.91 ms. Allocated memory was 172.0 MB in the beginning and 225.4 MB in the end (delta: 53.5 MB). Free memory was 146.3 MB in the beginning and 82.2 MB in the end (delta: 64.0 MB). Peak memory consumption was 119.0 MB. Max. memory is 8.0 GB. [2021-01-06 19:21:58,606 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 172.0 MB. Free memory is still 143.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:21:58,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.14 ms. Allocated memory is still 172.0 MB. Free memory was 145.9 MB in the beginning and 134.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-01-06 19:21:58,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.82 ms. Allocated memory is still 172.0 MB. Free memory was 134.0 MB in the beginning and 132.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:21:58,608 INFO L168 Benchmark]: Boogie Preprocessor took 44.31 ms. Allocated memory is still 172.0 MB. Free memory was 132.1 MB in the beginning and 130.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:21:58,609 INFO L168 Benchmark]: RCFGBuilder took 816.57 ms. Allocated memory is still 172.0 MB. Free memory was 130.3 MB in the beginning and 135.7 MB in the end (delta: -5.4 MB). Peak memory consumption was 16.2 MB. Max. memory is 8.0 GB. [2021-01-06 19:21:58,609 INFO L168 Benchmark]: TraceAbstraction took 5285.95 ms. Allocated memory was 172.0 MB in the beginning and 225.4 MB in the end (delta: 53.5 MB). Free memory was 135.2 MB in the beginning and 89.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 100.7 MB. Max. memory is 8.0 GB. [2021-01-06 19:21:58,610 INFO L168 Benchmark]: Witness Printer took 140.64 ms. Allocated memory is still 225.4 MB. Free memory was 88.5 MB in the beginning and 82.2 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2021-01-06 19:21:58,615 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 172.0 MB. Free memory is still 143.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 333.14 ms. Allocated memory is still 172.0 MB. Free memory was 145.9 MB in the beginning and 134.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 47.82 ms. Allocated memory is still 172.0 MB. Free memory was 134.0 MB in the beginning and 132.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.31 ms. Allocated memory is still 172.0 MB. Free memory was 132.1 MB in the beginning and 130.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 816.57 ms. Allocated memory is still 172.0 MB. Free memory was 130.3 MB in the beginning and 135.7 MB in the end (delta: -5.4 MB). Peak memory consumption was 16.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5285.95 ms. Allocated memory was 172.0 MB in the beginning and 225.4 MB in the end (delta: 53.5 MB). Free memory was 135.2 MB in the beginning and 89.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 100.7 MB. Max. memory is 8.0 GB. * Witness Printer took 140.64 ms. Allocated memory is still 225.4 MB. Free memory was 88.5 MB in the beginning and 82.2 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L98] CALL nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-2:0}, n={-2:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-2:0}, n={-2:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-2:0}, malloc(sizeof(struct node))={-2:0}, n={-2:0}] [L98] RET nondet_tree() [L76] CALL, EXPR min(t) VAL [n={-2:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={-2:0}, n={-2:0}, n->left={0:0}] [L40] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n={-2:0}, n={-2:0}, n->left={0:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-2:0}, n={-2:0}] [L76] RET, EXPR min(t) [L76] int a = min(t); [L77] int b; [L79] CALL, EXPR size(t) VAL [t={-2:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t={-2:0}, t={-2:0}, t->left={0:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}] [L72] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) [L79] int n = size(t); [L10] COND FALSE !(!cond) [L81] int *x = calloc(n, sizeof(int)); [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-2:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}] [L82] RET tree_inorder(t, x, n) [L83] x[0] [L16] COND TRUE !cond [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 81 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.1s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 398 SDtfs, 224 SDslu, 1432 SDs, 0 SdLazy, 809 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=5, 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, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 319 ConstructedInterpolants, 0 QuantifiedInterpolants, 47715 SizeOfPredicates, 13 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 105/111 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...