/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain EqDomain -i ../sv-benchmarks/c/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 11:12:29,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 11:12:29,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 11:12:29,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 11:12:29,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 11:12:29,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 11:12:29,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 11:12:29,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 11:12:29,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 11:12:29,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 11:12:29,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 11:12:29,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 11:12:29,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 11:12:29,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 11:12:29,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 11:12:29,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 11:12:29,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 11:12:29,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 11:12:29,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 11:12:29,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 11:12:29,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 11:12:29,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 11:12:29,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 11:12:29,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 11:12:29,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 11:12:29,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 11:12:29,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 11:12:29,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 11:12:29,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 11:12:29,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 11:12:29,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 11:12:29,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 11:12:29,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 11:12:29,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 11:12:29,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 11:12:29,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 11:12:29,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 11:12:29,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 11:12:29,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 11:12:29,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 11:12:29,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 11:12:29,705 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 11:12:29,725 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 11:12:29,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 11:12:29,725 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 11:12:29,725 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 11:12:29,726 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 11:12:29,726 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 11:12:29,726 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 11:12:29,727 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 11:12:29,727 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 11:12:29,727 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 11:12:29,727 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 11:12:29,727 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 11:12:29,727 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 11:12:29,727 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 11:12:29,727 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 11:12:29,728 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 11:12:29,728 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 11:12:29,728 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 11:12:29,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 11:12:29,729 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 11:12:29,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 11:12:29,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 11:12:29,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 11:12:29,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 11:12:29,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 11:12:29,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 11:12:29,730 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 11:12:29,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 11:12:29,730 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 11:12:29,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 11:12:29,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 11:12:29,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 11:12:29,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 11:12:29,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 11:12:29,731 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 11:12:29,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 11:12:29,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 11:12:29,731 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 11:12:29,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 11:12:29,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 11:12:29,731 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 11:12:29,732 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/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.plugins.sifa: Abstract Domain -> EqDomain [2023-04-01 11:12:29,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 11:12:29,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 11:12:29,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 11:12:29,961 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 11:12:29,961 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 11:12:29,962 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter.c [2023-04-01 11:12:31,195 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 11:12:31,420 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 11:12:31,421 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c [2023-04-01 11:12:31,426 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6aaaa93/21a640d0130248ba8f3d0bec98df184d/FLAG477307710 [2023-04-01 11:12:31,443 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6aaaa93/21a640d0130248ba8f3d0bec98df184d [2023-04-01 11:12:31,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 11:12:31,448 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 11:12:31,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 11:12:31,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 11:12:31,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 11:12:31,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 11:12:31" (1/1) ... [2023-04-01 11:12:31,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51212540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:12:31, skipping insertion in model container [2023-04-01 11:12:31,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 11:12:31" (1/1) ... [2023-04-01 11:12:31,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 11:12:31,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 11:12:31,588 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2023-04-01 11:12:31,605 WARN L1562 CHandler]: Possible shadowing of function min [2023-04-01 11:12:31,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 11:12:31,628 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 11:12:31,639 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2023-04-01 11:12:31,651 WARN L1562 CHandler]: Possible shadowing of function min [2023-04-01 11:12:31,658 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 11:12:31,673 INFO L208 MainTranslator]: Completed translation [2023-04-01 11:12:31,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:12:31 WrapperNode [2023-04-01 11:12:31,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 11:12:31,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 11:12:31,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 11:12:31,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 11:12:31,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:12:31" (1/1) ... [2023-04-01 11:12:31,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:12:31" (1/1) ... [2023-04-01 11:12:31,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:12:31" (1/1) ... [2023-04-01 11:12:31,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:12:31" (1/1) ... [2023-04-01 11:12:31,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:12:31" (1/1) ... [2023-04-01 11:12:31,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:12:31" (1/1) ... [2023-04-01 11:12:31,719 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:12:31" (1/1) ... [2023-04-01 11:12:31,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:12:31" (1/1) ... [2023-04-01 11:12:31,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 11:12:31,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 11:12:31,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 11:12:31,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 11:12:31,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:12:31" (1/1) ... [2023-04-01 11:12:31,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 11:12:31,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:12:31,752 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) [2023-04-01 11:12:31,764 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 [2023-04-01 11:12:31,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 11:12:31,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 11:12:31,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2023-04-01 11:12:31,787 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 11:12:31,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 11:12:31,787 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-04-01 11:12:31,787 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-04-01 11:12:31,787 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2023-04-01 11:12:31,787 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-04-01 11:12:31,787 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-04-01 11:12:31,788 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2023-04-01 11:12:31,788 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 11:12:31,788 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-04-01 11:12:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-01 11:12:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 11:12:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-01 11:12:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 11:12:31,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2023-04-01 11:12:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2023-04-01 11:12:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 11:12:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 11:12:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 11:12:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 11:12:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 11:12:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-04-01 11:12:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 11:12:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 11:12:31,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-01 11:12:31,790 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-04-01 11:12:31,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 11:12:31,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-01 11:12:31,790 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2023-04-01 11:12:31,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 11:12:31,790 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-04-01 11:12:31,790 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-04-01 11:12:31,790 INFO L130 BoogieDeclarations]: Found specification of procedure task [2023-04-01 11:12:31,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-01 11:12:31,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-04-01 11:12:31,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 11:12:31,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 11:12:31,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 11:12:31,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 11:12:31,887 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 11:12:31,889 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 11:12:32,272 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 11:12:32,318 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 11:12:32,318 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-01 11:12:32,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 11:12:32 BoogieIcfgContainer [2023-04-01 11:12:32,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 11:12:32,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 11:12:32,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 11:12:32,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 11:12:32,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 11:12:31" (1/3) ... [2023-04-01 11:12:32,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d15428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 11:12:32, skipping insertion in model container [2023-04-01 11:12:32,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:12:31" (2/3) ... [2023-04-01 11:12:32,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d15428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 11:12:32, skipping insertion in model container [2023-04-01 11:12:32,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 11:12:32" (3/3) ... [2023-04-01 11:12:32,329 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2023-04-01 11:12:32,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 11:12:32,345 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 11:12:32,390 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 11:12:32,414 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@655c718a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 11:12:32,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 11:12:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 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) [2023-04-01 11:12:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-04-01 11:12:32,427 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:12:32,428 INFO L195 NwaCegarLoop]: 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] [2023-04-01 11:12:32,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:12:32,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:12:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1649230254, now seen corresponding path program 1 times [2023-04-01 11:12:32,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:12:32,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088816554] [2023-04-01 11:12:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:12:32,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:12:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:12:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:12:32,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:12:32,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088816554] [2023-04-01 11:12:32,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088816554] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:12:32,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:12:32,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 11:12:32,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577098699] [2023-04-01 11:12:32,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:12:32,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 11:12:32,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:12:33,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 11:12:33,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-04-01 11:12:33,017 INFO L87 Difference]: Start difference. First operand has 89 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 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 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 11:12:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:12:33,194 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2023-04-01 11:12:33,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 11:12:33,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (10), 2 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 43 [2023-04-01 11:12:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:12:33,207 INFO L225 Difference]: With dead ends: 151 [2023-04-01 11:12:33,208 INFO L226 Difference]: Without dead ends: 85 [2023-04-01 11:12:33,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-04-01 11:12:33,219 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 4 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:12:33,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 566 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:12:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-04-01 11:12:33,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-04-01 11:12:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 50 states have internal predecessors, (56), 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) [2023-04-01 11:12:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2023-04-01 11:12:33,290 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 43 [2023-04-01 11:12:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:12:33,290 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2023-04-01 11:12:33,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 11:12:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2023-04-01 11:12:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 11:12:33,296 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:12:33,296 INFO L195 NwaCegarLoop]: 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] [2023-04-01 11:12:33,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 11:12:33,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:12:33,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:12:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash 645644837, now seen corresponding path program 1 times [2023-04-01 11:12:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:12:33,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038610230] [2023-04-01 11:12:33,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:12:33,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:12:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:12:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 11:12:33,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:12:33,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038610230] [2023-04-01 11:12:33,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038610230] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:12:33,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143815129] [2023-04-01 11:12:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:12:33,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:12:33,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:12:33,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 11:12:33,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 11:12:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:12:33,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-01 11:12:33,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:12:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 11:12:33,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:12:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 11:12:34,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143815129] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:12:34,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854191106] [2023-04-01 11:12:34,194 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2023-04-01 11:12:34,195 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:12:34,199 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 11:12:34,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 11:12:34,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2023-04-01 11:12:34,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615216137] [2023-04-01 11:12:34,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 11:12:34,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 11:12:34,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:12:34,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 11:12:34,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-04-01 11:12:34,206 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-01 11:12:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:12:34,414 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2023-04-01 11:12:34,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 11:12:34,415 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 55 [2023-04-01 11:12:34,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:12:34,417 INFO L225 Difference]: With dead ends: 151 [2023-04-01 11:12:34,417 INFO L226 Difference]: Without dead ends: 87 [2023-04-01 11:12:34,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-04-01 11:12:34,419 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 15 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:12:34,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 663 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:12:34,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-04-01 11:12:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-04-01 11:12:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 50 states have (on average 1.14) internal successors, (57), 52 states have internal predecessors, (57), 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) [2023-04-01 11:12:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2023-04-01 11:12:34,430 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 55 [2023-04-01 11:12:34,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:12:34,431 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2023-04-01 11:12:34,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-01 11:12:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2023-04-01 11:12:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-04-01 11:12:34,433 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:12:34,433 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-04-01 11:12:34,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 11:12:34,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:12:34,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:12:34,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:12:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1841599442, now seen corresponding path program 1 times [2023-04-01 11:12:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:12:34,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409812913] [2023-04-01 11:12:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:12:34,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:12:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:12:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 11:12:34,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:12:34,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409812913] [2023-04-01 11:12:34,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409812913] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:12:34,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:12:34,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-04-01 11:12:34,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59081099] [2023-04-01 11:12:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:12:34,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 11:12:34,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:12:34,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 11:12:34,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-04-01 11:12:34,904 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-04-01 11:12:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:12:35,087 INFO L93 Difference]: Finished difference Result 150 states and 191 transitions. [2023-04-01 11:12:35,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 11:12:35,087 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (14), 3 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 67 [2023-04-01 11:12:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:12:35,089 INFO L225 Difference]: With dead ends: 150 [2023-04-01 11:12:35,089 INFO L226 Difference]: Without dead ends: 89 [2023-04-01 11:12:35,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-04-01 11:12:35,094 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:12:35,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 607 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:12:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-04-01 11:12:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-04-01 11:12:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 54 states have internal predecessors, (58), 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) [2023-04-01 11:12:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2023-04-01 11:12:35,119 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 67 [2023-04-01 11:12:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:12:35,119 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2023-04-01 11:12:35,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-04-01 11:12:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2023-04-01 11:12:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-04-01 11:12:35,122 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:12:35,122 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-04-01 11:12:35,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 11:12:35,123 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:12:35,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:12:35,123 INFO L85 PathProgramCache]: Analyzing trace with hash 660469821, now seen corresponding path program 1 times [2023-04-01 11:12:35,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:12:35,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091509950] [2023-04-01 11:12:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:12:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:12:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:12:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 11:12:35,456 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:12:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091509950] [2023-04-01 11:12:35,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091509950] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:12:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582689790] [2023-04-01 11:12:35,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:12:35,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:12:35,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:12:35,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 11:12:35,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 11:12:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:12:35,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 15 conjunts are in the unsatisfiable core [2023-04-01 11:12:35,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:12:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-04-01 11:12:35,676 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 11:12:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582689790] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:12:35,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 11:12:35,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 16 [2023-04-01 11:12:35,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246677842] [2023-04-01 11:12:35,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:12:35,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 11:12:35,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:12:35,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 11:12:35,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2023-04-01 11:12:35,682 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-01 11:12:35,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:12:35,858 INFO L93 Difference]: Finished difference Result 140 states and 180 transitions. [2023-04-01 11:12:35,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 11:12:35,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 5 states have call successors, (16), 3 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 [2023-04-01 11:12:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:12:35,860 INFO L225 Difference]: With dead ends: 140 [2023-04-01 11:12:35,860 INFO L226 Difference]: Without dead ends: 91 [2023-04-01 11:12:35,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2023-04-01 11:12:35,862 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 33 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:12:35,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 598 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:12:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-04-01 11:12:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-04-01 11:12:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 56 states have internal predecessors, (59), 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) [2023-04-01 11:12:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2023-04-01 11:12:35,873 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 79 [2023-04-01 11:12:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:12:35,874 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2023-04-01 11:12:35,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-01 11:12:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2023-04-01 11:12:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-04-01 11:12:35,876 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:12:35,876 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-04-01 11:12:35,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 11:12:36,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-01 11:12:36,078 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:12:36,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:12:36,078 INFO L85 PathProgramCache]: Analyzing trace with hash 870065128, now seen corresponding path program 1 times [2023-04-01 11:12:36,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:12:36,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768212391] [2023-04-01 11:12:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:12:36,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:12:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 11:12:36,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 11:12:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 11:12:36,209 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-04-01 11:12:36,209 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 11:12:36,210 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 11:12:36,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-01 11:12:36,214 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-04-01 11:12:36,218 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 11:12:36,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 11:12:36 BoogieIcfgContainer [2023-04-01 11:12:36,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 11:12:36,267 INFO L158 Benchmark]: Toolchain (without parser) took 4819.13ms. Allocated memory is still 414.2MB. Free memory was 366.8MB in the beginning and 312.1MB in the end (delta: 54.7MB). Peak memory consumption was 56.3MB. Max. memory is 8.0GB. [2023-04-01 11:12:36,269 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 209.7MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 11:12:36,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.60ms. Allocated memory is still 414.2MB. Free memory was 366.4MB in the beginning and 354.5MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-01 11:12:36,270 INFO L158 Benchmark]: Boogie Preprocessor took 50.70ms. Allocated memory is still 414.2MB. Free memory was 354.5MB in the beginning and 352.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-01 11:12:36,271 INFO L158 Benchmark]: RCFGBuilder took 595.81ms. Allocated memory is still 414.2MB. Free memory was 352.1MB in the beginning and 326.2MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-04-01 11:12:36,271 INFO L158 Benchmark]: TraceAbstraction took 3943.64ms. Allocated memory is still 414.2MB. Free memory was 325.5MB in the beginning and 312.1MB in the end (delta: 13.4MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. [2023-04-01 11:12:36,272 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.12ms. Allocated memory is still 209.7MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.60ms. Allocated memory is still 414.2MB. Free memory was 366.4MB in the beginning and 354.5MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.70ms. Allocated memory is still 414.2MB. Free memory was 354.5MB in the beginning and 352.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 595.81ms. Allocated memory is still 414.2MB. Free memory was 352.1MB in the beginning and 326.2MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3943.64ms. Allocated memory is still 414.2MB. Free memory was 325.5MB in the beginning and 312.1MB in the end (delta: 13.4MB). Peak memory consumption was 14.3MB. 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: [L110] 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; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1: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 [n={-1:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}, n={-1:0}] [L110] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L110] CALL task(nondet_tree()) VAL [t={-1:0}] [L86] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n->left={0:0}, n={-1:0}, n={-1:0}] [L41] 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}] [L41] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n->left={0:0}, n={-1:0}, n={-1:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n->right={0:0}, n={-1:0}, n={-1:0}] [L42] 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}] [L42] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n->right={0:0}, n={-1:0}, n={-1:0}] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L86] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L86] int a = min(t); [L87] int b; VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L89] CALL, EXPR size(t) VAL [t={-1:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [t->left={0:0}, t={-1:0}, t={-1:0}] [L82] CALL, EXPR size(t->left) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->left) VAL [size(t->left)=0, t->left={0:0}, t={-1:0}, t={-1:0}] [L82] EXPR t->right VAL [size(t->left)=0, t->left={0:0}, t->right={0:0}, t={-1:0}, t={-1:0}] [L82] CALL, EXPR size(t->right) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t->left={0:0}, t->right={0:0}, t={-1:0}, t={-1:0}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-1:0}, t={-1:0}] [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}] [L91] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L91] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L92] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t->left={0:0}, t={-1:0}, t={-1:0}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L73] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t->left={0:0}, t={-1:0}, t={-1:0}, tree_inorder(t->left, a, i)=1] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t->right={0:0}, t={-1:0}, t={-1:0}] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L75] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t->right={0:0}, t={-1:0}, t={-1:0}, tree_inorder(t->right, a, i)=2] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L92] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}] [L93] EXPR x[0] VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0] [L93] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 2434 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2065 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 585 IncrementalHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 369 mSDtfsCounter, 585 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=4, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 426 ConstructedInterpolants, 0 QuantifiedInterpolants, 943 SizeOfPredicates, 7 NumberOfNonLiveVariables, 705 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 124/132 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! [2023-04-01 11:12:36,288 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...