./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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.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 cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 00:12:14,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 00:12:14,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 00:12:14,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 00:12:14,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 00:12:14,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 00:12:14,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 00:12:14,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 00:12:14,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 00:12:14,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 00:12:14,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 00:12:14,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 00:12:14,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 00:12:14,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 00:12:14,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 00:12:14,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 00:12:14,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 00:12:14,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 00:12:14,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 00:12:14,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 00:12:14,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 00:12:14,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 00:12:14,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 00:12:14,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 00:12:14,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 00:12:14,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 00:12:14,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 00:12:14,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 00:12:14,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 00:12:14,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 00:12:14,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 00:12:14,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 00:12:14,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 00:12:14,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 00:12:14,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 00:12:14,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 00:12:14,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 00:12:14,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 00:12:14,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 00:12:14,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 00:12:14,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 00:12:14,783 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 00:12:14,804 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 00:12:14,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 00:12:14,805 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 00:12:14,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 00:12:14,806 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 00:12:14,806 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 00:12:14,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 00:12:14,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 00:12:14,807 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 00:12:14,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 00:12:14,808 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 00:12:14,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 00:12:14,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 00:12:14,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 00:12:14,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 00:12:14,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 00:12:14,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 00:12:14,809 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 00:12:14,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 00:12:14,809 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 00:12:14,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 00:12:14,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 00:12:14,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 00:12:14,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 00:12:14,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 00:12:14,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 00:12:14,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 00:12:14,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 00:12:14,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 00:12:14,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 00:12:14,810 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 00:12:14,811 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 00:12:14,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 00:12:14,811 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 00:12:14,811 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.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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2021-12-16 00:12:15,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 00:12:15,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 00:12:15,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 00:12:15,036 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 00:12:15,036 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 00:12:15,037 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter.c [2021-12-16 00:12:15,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b753ee141/08b2380070204498ae0de400c7c47b38/FLAGd50a98fbe [2021-12-16 00:12:15,383 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 00:12:15,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c [2021-12-16 00:12:15,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b753ee141/08b2380070204498ae0de400c7c47b38/FLAGd50a98fbe [2021-12-16 00:12:15,819 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b753ee141/08b2380070204498ae0de400c7c47b38 [2021-12-16 00:12:15,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 00:12:15,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 00:12:15,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 00:12:15,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 00:12:15,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 00:12:15,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:12:15" (1/1) ... [2021-12-16 00:12:15,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b908ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:15, skipping insertion in model container [2021-12-16 00:12:15,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:12:15" (1/1) ... [2021-12-16 00:12:15,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 00:12:15,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 00:12:15,948 WARN L230 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] [2021-12-16 00:12:15,974 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-16 00:12:15,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 00:12:15,998 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 00:12:16,006 WARN L230 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] [2021-12-16 00:12:16,014 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-16 00:12:16,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 00:12:16,031 INFO L208 MainTranslator]: Completed translation [2021-12-16 00:12:16,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:16 WrapperNode [2021-12-16 00:12:16,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 00:12:16,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 00:12:16,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 00:12:16,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 00:12:16,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:16" (1/1) ... [2021-12-16 00:12:16,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:16" (1/1) ... [2021-12-16 00:12:16,057 INFO L137 Inliner]: procedures = 29, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2021-12-16 00:12:16,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 00:12:16,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 00:12:16,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 00:12:16,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 00:12:16,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:16" (1/1) ... [2021-12-16 00:12:16,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:16" (1/1) ... [2021-12-16 00:12:16,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:16" (1/1) ... [2021-12-16 00:12:16,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:16" (1/1) ... [2021-12-16 00:12:16,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:16" (1/1) ... [2021-12-16 00:12:16,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:16" (1/1) ... [2021-12-16 00:12:16,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:16" (1/1) ... [2021-12-16 00:12:16,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 00:12:16,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 00:12:16,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 00:12:16,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 00:12:16,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:16" (1/1) ... [2021-12-16 00:12:16,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 00:12:16,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:12:16,115 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) [2021-12-16 00:12:16,120 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 [2021-12-16 00:12:16,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 00:12:16,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 00:12:16,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 00:12:16,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 00:12:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure min [2021-12-16 00:12:16,158 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2021-12-16 00:12:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 00:12:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-16 00:12:16,158 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-16 00:12:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 00:12:16,158 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2021-12-16 00:12:16,158 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2021-12-16 00:12:16,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 00:12:16,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 00:12:16,159 INFO L130 BoogieDeclarations]: Found specification of procedure size [2021-12-16 00:12:16,159 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2021-12-16 00:12:16,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 00:12:16,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 00:12:16,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 00:12:16,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 00:12:16,160 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2021-12-16 00:12:16,160 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2021-12-16 00:12:16,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 00:12:16,228 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 00:12:16,229 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 00:12:16,413 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 00:12:16,418 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 00:12:16,418 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-16 00:12:16,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:12:16 BoogieIcfgContainer [2021-12-16 00:12:16,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 00:12:16,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 00:12:16,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 00:12:16,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 00:12:16,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:12:15" (1/3) ... [2021-12-16 00:12:16,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1421d94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:12:16, skipping insertion in model container [2021-12-16 00:12:16,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:16" (2/3) ... [2021-12-16 00:12:16,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1421d94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:12:16, skipping insertion in model container [2021-12-16 00:12:16,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:12:16" (3/3) ... [2021-12-16 00:12:16,427 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2021-12-16 00:12:16,434 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 00:12:16,434 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 00:12:16,463 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 00:12:16,467 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 00:12:16,468 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 00:12:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 55 states have (on average 1.290909090909091) internal successors, (71), 56 states have internal predecessors, (71), 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) [2021-12-16 00:12:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 00:12:16,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:12:16,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:12:16,485 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:12:16,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:12:16,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1252310823, now seen corresponding path program 1 times [2021-12-16 00:12:16,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:12:16,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447244015] [2021-12-16 00:12:16,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:16,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:12:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:16,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:16,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 00:12:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:16,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:12:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 00:12:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 00:12:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 00:12:16,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:12:16,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447244015] [2021-12-16 00:12:16,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447244015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:12:16,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:12:16,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 00:12:16,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049781396] [2021-12-16 00:12:16,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:12:16,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 00:12:16,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:12:16,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 00:12:16,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 00:12:16,883 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.290909090909091) internal successors, (71), 56 states have internal predecessors, (71), 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 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) [2021-12-16 00:12:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:12:17,126 INFO L93 Difference]: Finished difference Result 149 states and 208 transitions. [2021-12-16 00:12:17,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 00:12:17,129 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 [2021-12-16 00:12:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:12:17,135 INFO L225 Difference]: With dead ends: 149 [2021-12-16 00:12:17,135 INFO L226 Difference]: Without dead ends: 84 [2021-12-16 00:12:17,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-16 00:12:17,139 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 58 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 00:12:17,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 353 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 00:12:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-16 00:12:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2021-12-16 00:12:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 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) [2021-12-16 00:12:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2021-12-16 00:12:17,169 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 36 [2021-12-16 00:12:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:12:17,169 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2021-12-16 00:12:17,170 INFO L471 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) [2021-12-16 00:12:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2021-12-16 00:12:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-16 00:12:17,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:12:17,172 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:12:17,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 00:12:17,172 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:12:17,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:12:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1818033216, now seen corresponding path program 1 times [2021-12-16 00:12:17,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:12:17,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108576042] [2021-12-16 00:12:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:17,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:12:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:17,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 00:12:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:17,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:12:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:17,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:17,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:12:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:17,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 00:12:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:17,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 00:12:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 00:12:17,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:12:17,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108576042] [2021-12-16 00:12:17,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108576042] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 00:12:17,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575035807] [2021-12-16 00:12:17,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:17,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:12:17,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:12:17,340 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) [2021-12-16 00:12:17,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 00:12:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:17,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 00:12:17,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:12:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 00:12:17,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:12:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 00:12:17,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575035807] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:12:17,774 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 00:12:17,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2021-12-16 00:12:17,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802070615] [2021-12-16 00:12:17,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 00:12:17,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-16 00:12:17,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:12:17,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 00:12:17,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-16 00:12:17,776 INFO L87 Difference]: Start difference. First operand 79 states and 103 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) [2021-12-16 00:12:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:12:18,068 INFO L93 Difference]: Finished difference Result 143 states and 189 transitions. [2021-12-16 00:12:18,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 00:12:18,069 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 [2021-12-16 00:12:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:12:18,073 INFO L225 Difference]: With dead ends: 143 [2021-12-16 00:12:18,073 INFO L226 Difference]: Without dead ends: 84 [2021-12-16 00:12:18,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-16 00:12:18,076 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 37 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 00:12:18,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 500 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 00:12:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-16 00:12:18,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2021-12-16 00:12:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 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) [2021-12-16 00:12:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2021-12-16 00:12:18,098 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 48 [2021-12-16 00:12:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:12:18,098 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2021-12-16 00:12:18,098 INFO L471 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) [2021-12-16 00:12:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2021-12-16 00:12:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-16 00:12:18,100 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:12:18,100 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:12:18,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-16 00:12:18,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:12:18,301 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:12:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:12:18,301 INFO L85 PathProgramCache]: Analyzing trace with hash -638065853, now seen corresponding path program 1 times [2021-12-16 00:12:18,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:12:18,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267833399] [2021-12-16 00:12:18,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:18,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:12:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:12:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 00:12:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 00:12:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 00:12:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:12:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:12:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 00:12:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-16 00:12:18,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:12:18,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267833399] [2021-12-16 00:12:18,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267833399] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:12:18,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:12:18,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 00:12:18,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617947837] [2021-12-16 00:12:18,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:12:18,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 00:12:18,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:12:18,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 00:12:18,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-16 00:12:18,496 INFO L87 Difference]: Start difference. First operand 81 states and 106 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) [2021-12-16 00:12:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:12:18,725 INFO L93 Difference]: Finished difference Result 143 states and 189 transitions. [2021-12-16 00:12:18,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 00:12:18,726 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 [2021-12-16 00:12:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:12:18,730 INFO L225 Difference]: With dead ends: 143 [2021-12-16 00:12:18,730 INFO L226 Difference]: Without dead ends: 86 [2021-12-16 00:12:18,731 INFO L932 BasicCegarLoop]: 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 [2021-12-16 00:12:18,733 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 85 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 00:12:18,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 446 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 00:12:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-16 00:12:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2021-12-16 00:12:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.169811320754717) internal successors, (62), 56 states have internal predecessors, (62), 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) [2021-12-16 00:12:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2021-12-16 00:12:18,752 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 58 [2021-12-16 00:12:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:12:18,752 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2021-12-16 00:12:18,753 INFO L471 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) [2021-12-16 00:12:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2021-12-16 00:12:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-16 00:12:18,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:12:18,757 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:12:18,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 00:12:18,757 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:12:18,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:12:18,757 INFO L85 PathProgramCache]: Analyzing trace with hash 51768432, now seen corresponding path program 1 times [2021-12-16 00:12:18,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:12:18,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321114270] [2021-12-16 00:12:18,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:18,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:12:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:12:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 00:12:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 00:12:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:12:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 00:12:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:12:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-16 00:12:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 00:12:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-16 00:12:18,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:12:18,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321114270] [2021-12-16 00:12:18,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321114270] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:12:18,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:12:18,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 00:12:18,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178787857] [2021-12-16 00:12:18,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:12:18,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 00:12:18,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:12:18,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 00:12:18,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-16 00:12:18,930 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-16 00:12:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:12:19,147 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2021-12-16 00:12:19,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 00:12:19,147 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 5 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 [2021-12-16 00:12:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:12:19,150 INFO L225 Difference]: With dead ends: 135 [2021-12-16 00:12:19,150 INFO L226 Difference]: Without dead ends: 86 [2021-12-16 00:12:19,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-16 00:12:19,152 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 75 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 00:12:19,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 432 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 00:12:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-16 00:12:19,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2021-12-16 00:12:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 58 states have internal predecessors, (63), 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) [2021-12-16 00:12:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 113 transitions. [2021-12-16 00:12:19,175 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 113 transitions. Word has length 71 [2021-12-16 00:12:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:12:19,175 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 113 transitions. [2021-12-16 00:12:19,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-16 00:12:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2021-12-16 00:12:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 00:12:19,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:12:19,179 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:12:19,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 00:12:19,180 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:12:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:12:19,180 INFO L85 PathProgramCache]: Analyzing trace with hash -554559437, now seen corresponding path program 1 times [2021-12-16 00:12:19,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:12:19,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415465294] [2021-12-16 00:12:19,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:19,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:12:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 00:12:19,221 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 00:12:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 00:12:19,280 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 00:12:19,280 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 00:12:19,281 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 00:12:19,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 00:12:19,285 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-12-16 00:12:19,287 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 00:12:19,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:12:19 BoogieIcfgContainer [2021-12-16 00:12:19,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 00:12:19,326 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 00:12:19,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 00:12:19,326 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 00:12:19,327 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:12:16" (3/4) ... [2021-12-16 00:12:19,328 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 00:12:19,362 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 00:12:19,363 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 00:12:19,363 INFO L158 Benchmark]: Toolchain (without parser) took 3540.82ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 110.3MB in the beginning and 82.9MB in the end (delta: 27.4MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2021-12-16 00:12:19,363 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 00:12:19,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.18ms. Allocated memory is still 138.4MB. Free memory was 110.0MB in the beginning and 111.1MB in the end (delta: -1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 00:12:19,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.01ms. Allocated memory is still 138.4MB. Free memory was 111.1MB in the beginning and 109.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 00:12:19,364 INFO L158 Benchmark]: Boogie Preprocessor took 22.37ms. Allocated memory is still 138.4MB. Free memory was 109.1MB in the beginning and 107.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 00:12:19,364 INFO L158 Benchmark]: RCFGBuilder took 338.97ms. Allocated memory is still 138.4MB. Free memory was 107.0MB in the beginning and 89.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-16 00:12:19,364 INFO L158 Benchmark]: TraceAbstraction took 2904.50ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 89.0MB in the beginning and 87.1MB in the end (delta: 1.8MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2021-12-16 00:12:19,365 INFO L158 Benchmark]: Witness Printer took 36.75ms. Allocated memory is still 186.6MB. Free memory was 87.1MB in the beginning and 82.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 00:12:19,366 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.15ms. Allocated memory is still 88.1MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.18ms. Allocated memory is still 138.4MB. Free memory was 110.0MB in the beginning and 111.1MB in the end (delta: -1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.01ms. Allocated memory is still 138.4MB. Free memory was 111.1MB in the beginning and 109.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.37ms. Allocated memory is still 138.4MB. Free memory was 109.1MB in the beginning and 107.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 338.97ms. Allocated memory is still 138.4MB. Free memory was 107.0MB in the beginning and 89.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2904.50ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 89.0MB in the beginning and 87.1MB in the end (delta: 1.8MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * Witness Printer took 36.75ms. Allocated memory is still 186.6MB. Free memory was 87.1MB in the beginning and 82.9MB 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: [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()) [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={-1:0}, n={-1:0}, n->left={0: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={-1:0}, n={-1:0}, n->left={0:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0: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={-1:0}, n={-1:0}, n->right={0: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={-1:0}, t={-1:0}, t->left={0: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={-1:0}, t={-1:0}, t->left={0:0}] [L82] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0: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={-1:0}, t={-1:0}, t->left={0:0}, t->right={0: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) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume_cycle_if_not(n != 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={-1:0}, t={-1:0}, t->left={0: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={-1:0}, t={-1:0}, t->left={0: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={-1:0}, t={-1:0}, t->right={0: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={-1:0}, t={-1:0}, t->right={0: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 7 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 1731 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1392 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1217 IncrementalHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 339 mSDtfsCounter, 1217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred 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, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 898 SizeOfPredicates, 6 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 84/90 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! [2021-12-16 00:12:19,405 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