./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11dfc9c267e4b15a18edd43bd8f373e4d6af1fa864b5f35e9818e0875ad24411 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 00:58:53,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 00:58:53,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 00:58:53,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 00:58:53,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 00:58:53,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 00:58:53,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 00:58:53,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 00:58:53,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 00:58:53,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 00:58:53,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 00:58:53,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 00:58:53,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 00:58:53,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 00:58:53,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 00:58:53,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 00:58:53,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 00:58:53,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 00:58:53,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 00:58:53,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 00:58:53,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 00:58:53,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 00:58:53,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 00:58:53,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 00:58:53,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 00:58:53,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 00:58:53,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 00:58:53,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 00:58:53,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 00:58:53,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 00:58:53,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 00:58:53,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 00:58:53,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 00:58:53,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 00:58:53,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 00:58:53,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 00:58:53,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 00:58:53,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 00:58:53,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 00:58:53,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 00:58:53,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 00:58:53,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 00:58:53,759 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 00:58:53,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 00:58:53,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 00:58:53,764 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 00:58:53,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 00:58:53,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 00:58:53,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 00:58:53,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 00:58:53,766 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 00:58:53,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 00:58:53,767 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 00:58:53,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 00:58:53,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 00:58:53,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 00:58:53,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 00:58:53,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 00:58:53,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 00:58:53,769 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 00:58:53,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 00:58:53,769 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 00:58:53,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 00:58:53,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 00:58:53,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 00:58:53,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 00:58:53,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:58:53,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 00:58:53,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 00:58:53,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 00:58:53,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 00:58:53,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 00:58:53,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 00:58:53,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 00:58:53,772 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 00:58:53,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 00:58:53,772 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 00:58:53,773 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11dfc9c267e4b15a18edd43bd8f373e4d6af1fa864b5f35e9818e0875ad24411 [2023-02-18 00:58:53,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 00:58:53,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 00:58:54,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 00:58:54,001 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 00:58:54,001 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 00:58:54,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2023-02-18 00:58:55,198 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 00:58:55,435 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 00:58:55,435 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2023-02-18 00:58:55,443 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f55da126/b779267684544ad88a1df692798bce06/FLAGd7c1e6227 [2023-02-18 00:58:55,458 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f55da126/b779267684544ad88a1df692798bce06 [2023-02-18 00:58:55,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 00:58:55,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 00:58:55,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 00:58:55,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 00:58:55,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 00:58:55,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c48debc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55, skipping insertion in model container [2023-02-18 00:58:55,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 00:58:55,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 00:58:55,608 WARN L237 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_incorrect.c[619,632] [2023-02-18 00:58:55,624 WARN L1576 CHandler]: Possible shadowing of function min [2023-02-18 00:58:55,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:58:55,647 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 00:58:55,656 WARN L237 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_incorrect.c[619,632] [2023-02-18 00:58:55,662 WARN L1576 CHandler]: Possible shadowing of function min [2023-02-18 00:58:55,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:58:55,684 INFO L208 MainTranslator]: Completed translation [2023-02-18 00:58:55,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55 WrapperNode [2023-02-18 00:58:55,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 00:58:55,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 00:58:55,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 00:58:55,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 00:58:55,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,719 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2023-02-18 00:58:55,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 00:58:55,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 00:58:55,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 00:58:55,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 00:58:55,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,763 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 00:58:55,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 00:58:55,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 00:58:55,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 00:58:55,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55" (1/1) ... [2023-02-18 00:58:55,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:58:55,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:58:55,801 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-02-18 00:58:55,803 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-02-18 00:58:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 00:58:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-18 00:58:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 00:58:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-18 00:58:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-02-18 00:58:55,828 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-02-18 00:58:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-18 00:58:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-02-18 00:58:55,829 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-02-18 00:58:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 00:58:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-02-18 00:58:55,829 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-02-18 00:58:55,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 00:58:55,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 00:58:55,830 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-02-18 00:58:55,830 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-02-18 00:58:55,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 00:58:55,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 00:58:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 00:58:55,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 00:58:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-02-18 00:58:55,831 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-02-18 00:58:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 00:58:55,932 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 00:58:55,934 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 00:58:56,304 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 00:58:56,311 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 00:58:56,316 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 00:58:56,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:58:56 BoogieIcfgContainer [2023-02-18 00:58:56,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 00:58:56,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 00:58:56,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 00:58:56,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 00:58:56,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 12:58:55" (1/3) ... [2023-02-18 00:58:56,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d621088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:58:56, skipping insertion in model container [2023-02-18 00:58:56,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:58:55" (2/3) ... [2023-02-18 00:58:56,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d621088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:58:56, skipping insertion in model container [2023-02-18 00:58:56,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:58:56" (3/3) ... [2023-02-18 00:58:56,327 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2023-02-18 00:58:56,342 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 00:58:56,342 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 00:58:56,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 00:58:56,412 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=PETRI_NET, 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;@87d6b5c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 00:58:56,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 00:58:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 00:58:56,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 00:58:56,427 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:58:56,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] [2023-02-18 00:58:56,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:58:56,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:58:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash -858928279, now seen corresponding path program 1 times [2023-02-18 00:58:56,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:58:56,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880531270] [2023-02-18 00:58:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:58:56,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:58:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:56,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 00:58:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:56,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:58:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:56,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 00:58:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:56,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-18 00:58:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:56,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-18 00:58:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:58:56,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:58:56,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880531270] [2023-02-18 00:58:56,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880531270] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:58:56,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:58:56,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 00:58:56,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909900992] [2023-02-18 00:58:56,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:58:56,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 00:58:56,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:58:56,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 00:58:56,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:58:56,760 INFO L87 Difference]: Start difference. First operand has 81 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 00:58:56,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:58:56,955 INFO L93 Difference]: Finished difference Result 142 states and 192 transitions. [2023-02-18 00:58:56,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 00:58:56,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2023-02-18 00:58:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:58:56,976 INFO L225 Difference]: With dead ends: 142 [2023-02-18 00:58:56,976 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 00:58:56,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-02-18 00:58:56,982 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:58:56,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 120 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:58:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 00:58:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-02-18 00:58:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-18 00:58:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2023-02-18 00:58:57,020 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 36 [2023-02-18 00:58:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:58:57,021 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2023-02-18 00:58:57,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 00:58:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2023-02-18 00:58:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 00:58:57,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:58:57,023 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] [2023-02-18 00:58:57,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 00:58:57,024 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:58:57,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:58:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1847691115, now seen corresponding path program 1 times [2023-02-18 00:58:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:58:57,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897091089] [2023-02-18 00:58:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:58:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:58:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 00:58:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:58:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 00:58:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-18 00:58:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-18 00:58:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:58:57,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:58:57,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897091089] [2023-02-18 00:58:57,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897091089] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:58:57,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:58:57,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 00:58:57,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060101411] [2023-02-18 00:58:57,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:58:57,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 00:58:57,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:58:57,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 00:58:57,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-18 00:58:57,219 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 00:58:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:58:57,477 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2023-02-18 00:58:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 00:58:57,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2023-02-18 00:58:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:58:57,484 INFO L225 Difference]: With dead ends: 136 [2023-02-18 00:58:57,484 INFO L226 Difference]: Without dead ends: 83 [2023-02-18 00:58:57,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-18 00:58:57,488 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 82 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:58:57,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 224 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:58:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-18 00:58:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2023-02-18 00:58:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2023-02-18 00:58:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2023-02-18 00:58:57,516 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 36 [2023-02-18 00:58:57,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:58:57,517 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2023-02-18 00:58:57,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 00:58:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2023-02-18 00:58:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-18 00:58:57,524 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:58:57,525 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] [2023-02-18 00:58:57,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 00:58:57,525 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:58:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:58:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash 289307572, now seen corresponding path program 1 times [2023-02-18 00:58:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:58:57,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172002364] [2023-02-18 00:58:57,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:58:57,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:58:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 00:58:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-18 00:58:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 00:58:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 00:58:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 00:58:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-18 00:58:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-18 00:58:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 00:58:57,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:58:57,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172002364] [2023-02-18 00:58:57,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172002364] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:58:57,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208425930] [2023-02-18 00:58:57,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:58:57,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:58:57,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:58:57,843 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-02-18 00:58:57,844 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-02-18 00:58:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:57,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 00:58:57,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:58:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 00:58:58,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:58:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 00:58:58,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208425930] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:58:58,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:58:58,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2023-02-18 00:58:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131117258] [2023-02-18 00:58:58,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:58:58,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 00:58:58,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:58:58,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 00:58:58,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-18 00:58:58,120 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 00:58:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:58:58,559 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2023-02-18 00:58:58,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:58:58,559 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2023-02-18 00:58:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:58:58,567 INFO L225 Difference]: With dead ends: 142 [2023-02-18 00:58:58,567 INFO L226 Difference]: Without dead ends: 83 [2023-02-18 00:58:58,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-02-18 00:58:58,573 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 00:58:58,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 372 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 00:58:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-18 00:58:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2023-02-18 00:58:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 53 states have internal predecessors, (59), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2023-02-18 00:58:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2023-02-18 00:58:58,582 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 48 [2023-02-18 00:58:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:58:58,583 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2023-02-18 00:58:58,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 00:58:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2023-02-18 00:58:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 00:58:58,588 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:58:58,589 INFO L195 NwaCegarLoop]: 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] [2023-02-18 00:58:58,599 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-02-18 00:58:58,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:58:58,793 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:58:58,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:58:58,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1954582857, now seen corresponding path program 1 times [2023-02-18 00:58:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:58:58,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786395377] [2023-02-18 00:58:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:58:58,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:58:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:58,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 00:58:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:58,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-18 00:58:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-18 00:58:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 00:58:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:58,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 00:58:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 00:58:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 00:58:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-18 00:58:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-02-18 00:58:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-18 00:58:59,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:58:59,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786395377] [2023-02-18 00:58:59,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786395377] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:58:59,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:58:59,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-18 00:58:59,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297631536] [2023-02-18 00:58:59,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:58:59,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 00:58:59,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:58:59,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 00:58:59,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-02-18 00:58:59,032 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 00:58:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:58:59,355 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2023-02-18 00:58:59,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 00:58:59,355 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 58 [2023-02-18 00:58:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:58:59,357 INFO L225 Difference]: With dead ends: 142 [2023-02-18 00:58:59,358 INFO L226 Difference]: Without dead ends: 85 [2023-02-18 00:58:59,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-18 00:58:59,361 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 109 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 00:58:59,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 324 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 00:58:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-18 00:58:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2023-02-18 00:58:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 55 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2023-02-18 00:58:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2023-02-18 00:58:59,388 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 58 [2023-02-18 00:58:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:58:59,389 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2023-02-18 00:58:59,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 00:58:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2023-02-18 00:58:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-18 00:58:59,396 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:58:59,396 INFO L195 NwaCegarLoop]: 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] [2023-02-18 00:58:59,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 00:58:59,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:58:59,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:58:59,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1575743044, now seen corresponding path program 1 times [2023-02-18 00:58:59,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:58:59,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815464790] [2023-02-18 00:58:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:58:59,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:58:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 00:58:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-02-18 00:58:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-18 00:58:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 00:58:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 00:58:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 00:58:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-18 00:58:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 00:58:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 00:58:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-02-18 00:58:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-02-18 00:58:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-18 00:58:59,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:58:59,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815464790] [2023-02-18 00:58:59,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815464790] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:58:59,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570105700] [2023-02-18 00:58:59,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:58:59,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:58:59,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:58:59,758 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-02-18 00:58:59,793 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-02-18 00:58:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:58:59,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 00:58:59,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:58:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-18 00:58:59,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 00:58:59,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570105700] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:58:59,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 00:58:59,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2023-02-18 00:58:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779343046] [2023-02-18 00:58:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:58:59,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 00:58:59,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:58:59,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 00:58:59,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2023-02-18 00:58:59,945 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-18 00:59:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:59:00,061 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2023-02-18 00:59:00,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:59:00,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 71 [2023-02-18 00:59:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:59:00,065 INFO L225 Difference]: With dead ends: 133 [2023-02-18 00:59:00,065 INFO L226 Difference]: Without dead ends: 84 [2023-02-18 00:59:00,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2023-02-18 00:59:00,066 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 48 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:59:00,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 508 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:59:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-18 00:59:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-18 00:59:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30) [2023-02-18 00:59:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2023-02-18 00:59:00,089 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 71 [2023-02-18 00:59:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:59:00,090 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2023-02-18 00:59:00,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-18 00:59:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2023-02-18 00:59:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-02-18 00:59:00,093 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:59:00,093 INFO L195 NwaCegarLoop]: 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] [2023-02-18 00:59:00,111 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-02-18 00:59:00,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:59:00,300 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:59:00,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:59:00,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1969188871, now seen corresponding path program 1 times [2023-02-18 00:59:00,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:59:00,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062081667] [2023-02-18 00:59:00,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:59:00,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:59:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 00:59:00,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 00:59:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 00:59:00,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 00:59:00,405 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 00:59:00,406 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 00:59:00,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 00:59:00,411 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-02-18 00:59:00,424 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 00:59:00,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 12:59:00 BoogieIcfgContainer [2023-02-18 00:59:00,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 00:59:00,485 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 00:59:00,485 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 00:59:00,485 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 00:59:00,486 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:58:56" (3/4) ... [2023-02-18 00:59:00,487 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 00:59:00,538 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 00:59:00,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 00:59:00,539 INFO L158 Benchmark]: Toolchain (without parser) took 5076.43ms. Allocated memory was 119.5MB in the beginning and 155.2MB in the end (delta: 35.7MB). Free memory was 74.4MB in the beginning and 56.3MB in the end (delta: 18.1MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2023-02-18 00:59:00,539 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 00:59:00,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.15ms. Allocated memory is still 119.5MB. Free memory was 74.4MB in the beginning and 62.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 00:59:00,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.79ms. Allocated memory is still 119.5MB. Free memory was 62.2MB in the beginning and 60.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 00:59:00,540 INFO L158 Benchmark]: Boogie Preprocessor took 52.92ms. Allocated memory is still 119.5MB. Free memory was 60.5MB in the beginning and 58.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 00:59:00,540 INFO L158 Benchmark]: RCFGBuilder took 544.82ms. Allocated memory is still 119.5MB. Free memory was 58.4MB in the beginning and 82.5MB in the end (delta: -24.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-02-18 00:59:00,541 INFO L158 Benchmark]: TraceAbstraction took 4164.42ms. Allocated memory was 119.5MB in the beginning and 155.2MB in the end (delta: 35.7MB). Free memory was 81.8MB in the beginning and 60.5MB in the end (delta: 21.3MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2023-02-18 00:59:00,541 INFO L158 Benchmark]: Witness Printer took 53.47ms. Allocated memory is still 155.2MB. Free memory was 60.5MB in the beginning and 56.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 00:59:00,542 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.16ms. Allocated memory is still 98.6MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.15ms. Allocated memory is still 119.5MB. Free memory was 74.4MB in the beginning and 62.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.79ms. Allocated memory is still 119.5MB. Free memory was 62.2MB in the beginning and 60.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.92ms. Allocated memory is still 119.5MB. Free memory was 60.5MB in the beginning and 58.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.82ms. Allocated memory is still 119.5MB. Free memory was 58.4MB in the beginning and 82.5MB in the end (delta: -24.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4164.42ms. Allocated memory was 119.5MB in the beginning and 155.2MB in the end (delta: 35.7MB). Free memory was 81.8MB in the beginning and 60.5MB in the end (delta: 21.3MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. * Witness Printer took 53.47ms. Allocated memory is still 155.2MB. Free memory was 60.5MB in the beginning and 56.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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; 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}] [L105] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L105] CALL task(nondet_tree()) [L83] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={-1:0}, n={-1:0}, n->left={0:0}] [L40] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L41] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-1:0}, n={-1:0}] [L83] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L83] int a = min(t); [L84] int b; VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L86] CALL, EXPR size(t) VAL [t={-1:0}] [L78] COND FALSE !(!t) [L79] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L79] CALL, EXPR size(t->left) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L79] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L79] CALL, EXPR size(t->right) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-1:0}, t={-1:0}] [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume_abort_if_not(n != 0) [L88] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-1:0}, t={-1:0}] [L88] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-1:0}, t={-1:0}, x={-3:0}] [L89] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-1:0}] [L67] COND FALSE !(!t) [L70] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}] [L70] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L70] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}] [L72] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L72] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L72] i = tree_inorder(t->right, a, i) [L73] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-1:0}, t={-1:0}] [L89] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-3:0}] [L90] EXPR x[0] VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-1:0}, t={-1:0}, x={-3:0}, x[0]=0] [L90] 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 7 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 330 mSDsluCounter, 1548 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1215 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1212 IncrementalHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 333 mSDtfsCounter, 1212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 220 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1226 SizeOfPredicates, 12 NumberOfNonLiveVariables, 635 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 115/123 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-02-18 00:59:00,563 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE