/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:47:49,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:47:49,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:47:49,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:47:49,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:47:49,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:47:49,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:47:49,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:47:49,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:47:49,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:47:49,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:47:49,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:47:49,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:47:49,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:47:49,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:47:49,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:47:49,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:47:49,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:47:49,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:47:49,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:47:49,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:47:49,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:47:49,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:47:49,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:47:49,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:47:49,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:47:49,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:47:49,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:47:49,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:47:49,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:47:49,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:47:49,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:47:49,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:47:49,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:47:49,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:47:49,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:47:49,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:47:49,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:47:49,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:47:49,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:47:49,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:47:49,586 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 21:47:49,593 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:47:49,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:47:49,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:47:49,594 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:47:49,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:47:49,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:47:49,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:47:49,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:47:49,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:47:49,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:47:49,595 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:47:49,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:47:49,596 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:47:49,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:47:49,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:47:49,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:47:49,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:47:49,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:47:49,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:47:49,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:47:49,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:47:49,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:47:49,597 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:47:49,597 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 21:47:49,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:47:49,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:47:49,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:47:49,840 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:47:49,841 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:47:49,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-01-31 21:47:49,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa580dce/cc1834e4ad904ab2bb8fa63e012640dc/FLAGe0369677d [2022-01-31 21:47:50,258 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:47:50,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2022-01-31 21:47:50,265 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa580dce/cc1834e4ad904ab2bb8fa63e012640dc/FLAGe0369677d [2022-01-31 21:47:50,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa580dce/cc1834e4ad904ab2bb8fa63e012640dc [2022-01-31 21:47:50,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:47:50,279 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:47:50,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:47:50,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:47:50,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:47:50,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:47:50" (1/1) ... [2022-01-31 21:47:50,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc5d9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:50, skipping insertion in model container [2022-01-31 21:47:50,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:47:50" (1/1) ... [2022-01-31 21:47:50,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:47:50,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:47:50,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632] [2022-01-31 21:47:50,432 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-31 21:47:50,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:47:50,465 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:47:50,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c[619,632] [2022-01-31 21:47:50,480 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-31 21:47:50,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:47:50,499 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:47:50,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:50 WrapperNode [2022-01-31 21:47:50,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:47:50,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:47:50,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:47:50,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:47:50,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:50" (1/1) ... [2022-01-31 21:47:50,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:50" (1/1) ... [2022-01-31 21:47:50,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:50" (1/1) ... [2022-01-31 21:47:50,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:50" (1/1) ... [2022-01-31 21:47:50,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:50" (1/1) ... [2022-01-31 21:47:50,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:50" (1/1) ... [2022-01-31 21:47:50,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:50" (1/1) ... [2022-01-31 21:47:50,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:47:50,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:47:50,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:47:50,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:47:50,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:50" (1/1) ... [2022-01-31 21:47:50,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:47:50,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:47:50,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 21:47:50,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 21:47:50,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:47:50,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:47:50,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 21:47:50,604 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:47:50,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 21:47:50,604 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-01-31 21:47:50,604 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-01-31 21:47:50,604 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-01-31 21:47:50,604 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-01-31 21:47:50,605 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-01-31 21:47:50,605 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-01-31 21:47:50,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:47:50,605 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-01-31 21:47:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-01-31 21:47:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 21:47:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-01-31 21:47:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 21:47:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-01-31 21:47:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:47:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 21:47:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:47:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:47:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:47:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 21:47:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-01-31 21:47:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 21:47:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:47:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-31 21:47:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-01-31 21:47:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-31 21:47:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-01-31 21:47:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:47:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:47:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-01-31 21:47:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-01-31 21:47:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-01-31 21:47:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 21:47:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-01-31 21:47:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:47:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:47:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:47:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:47:50,699 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:47:50,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:47:50,958 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:47:50,964 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:47:50,964 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 21:47:50,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:47:50 BoogieIcfgContainer [2022-01-31 21:47:50,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:47:50,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:47:50,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:47:50,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:47:50,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:47:50" (1/3) ... [2022-01-31 21:47:50,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25211fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:47:50, skipping insertion in model container [2022-01-31 21:47:50,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:47:50" (2/3) ... [2022-01-31 21:47:50,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25211fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:47:50, skipping insertion in model container [2022-01-31 21:47:50,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:47:50" (3/3) ... [2022-01-31 21:47:50,980 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2022-01-31 21:47:50,984 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:47:50,984 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:47:51,021 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:47:51,029 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-01-31 21:47:51,029 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:47:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-01-31 21:47:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:47:51,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:51,072 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:47:51,073 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:51,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:51,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1536185801, now seen corresponding path program 1 times [2022-01-31 21:47:51,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:51,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1055465714] [2022-01-31 21:47:51,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:51,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:51,153 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:51,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:47:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:51,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:51,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:51,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 21:47:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:51,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 21:47:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:51,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:47:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:47:51,453 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:51,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1055465714] [2022-01-31 21:47:51,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1055465714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:51,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:51,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:47:51,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182406996] [2022-01-31 21:47:51,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:51,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:47:51,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:51,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:47:51,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:47:51,493 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 59 states have internal predecessors, (71), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:47:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:51,847 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2022-01-31 21:47:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:47:51,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-01-31 21:47:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:51,857 INFO L225 Difference]: With dead ends: 168 [2022-01-31 21:47:51,857 INFO L226 Difference]: Without dead ends: 95 [2022-01-31 21:47:51,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:47:51,863 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 167 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:51,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 80 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:47:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-31 21:47:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2022-01-31 21:47:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-01-31 21:47:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-01-31 21:47:51,907 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 44 [2022-01-31 21:47:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:51,907 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-01-31 21:47:51,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:47:51,908 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-01-31 21:47:51,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:47:51,910 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:51,910 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:47:51,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:47:51,911 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:51,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:51,911 INFO L85 PathProgramCache]: Analyzing trace with hash -152757941, now seen corresponding path program 1 times [2022-01-31 21:47:51,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:51,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1869335654] [2022-01-31 21:47:51,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:51,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:51,915 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:51,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:47:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 21:47:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 21:47:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:47:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:47:52,113 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:52,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1869335654] [2022-01-31 21:47:52,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1869335654] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:52,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:52,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:47:52,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310758234] [2022-01-31 21:47:52,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:52,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:47:52,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:52,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:47:52,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:47:52,118 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:47:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:52,688 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2022-01-31 21:47:52,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:47:52,689 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-01-31 21:47:52,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:52,698 INFO L225 Difference]: With dead ends: 154 [2022-01-31 21:47:52,698 INFO L226 Difference]: Without dead ends: 97 [2022-01-31 21:47:52,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:47:52,703 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 98 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:52,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 79 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:47:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-31 21:47:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-01-31 21:47:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-01-31 21:47:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-01-31 21:47:52,728 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 44 [2022-01-31 21:47:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:52,728 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-01-31 21:47:52,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:47:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-01-31 21:47:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 21:47:52,730 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:52,731 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:47:52,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:47:52,731 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:52,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:52,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2001282500, now seen corresponding path program 1 times [2022-01-31 21:47:52,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:52,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1701994774] [2022-01-31 21:47:52,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:52,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:52,734 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:47:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:47:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:47:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:47:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:47:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 21:47:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 21:47:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 21:47:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 21:47:52,997 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:52,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1701994774] [2022-01-31 21:47:52,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1701994774] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:52,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:52,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:47:52,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428792734] [2022-01-31 21:47:52,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:52,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:47:52,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:53,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:47:53,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:47:53,000 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-31 21:47:53,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:53,752 INFO L93 Difference]: Finished difference Result 164 states and 209 transitions. [2022-01-31 21:47:53,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:47:53,752 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 56 [2022-01-31 21:47:53,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:53,754 INFO L225 Difference]: With dead ends: 164 [2022-01-31 21:47:53,754 INFO L226 Difference]: Without dead ends: 96 [2022-01-31 21:47:53,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:47:53,756 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 175 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:53,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 84 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:47:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-01-31 21:47:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2022-01-31 21:47:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-01-31 21:47:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2022-01-31 21:47:53,787 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 56 [2022-01-31 21:47:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:53,787 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2022-01-31 21:47:53,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 7 states have internal predecessors, (32), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-31 21:47:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2022-01-31 21:47:53,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 21:47:53,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:53,796 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:47:53,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:47:53,796 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:53,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:53,797 INFO L85 PathProgramCache]: Analyzing trace with hash 921875361, now seen corresponding path program 1 times [2022-01-31 21:47:53,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:53,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [623315804] [2022-01-31 21:47:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:53,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:53,802 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:53,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:53,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:47:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:53,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:53,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:53,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:47:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:47:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:53,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:47:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:53,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:47:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 21:47:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:53,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 21:47:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 21:47:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 21:47:54,002 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:54,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [623315804] [2022-01-31 21:47:54,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [623315804] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:54,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:54,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:47:54,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952374917] [2022-01-31 21:47:54,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:54,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:47:54,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:54,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:47:54,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:47:54,004 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-01-31 21:47:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:54,634 INFO L93 Difference]: Finished difference Result 163 states and 208 transitions. [2022-01-31 21:47:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:47:54,635 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 66 [2022-01-31 21:47:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:54,636 INFO L225 Difference]: With dead ends: 163 [2022-01-31 21:47:54,636 INFO L226 Difference]: Without dead ends: 98 [2022-01-31 21:47:54,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:47:54,638 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 168 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:54,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 82 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:47:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-01-31 21:47:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2022-01-31 21:47:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-01-31 21:47:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2022-01-31 21:47:54,661 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 66 [2022-01-31 21:47:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:54,661 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2022-01-31 21:47:54,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-01-31 21:47:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2022-01-31 21:47:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-31 21:47:54,663 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:54,663 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:47:54,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:47:54,663 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:54,664 INFO L85 PathProgramCache]: Analyzing trace with hash 940648973, now seen corresponding path program 1 times [2022-01-31 21:47:54,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:54,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [596362309] [2022-01-31 21:47:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:54,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:54,666 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:47:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:47:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:47:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:47:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 21:47:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:47:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:47:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-31 21:47:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:47:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:47:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-31 21:47:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-31 21:47:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:47:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:47:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-31 21:47:54,875 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:47:54,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [596362309] [2022-01-31 21:47:54,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [596362309] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:47:54,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:47:54,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:47:54,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836941639] [2022-01-31 21:47:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:47:54,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:47:54,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:47:54,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:47:54,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:47:54,877 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-31 21:47:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:47:55,480 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2022-01-31 21:47:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:47:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 79 [2022-01-31 21:47:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:47:55,482 INFO L225 Difference]: With dead ends: 151 [2022-01-31 21:47:55,482 INFO L226 Difference]: Without dead ends: 98 [2022-01-31 21:47:55,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:47:55,484 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 196 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:47:55,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 82 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:47:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-01-31 21:47:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-01-31 21:47:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 61 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-01-31 21:47:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2022-01-31 21:47:55,500 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 79 [2022-01-31 21:47:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:47:55,501 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2022-01-31 21:47:55,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 7 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-31 21:47:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2022-01-31 21:47:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-31 21:47:55,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:47:55,502 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:47:55,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:47:55,502 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:47:55,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:47:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1677199096, now seen corresponding path program 1 times [2022-01-31 21:47:55,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:47:55,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [82792981] [2022-01-31 21:47:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:47:55,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:47:55,505 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:47:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 21:47:55,531 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-31 21:47:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 21:47:55,574 INFO L133 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2022-01-31 21:47:55,575 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-31 21:47:55,577 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 21:47:55,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:47:55,581 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-01-31 21:47:55,584 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 21:47:55,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:47:55 BoogieIcfgContainer [2022-01-31 21:47:55,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 21:47:55,597 INFO L158 Benchmark]: Toolchain (without parser) took 5317.44ms. Allocated memory was 178.3MB in the beginning and 232.8MB in the end (delta: 54.5MB). Free memory was 122.4MB in the beginning and 95.2MB in the end (delta: 27.2MB). Peak memory consumption was 81.4MB. Max. memory is 8.0GB. [2022-01-31 21:47:55,597 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 21:47:55,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.73ms. Allocated memory was 178.3MB in the beginning and 232.8MB in the end (delta: 54.5MB). Free memory was 122.2MB in the beginning and 202.8MB in the end (delta: -80.6MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-01-31 21:47:55,598 INFO L158 Benchmark]: Boogie Preprocessor took 38.11ms. Allocated memory is still 232.8MB. Free memory was 202.8MB in the beginning and 200.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 21:47:55,598 INFO L158 Benchmark]: RCFGBuilder took 426.67ms. Allocated memory is still 232.8MB. Free memory was 200.7MB in the beginning and 180.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-01-31 21:47:55,598 INFO L158 Benchmark]: TraceAbstraction took 4628.78ms. Allocated memory is still 232.8MB. Free memory was 179.7MB in the beginning and 95.2MB in the end (delta: 84.5MB). Peak memory consumption was 85.5MB. Max. memory is 8.0GB. [2022-01-31 21:47:55,599 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.13ms. Allocated memory is still 178.3MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.73ms. Allocated memory was 178.3MB in the beginning and 232.8MB in the end (delta: 54.5MB). Free memory was 122.2MB in the beginning and 202.8MB in the end (delta: -80.6MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.11ms. Allocated memory is still 232.8MB. Free memory was 202.8MB in the beginning and 200.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 426.67ms. Allocated memory is still 232.8MB. Free memory was 200.7MB in the beginning and 180.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4628.78ms. Allocated memory is still 232.8MB. Free memory was 179.7MB in the beginning and 95.2MB in the end (delta: 84.5MB). Peak memory consumption was 85.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L105] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; [L30] RET, EXPR nondet_tree() [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; [L31] RET, EXPR nondet_tree() [L31] n->right = nondet_tree() [L32] return n; [L105] RET, EXPR nondet_tree() [L105] CALL task(nondet_tree()) [L83] CALL, EXPR min(t) [L37] COND FALSE !(!n) [L40] EXPR n->left [L40] CALL, EXPR min(n->left) [L37] COND TRUE !n [L38] return 2147483647; [L40] RET, EXPR min(n->left) [L40] int a = min(n->left); [L41] EXPR n->right [L41] CALL, EXPR min(n->right) [L37] COND TRUE !n [L38] return 2147483647; [L41] RET, EXPR min(n->right) [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; [L83] RET, EXPR min(t) [L83] int a = min(t); [L84] int b; [L86] CALL, EXPR size(t) [L78] COND FALSE !(!t) [L79] EXPR t->left [L79] CALL, EXPR size(t->left) [L78] COND TRUE !t [L78] return 0; [L79] RET, EXPR size(t->left) [L79] EXPR t->right [L79] CALL, EXPR size(t->right) [L78] COND TRUE !t [L78] return 0; [L79] RET, EXPR size(t->right) [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) [L87] RET assume_abort_if_not(n != 0) [L88] EXPR, FCALL calloc(n, sizeof(int)) [L88] int *x = calloc(n, sizeof(int)); [L89] CALL tree_inorder(t, x, n) [L67] COND FALSE !(!t) [L70] EXPR t->left [L70] CALL, EXPR tree_inorder(t->left, a, i) [L67] COND TRUE !t [L68] return i; [L70] RET, EXPR tree_inorder(t->left, a, i) [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right [L72] CALL, EXPR tree_inorder(t->right, a, i) [L67] COND TRUE !t [L68] return i; [L72] RET, EXPR tree_inorder(t->right, a, i) [L72] i = tree_inorder(t->right, a, i) [L73] return i; [L89] RET tree_inorder(t, x, n) [L90] EXPR x[0] [L90] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 859 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 804 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 779 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3216 IncrementalHoareTripleChecker+Invalid, 3995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 779 mSolverCounterUnsat, 353 mSDtfsCounter, 3216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 61, 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, 24 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-31 21:47:55,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...