./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 35987657 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-?-3598765 [2022-07-21 02:59:34,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:59:34,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:59:34,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:59:34,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:59:34,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:59:34,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:59:34,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:59:34,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:59:34,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:59:34,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:59:34,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:59:34,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:59:34,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:59:34,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:59:34,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:59:34,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:59:34,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:59:34,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:59:34,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:59:34,216 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:59:34,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:59:34,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:59:34,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:59:34,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:59:34,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:59:34,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:59:34,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:59:34,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:59:34,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:59:34,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:59:34,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:59:34,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:59:34,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:59:34,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:59:34,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:59:34,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:59:34,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:59:34,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:59:34,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:59:34,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:59:34,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:59:34,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:59:34,270 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:59:34,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:59:34,271 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:59:34,271 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:59:34,272 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:59:34,272 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:59:34,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:59:34,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:59:34,273 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:59:34,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:59:34,274 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:59:34,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:59:34,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:59:34,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:59:34,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:59:34,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:59:34,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:59:34,288 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:59:34,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:59:34,288 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:59:34,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:59:34,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:59:34,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:59:34,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:59:34,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:59:34,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:59:34,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:59:34,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:59:34,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:59:34,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:59:34,290 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:59:34,290 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:59:34,290 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:59:34,290 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 [2022-07-21 02:59:34,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:59:34,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:59:34,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:59:34,551 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:59:34,551 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:59:34,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter.c [2022-07-21 02:59:34,590 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53729278c/1dd5b81ac2524a93a5f10b5de4bcb0a4/FLAGc5ce42e0b [2022-07-21 02:59:34,898 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:59:34,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c [2022-07-21 02:59:34,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53729278c/1dd5b81ac2524a93a5f10b5de4bcb0a4/FLAGc5ce42e0b [2022-07-21 02:59:35,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53729278c/1dd5b81ac2524a93a5f10b5de4bcb0a4 [2022-07-21 02:59:35,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:59:35,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:59:35,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:59:35,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:59:35,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:59:35,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:59:35" (1/1) ... [2022-07-21 02:59:35,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4584d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35, skipping insertion in model container [2022-07-21 02:59:35,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:59:35" (1/1) ... [2022-07-21 02:59:35,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:59:35,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:59:35,452 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] [2022-07-21 02:59:35,464 WARN L1550 CHandler]: Possible shadowing of function min [2022-07-21 02:59:35,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:59:35,480 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:59:35,509 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] [2022-07-21 02:59:35,529 WARN L1550 CHandler]: Possible shadowing of function min [2022-07-21 02:59:35,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:59:35,548 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:59:35,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35 WrapperNode [2022-07-21 02:59:35,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:59:35,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:59:35,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:59:35,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:59:35,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35" (1/1) ... [2022-07-21 02:59:35,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35" (1/1) ... [2022-07-21 02:59:35,580 INFO L137 Inliner]: procedures = 29, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2022-07-21 02:59:35,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:59:35,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:59:35,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:59:35,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:59:35,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35" (1/1) ... [2022-07-21 02:59:35,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35" (1/1) ... [2022-07-21 02:59:35,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35" (1/1) ... [2022-07-21 02:59:35,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35" (1/1) ... [2022-07-21 02:59:35,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35" (1/1) ... [2022-07-21 02:59:35,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35" (1/1) ... [2022-07-21 02:59:35,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35" (1/1) ... [2022-07-21 02:59:35,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:59:35,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:59:35,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:59:35,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:59:35,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35" (1/1) ... [2022-07-21 02:59:35,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:59:35,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:59:35,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 02:59:35,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 02:59:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:59:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 02:59:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:59:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:59:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-07-21 02:59:35,660 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-07-21 02:59:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:59:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 02:59:35,661 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 02:59:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:59:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-07-21 02:59:35,661 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-07-21 02:59:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:59:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:59:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-07-21 02:59:35,662 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-07-21 02:59:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:59:35,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:59:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 02:59:35,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 02:59:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-07-21 02:59:35,662 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-07-21 02:59:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:59:35,758 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:59:35,759 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:59:36,030 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:59:36,035 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:59:36,035 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 02:59:36,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:59:36 BoogieIcfgContainer [2022-07-21 02:59:36,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:59:36,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:59:36,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:59:36,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:59:36,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:59:35" (1/3) ... [2022-07-21 02:59:36,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b866a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:59:36, skipping insertion in model container [2022-07-21 02:59:36,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:59:35" (2/3) ... [2022-07-21 02:59:36,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b866a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:59:36, skipping insertion in model container [2022-07-21 02:59:36,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:59:36" (3/3) ... [2022-07-21 02:59:36,042 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2022-07-21 02:59:36,052 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:59:36,052 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:59:36,118 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:59:36,128 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@668c0a1f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@229988c [2022-07-21 02:59:36,128 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:59:36,132 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) [2022-07-21 02:59:36,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 02:59:36,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:59:36,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:59:36,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:59:36,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:59:36,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1252310823, now seen corresponding path program 1 times [2022-07-21 02:59:36,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:59:36,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700130651] [2022-07-21 02:59:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:59:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:36,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:59:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 02:59:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:36,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 02:59:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:36,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 02:59:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:36,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 02:59:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:59:36,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:59:36,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700130651] [2022-07-21 02:59:36,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700130651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:59:36,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:59:36,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 02:59:36,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234390988] [2022-07-21 02:59:36,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:59:36,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 02:59:36,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:59:36,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 02:59:36,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 02:59:36,504 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) [2022-07-21 02:59:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:59:36,795 INFO L93 Difference]: Finished difference Result 149 states and 208 transitions. [2022-07-21 02:59:36,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:59:36,797 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 [2022-07-21 02:59:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:59:36,806 INFO L225 Difference]: With dead ends: 149 [2022-07-21 02:59:36,807 INFO L226 Difference]: Without dead ends: 84 [2022-07-21 02:59:36,810 INFO L412 NwaCegarLoop]: 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 [2022-07-21 02:59:36,816 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 58 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:59:36,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 304 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 02:59:36,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-21 02:59:36,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2022-07-21 02:59:36,857 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) [2022-07-21 02:59:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2022-07-21 02:59:36,863 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 36 [2022-07-21 02:59:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:59:36,864 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2022-07-21 02:59:36,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 02:59:36,865 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2022-07-21 02:59:36,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 02:59:36,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:59:36,871 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:59:36,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:59:36,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:59:36,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:59:36,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1818033216, now seen corresponding path program 1 times [2022-07-21 02:59:36,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:59:36,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626587909] [2022-07-21 02:59:36,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:36,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:59:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:36,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:59:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:36,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 02:59:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:36,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 02:59:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:37,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:59:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:37,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 02:59:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:37,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 02:59:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 02:59:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 02:59:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:59:37,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626587909] [2022-07-21 02:59:37,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626587909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:59:37,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105167190] [2022-07-21 02:59:37,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:37,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:59:37,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:59:37,046 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) [2022-07-21 02:59:37,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 02:59:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:37,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 02:59:37,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:59:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 02:59:37,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:59:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 02:59:37,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105167190] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:59:37,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:59:37,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 11 [2022-07-21 02:59:37,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273157871] [2022-07-21 02:59:37,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:59:37,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 02:59:37,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:59:37,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 02:59:37,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-21 02:59:37,382 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 02:59:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:59:37,702 INFO L93 Difference]: Finished difference Result 143 states and 189 transitions. [2022-07-21 02:59:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 02:59:37,702 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 48 [2022-07-21 02:59:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:59:37,704 INFO L225 Difference]: With dead ends: 143 [2022-07-21 02:59:37,704 INFO L226 Difference]: Without dead ends: 84 [2022-07-21 02:59:37,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-07-21 02:59:37,705 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 34 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:59:37,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 397 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 02:59:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-21 02:59:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2022-07-21 02:59:37,718 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) [2022-07-21 02:59:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2022-07-21 02:59:37,721 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 48 [2022-07-21 02:59:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:59:37,721 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2022-07-21 02:59:37,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 02:59:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2022-07-21 02:59:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 02:59:37,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:59:37,723 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:59:37,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 02:59:37,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:59:37,931 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:59:37,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:59:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash -638065853, now seen corresponding path program 1 times [2022-07-21 02:59:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:59:37,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661041267] [2022-07-21 02:59:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:37,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:59:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:37,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:59:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 02:59:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 02:59:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 02:59:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 02:59:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:59:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 02:59:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 02:59:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 02:59:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 02:59:38,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:59:38,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661041267] [2022-07-21 02:59:38,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661041267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:59:38,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:59:38,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 02:59:38,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160862093] [2022-07-21 02:59:38,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:59:38,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 02:59:38,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:59:38,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 02:59:38,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-21 02:59:38,087 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) [2022-07-21 02:59:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:59:38,422 INFO L93 Difference]: Finished difference Result 143 states and 189 transitions. [2022-07-21 02:59:38,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 02:59:38,423 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 [2022-07-21 02:59:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:59:38,424 INFO L225 Difference]: With dead ends: 143 [2022-07-21 02:59:38,424 INFO L226 Difference]: Without dead ends: 86 [2022-07-21 02:59:38,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-21 02:59:38,425 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 85 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:59:38,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 365 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 02:59:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-21 02:59:38,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2022-07-21 02:59:38,453 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) [2022-07-21 02:59:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2022-07-21 02:59:38,454 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 58 [2022-07-21 02:59:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:59:38,455 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2022-07-21 02:59:38,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-21 02:59:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2022-07-21 02:59:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 02:59:38,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:59:38,457 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:59:38,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 02:59:38,457 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:59:38,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:59:38,458 INFO L85 PathProgramCache]: Analyzing trace with hash 51768432, now seen corresponding path program 1 times [2022-07-21 02:59:38,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:59:38,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245758349] [2022-07-21 02:59:38,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:38,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:59:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:59:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 02:59:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 02:59:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 02:59:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:59:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 02:59:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 02:59:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:59:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 02:59:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 02:59:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 02:59:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-21 02:59:38,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:59:38,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245758349] [2022-07-21 02:59:38,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245758349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:59:38,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006191081] [2022-07-21 02:59:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:38,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:59:38,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:59:38,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:59:38,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 02:59:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:59:38,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 02:59:38,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:59:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 02:59:38,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 02:59:38,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006191081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:59:38,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 02:59:38,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2022-07-21 02:59:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948209325] [2022-07-21 02:59:38,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:59:38,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 02:59:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:59:38,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 02:59:38,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-21 02:59:38,869 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 02:59:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:59:38,967 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2022-07-21 02:59:38,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 02:59:38,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 71 [2022-07-21 02:59:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:59:38,969 INFO L225 Difference]: With dead ends: 134 [2022-07-21 02:59:38,969 INFO L226 Difference]: Without dead ends: 85 [2022-07-21 02:59:38,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2022-07-21 02:59:38,970 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 48 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:59:38,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 522 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 02:59:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-21 02:59:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-07-21 02:59:38,977 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) [2022-07-21 02:59:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 113 transitions. [2022-07-21 02:59:38,977 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 113 transitions. Word has length 71 [2022-07-21 02:59:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:59:38,978 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 113 transitions. [2022-07-21 02:59:38,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 02:59:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2022-07-21 02:59:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-21 02:59:38,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:59:38,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:59:38,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 02:59:39,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-21 02:59:39,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:59:39,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:59:39,181 INFO L85 PathProgramCache]: Analyzing trace with hash -554559437, now seen corresponding path program 1 times [2022-07-21 02:59:39,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:59:39,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3168816] [2022-07-21 02:59:39,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:59:39,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:59:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 02:59:39,229 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 02:59:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 02:59:39,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 02:59:39,294 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 02:59:39,295 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 02:59:39,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 02:59:39,300 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-21 02:59:39,302 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 02:59:39,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 02:59:39 BoogieIcfgContainer [2022-07-21 02:59:39,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 02:59:39,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 02:59:39,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 02:59:39,350 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 02:59:39,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:59:36" (3/4) ... [2022-07-21 02:59:39,351 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 02:59:39,389 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 02:59:39,390 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 02:59:39,390 INFO L158 Benchmark]: Toolchain (without parser) took 4055.84ms. Allocated memory was 48.2MB in the beginning and 92.3MB in the end (delta: 44.0MB). Free memory was 25.3MB in the beginning and 61.5MB in the end (delta: -36.3MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-07-21 02:59:39,390 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 48.2MB. Free memory is still 30.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:59:39,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.26ms. Allocated memory was 48.2MB in the beginning and 62.9MB in the end (delta: 14.7MB). Free memory was 25.0MB in the beginning and 45.0MB in the end (delta: -20.0MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-21 02:59:39,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.51ms. Allocated memory is still 62.9MB. Free memory was 45.0MB in the beginning and 43.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:59:39,391 INFO L158 Benchmark]: Boogie Preprocessor took 22.20ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 41.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 02:59:39,392 INFO L158 Benchmark]: RCFGBuilder took 432.59ms. Allocated memory is still 62.9MB. Free memory was 41.1MB in the beginning and 37.4MB in the end (delta: 3.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-21 02:59:39,392 INFO L158 Benchmark]: TraceAbstraction took 3311.67ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 36.8MB in the beginning and 65.7MB in the end (delta: -28.9MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2022-07-21 02:59:39,392 INFO L158 Benchmark]: Witness Printer took 40.16ms. Allocated memory is still 92.3MB. Free memory was 65.7MB in the beginning and 61.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 02:59:39,394 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 48.2MB. Free memory is still 30.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.26ms. Allocated memory was 48.2MB in the beginning and 62.9MB in the end (delta: 14.7MB). Free memory was 25.0MB in the beginning and 45.0MB in the end (delta: -20.0MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.51ms. Allocated memory is still 62.9MB. Free memory was 45.0MB in the beginning and 43.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.20ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 41.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 432.59ms. Allocated memory is still 62.9MB. Free memory was 41.1MB in the beginning and 37.4MB in the end (delta: 3.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3311.67ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 36.8MB in the beginning and 65.7MB in the end (delta: -28.9MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * Witness Printer took 40.16ms. Allocated memory is still 92.3MB. Free memory was 65.7MB in the beginning and 61.5MB 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: 3.2s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 1588 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1239 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1152 IncrementalHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 349 mSDtfsCounter, 1152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 213 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=4, InterpolantAutomatonStates: 31, 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, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 1106 SizeOfPredicates, 10 NumberOfNonLiveVariables, 638 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 115/123 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 02:59:39,418 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