./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_rec.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_rec.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 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 15:28:39,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 15:28:39,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 15:28:40,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 15:28:40,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 15:28:40,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 15:28:40,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 15:28:40,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 15:28:40,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 15:28:40,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 15:28:40,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 15:28:40,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 15:28:40,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 15:28:40,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 15:28:40,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 15:28:40,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 15:28:40,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 15:28:40,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 15:28:40,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 15:28:40,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 15:28:40,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 15:28:40,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 15:28:40,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 15:28:40,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 15:28:40,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 15:28:40,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 15:28:40,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 15:28:40,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 15:28:40,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 15:28:40,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 15:28:40,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 15:28:40,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 15:28:40,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 15:28:40,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 15:28:40,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 15:28:40,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 15:28:40,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 15:28:40,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 15:28:40,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 15:28:40,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 15:28:40,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 15:28:40,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 15:28:40,136 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 15:28:40,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 15:28:40,136 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 15:28:40,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 15:28:40,137 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 15:28:40,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 15:28:40,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 15:28:40,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 15:28:40,138 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 15:28:40,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 15:28:40,139 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 15:28:40,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 15:28:40,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 15:28:40,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 15:28:40,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 15:28:40,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 15:28:40,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 15:28:40,141 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 15:28:40,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 15:28:40,141 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 15:28:40,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 15:28:40,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 15:28:40,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 15:28:40,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 15:28:40,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:28:40,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 15:28:40,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 15:28:40,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 15:28:40,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 15:28:40,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 15:28:40,143 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 15:28:40,143 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 15:28:40,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 15:28:40,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 15:28:40,144 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 -> 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 [2021-12-17 15:28:40,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 15:28:40,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 15:28:40,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 15:28:40,381 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 15:28:40,382 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 15:28:40,383 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec.c [2021-12-17 15:28:40,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef5f89c4/b16e1f4939f64663b1b3103e7303969e/FLAG6f2030245 [2021-12-17 15:28:40,891 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 15:28:40,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec.c [2021-12-17 15:28:40,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef5f89c4/b16e1f4939f64663b1b3103e7303969e/FLAG6f2030245 [2021-12-17 15:28:40,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef5f89c4/b16e1f4939f64663b1b3103e7303969e [2021-12-17 15:28:40,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 15:28:40,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 15:28:40,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 15:28:40,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 15:28:40,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 15:28:40,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:28:40" (1/1) ... [2021-12-17 15:28:40,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5b85a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:40, skipping insertion in model container [2021-12-17 15:28:40,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:28:40" (1/1) ... [2021-12-17 15:28:40,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 15:28:40,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 15:28:41,102 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_rec.c[585,598] [2021-12-17 15:28:41,114 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-17 15:28:41,115 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-17 15:28:41,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:28:41,136 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 15:28:41,146 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_rec.c[585,598] [2021-12-17 15:28:41,151 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-17 15:28:41,152 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-17 15:28:41,159 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:28:41,172 INFO L208 MainTranslator]: Completed translation [2021-12-17 15:28:41,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:41 WrapperNode [2021-12-17 15:28:41,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 15:28:41,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 15:28:41,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 15:28:41,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 15:28:41,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:41" (1/1) ... [2021-12-17 15:28:41,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:41" (1/1) ... [2021-12-17 15:28:41,230 INFO L137 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2021-12-17 15:28:41,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 15:28:41,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 15:28:41,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 15:28:41,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 15:28:41,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:41" (1/1) ... [2021-12-17 15:28:41,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:41" (1/1) ... [2021-12-17 15:28:41,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:41" (1/1) ... [2021-12-17 15:28:41,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:41" (1/1) ... [2021-12-17 15:28:41,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:41" (1/1) ... [2021-12-17 15:28:41,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:41" (1/1) ... [2021-12-17 15:28:41,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:41" (1/1) ... [2021-12-17 15:28:41,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 15:28:41,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 15:28:41,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 15:28:41,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 15:28:41,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:41" (1/1) ... [2021-12-17 15:28:41,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:28:41,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:28:41,298 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-17 15:28:41,300 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-17 15:28:41,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 15:28:41,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 15:28:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 15:28:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2021-12-17 15:28:41,331 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2021-12-17 15:28:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 15:28:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure min [2021-12-17 15:28:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2021-12-17 15:28:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 15:28:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-17 15:28:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-17 15:28:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 15:28:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2021-12-17 15:28:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2021-12-17 15:28:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 15:28:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 15:28:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure size [2021-12-17 15:28:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2021-12-17 15:28:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 15:28:41,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 15:28:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 15:28:41,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 15:28:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2021-12-17 15:28:41,334 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2021-12-17 15:28:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 15:28:41,476 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 15:28:41,478 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 15:28:41,783 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 15:28:41,797 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 15:28:41,800 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 15:28:41,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:28:41 BoogieIcfgContainer [2021-12-17 15:28:41,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 15:28:41,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 15:28:41,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 15:28:41,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 15:28:41,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 03:28:40" (1/3) ... [2021-12-17 15:28:41,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f85ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:28:41, skipping insertion in model container [2021-12-17 15:28:41,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:41" (2/3) ... [2021-12-17 15:28:41,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f85ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:28:41, skipping insertion in model container [2021-12-17 15:28:41,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:28:41" (3/3) ... [2021-12-17 15:28:41,810 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2021-12-17 15:28:41,816 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 15:28:41,816 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 15:28:41,871 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 15:28:41,886 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-17 15:28:41,887 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 15:28:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 56 states have internal predecessors, (69), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-17 15:28:41,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 15:28:41,918 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:28:41,919 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-17 15:28:41,920 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:28:41,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:28:41,925 INFO L85 PathProgramCache]: Analyzing trace with hash 909892653, now seen corresponding path program 1 times [2021-12-17 15:28:41,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:28:41,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054885352] [2021-12-17 15:28:41,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:41,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:28:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:42,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:42,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 15:28:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:42,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:28:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:42,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 15:28:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:42,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-17 15:28:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:42,354 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-17 15:28:42,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:28:42,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054885352] [2021-12-17 15:28:42,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054885352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:28:42,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:28:42,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 15:28:42,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924265570] [2021-12-17 15:28:42,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:28:42,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 15:28:42,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:28:42,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 15:28:42,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:28:42,391 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 56 states have internal predecessors, (69), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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-17 15:28:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:28:42,704 INFO L93 Difference]: Finished difference Result 155 states and 212 transitions. [2021-12-17 15:28:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:28:42,707 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-17 15:28:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:28:42,715 INFO L225 Difference]: With dead ends: 155 [2021-12-17 15:28:42,715 INFO L226 Difference]: Without dead ends: 87 [2021-12-17 15:28:42,718 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-17 15:28:42,721 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 32 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:28:42,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 347 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 15:28:42,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-17 15:28:42,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2021-12-17 15:28:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 52 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2021-12-17 15:28:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2021-12-17 15:28:42,761 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 36 [2021-12-17 15:28:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:28:42,762 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2021-12-17 15:28:42,762 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-17 15:28:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2021-12-17 15:28:42,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 15:28:42,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:28:42,765 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-17 15:28:42,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 15:28:42,765 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:28:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:28:42,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1373837682, now seen corresponding path program 1 times [2021-12-17 15:28:42,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:28:42,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93257199] [2021-12-17 15:28:42,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:42,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:28:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:42,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:42,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 15:28:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:28:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:42,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:43,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 15:28:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 15:28:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:43,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-17 15:28:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:43,073 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-17 15:28:43,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:28:43,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93257199] [2021-12-17 15:28:43,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93257199] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:28:43,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796382198] [2021-12-17 15:28:43,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:43,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:28:43,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:28:43,078 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-17 15:28:43,079 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-17 15:28:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:43,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-17 15:28:43,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:28:43,386 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-17 15:28:43,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:28:43,644 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-17 15:28:43,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796382198] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:28:43,645 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:28:43,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2021-12-17 15:28:43,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476419131] [2021-12-17 15:28:43,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:28:43,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 15:28:43,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:28:43,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 15:28:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-17 15:28:43,648 INFO L87 Difference]: Start difference. First operand 82 states and 106 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-17 15:28:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:28:44,025 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2021-12-17 15:28:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 15:28:44,025 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-17 15:28:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:28:44,038 INFO L225 Difference]: With dead ends: 149 [2021-12-17 15:28:44,038 INFO L226 Difference]: Without dead ends: 87 [2021-12-17 15:28:44,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-17 15:28:44,040 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 71 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:28:44,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 428 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:28:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-17 15:28:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2021-12-17 15:28:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 54 states have internal predecessors, (60), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (27), 22 states have call predecessors, (27), 22 states have call successors, (27) [2021-12-17 15:28:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2021-12-17 15:28:44,053 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 48 [2021-12-17 15:28:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:28:44,053 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2021-12-17 15:28:44,054 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-17 15:28:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2021-12-17 15:28:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 15:28:44,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:28:44,056 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-17 15:28:44,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 15:28:44,275 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-17 15:28:44,275 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:28:44,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:28:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1481222417, now seen corresponding path program 1 times [2021-12-17 15:28:44,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:28:44,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433442207] [2021-12-17 15:28:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:44,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:28:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 15:28:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:28:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:28:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:28:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 15:28:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:28:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-17 15:28:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,425 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-17 15:28:44,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:28:44,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433442207] [2021-12-17 15:28:44,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433442207] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:28:44,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:28:44,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 15:28:44,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51464440] [2021-12-17 15:28:44,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:28:44,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 15:28:44,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:28:44,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 15:28:44,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:28:44,428 INFO L87 Difference]: Start difference. First operand 84 states and 109 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-17 15:28:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:28:44,769 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2021-12-17 15:28:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 15:28:44,769 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-17 15:28:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:28:44,771 INFO L225 Difference]: With dead ends: 149 [2021-12-17 15:28:44,771 INFO L226 Difference]: Without dead ends: 89 [2021-12-17 15:28:44,772 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-17 15:28:44,773 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 75 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:28:44,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 464 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:28:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-17 15:28:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2021-12-17 15:28:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.150943396226415) internal successors, (61), 56 states have internal predecessors, (61), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2021-12-17 15:28:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2021-12-17 15:28:44,783 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 58 [2021-12-17 15:28:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:28:44,783 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2021-12-17 15:28:44,784 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-17 15:28:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2021-12-17 15:28:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-17 15:28:44,786 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:28:44,786 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-17 15:28:44,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 15:28:44,787 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:28:44,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:28:44,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1364034462, now seen corresponding path program 1 times [2021-12-17 15:28:44,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:28:44,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120186350] [2021-12-17 15:28:44,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:44,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:28:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 15:28:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:28:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:28:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 15:28:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-17 15:28:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 15:28:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 15:28:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-17 15:28:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:44,944 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-17 15:28:44,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:28:44,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120186350] [2021-12-17 15:28:44,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120186350] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:28:44,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:28:44,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 15:28:44,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840823980] [2021-12-17 15:28:44,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:28:44,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 15:28:44,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:28:44,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 15:28:44,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:28:44,947 INFO L87 Difference]: Start difference. First operand 86 states and 112 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-17 15:28:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:28:45,266 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2021-12-17 15:28:45,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:28:45,266 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-17 15:28:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:28:45,268 INFO L225 Difference]: With dead ends: 141 [2021-12-17 15:28:45,268 INFO L226 Difference]: Without dead ends: 89 [2021-12-17 15:28:45,269 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-17 15:28:45,269 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 65 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:28:45,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 426 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 15:28:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-17 15:28:45,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-12-17 15:28:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 58 states have internal predecessors, (62), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (31), 22 states have call predecessors, (31), 22 states have call successors, (31) [2021-12-17 15:28:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2021-12-17 15:28:45,279 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 71 [2021-12-17 15:28:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:28:45,279 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2021-12-17 15:28:45,280 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-17 15:28:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2021-12-17 15:28:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-17 15:28:45,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:28:45,282 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-17 15:28:45,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 15:28:45,282 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:28:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:28:45,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1861975499, now seen corresponding path program 1 times [2021-12-17 15:28:45,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:28:45,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383425234] [2021-12-17 15:28:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:45,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:28:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:28:45,320 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 15:28:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:28:45,367 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 15:28:45,367 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 15:28:45,368 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 15:28:45,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 15:28:45,372 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-12-17 15:28:45,375 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 15:28:45,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 03:28:45 BoogieIcfgContainer [2021-12-17 15:28:45,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 15:28:45,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 15:28:45,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 15:28:45,415 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 15:28:45,415 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:28:41" (3/4) ... [2021-12-17 15:28:45,417 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 15:28:45,463 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 15:28:45,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 15:28:45,464 INFO L158 Benchmark]: Toolchain (without parser) took 4538.89ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 84.0MB in the beginning and 94.8MB in the end (delta: -10.8MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2021-12-17 15:28:45,464 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory was 52.2MB in the beginning and 52.2MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 15:28:45,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.21ms. Allocated memory is still 113.2MB. Free memory was 84.0MB in the beginning and 88.5MB in the end (delta: -4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 15:28:45,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.36ms. Allocated memory is still 113.2MB. Free memory was 88.5MB in the beginning and 86.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:28:45,465 INFO L158 Benchmark]: Boogie Preprocessor took 31.69ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 85.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:28:45,465 INFO L158 Benchmark]: RCFGBuilder took 537.43ms. Allocated memory is still 113.2MB. Free memory was 85.1MB in the beginning and 67.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-17 15:28:45,466 INFO L158 Benchmark]: TraceAbstraction took 3610.84ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 67.2MB in the beginning and 99.0MB in the end (delta: -31.8MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 15:28:45,466 INFO L158 Benchmark]: Witness Printer took 48.62ms. Allocated memory is still 136.3MB. Free memory was 99.0MB in the beginning and 94.8MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:28:45,467 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.20ms. Allocated memory is still 94.4MB. Free memory was 52.2MB in the beginning and 52.2MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.21ms. Allocated memory is still 113.2MB. Free memory was 84.0MB in the beginning and 88.5MB in the end (delta: -4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.36ms. Allocated memory is still 113.2MB. Free memory was 88.5MB in the beginning and 86.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.69ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 85.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 537.43ms. Allocated memory is still 113.2MB. Free memory was 85.1MB in the beginning and 67.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3610.84ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 67.2MB in the beginning and 99.0MB in the end (delta: -31.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 48.62ms. Allocated memory is still 136.3MB. Free memory was 99.0MB in the beginning and 94.8MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. 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: [L102] 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}] [L102] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L102] CALL task(nondet_tree()) [L78] 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}] [L78] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L78] int a = min(t); [L79] int b; VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L81] CALL, EXPR size(t) VAL [t={-1:0}] [L73] COND FALSE !(!t) [L74] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L74] CALL, EXPR size(t->left) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L74] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L74] CALL, EXPR size(t->right) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] 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}] [L74] return size(t->left) + size(t->right) + 1; [L81] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-1:0}, t={-1:0}] [L81] int n = size(t); [L82] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume_cycle_if_not(n != 0) [L83] 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}] [L83] 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}] [L84] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L62] COND FALSE !(!t) [L65] 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}] [L65] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L65] 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] [L65] i = tree_inorder(t->left, a, i) [L66] EXPR i++ [L66] EXPR t->data [L66] a[i++] = t->data [L67] 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}] [L67] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L67] 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] [L67] i = tree_inorder(t->right, a, i) [L68] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L84] 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}] [L85] 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] [L85] 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 8 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 1665 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1324 mSDsCounter, 194 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1172 IncrementalHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 194 mSolverCounterUnsat, 341 mSDtfsCounter, 1172 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.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred 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.2s SatisfiabilityAnalysisTime, 1.3s 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-17 15:28:45,499 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