/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 06:25:43,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 06:25:43,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 06:25:43,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 06:25:43,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 06:25:43,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 06:25:43,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 06:25:43,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 06:25:43,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 06:25:43,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 06:25:43,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 06:25:43,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 06:25:43,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 06:25:43,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 06:25:43,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 06:25:43,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 06:25:43,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 06:25:43,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 06:25:43,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 06:25:43,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 06:25:43,524 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 06:25:43,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 06:25:43,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 06:25:43,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 06:25:43,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 06:25:43,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 06:25:43,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 06:25:43,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 06:25:43,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 06:25:43,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 06:25:43,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 06:25:43,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 06:25:43,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 06:25:43,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 06:25:43,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 06:25:43,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 06:25:43,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 06:25:43,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 06:25:43,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 06:25:43,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 06:25:43,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 06:25:43,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 06:25:43,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-05 06:25:43,573 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 06:25:43,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 06:25:43,574 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 06:25:43,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 06:25:43,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 06:25:43,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 06:25:43,576 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 06:25:43,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 06:25:43,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 06:25:43,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 06:25:43,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 06:25:43,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 06:25:43,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 06:25:43,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 06:25:43,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 06:25:43,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 06:25:43,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 06:25:43,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 06:25:43,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 06:25:43,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 06:25:43,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 06:25:43,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 06:25:43,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 06:25:43,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 06:25:43,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 06:25:43,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 06:25:43,580 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-05 06:25:43,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-05 06:25:43,581 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 06:25:43,582 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-05 06:25:43,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 06:25:43,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 06:25:43,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 06:25:43,860 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 06:25:43,860 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 06:25:43,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-04-05 06:25:43,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2f16d8d/4711767a38f345dfb1d15507df7690fb/FLAG73f595fab [2022-04-05 06:25:44,311 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 06:25:44,311 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-04-05 06:25:44,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2f16d8d/4711767a38f345dfb1d15507df7690fb/FLAG73f595fab [2022-04-05 06:25:44,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d2f16d8d/4711767a38f345dfb1d15507df7690fb [2022-04-05 06:25:44,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 06:25:44,341 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 06:25:44,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 06:25:44,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 06:25:44,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 06:25:44,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:25:44" (1/1) ... [2022-04-05 06:25:44,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15403141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:25:44, skipping insertion in model container [2022-04-05 06:25:44,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:25:44" (1/1) ... [2022-04-05 06:25:44,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 06:25:44,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 06:25:44,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2022-04-05 06:25:44,575 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-05 06:25:44,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 06:25:44,611 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 06:25:44,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2022-04-05 06:25:44,645 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-05 06:25:44,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 06:25:44,675 INFO L208 MainTranslator]: Completed translation [2022-04-05 06:25:44,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:25:44 WrapperNode [2022-04-05 06:25:44,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 06:25:44,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 06:25:44,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 06:25:44,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 06:25:44,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:25:44" (1/1) ... [2022-04-05 06:25:44,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:25:44" (1/1) ... [2022-04-05 06:25:44,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:25:44" (1/1) ... [2022-04-05 06:25:44,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:25:44" (1/1) ... [2022-04-05 06:25:44,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:25:44" (1/1) ... [2022-04-05 06:25:44,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:25:44" (1/1) ... [2022-04-05 06:25:44,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:25:44" (1/1) ... [2022-04-05 06:25:44,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 06:25:44,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 06:25:44,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 06:25:44,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 06:25:44,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:25:44" (1/1) ... [2022-04-05 06:25:44,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 06:25:44,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:25:44,776 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-04-05 06:25:44,799 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-04-05 06:25:44,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 06:25:44,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 06:25:44,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2022-04-05 06:25:44,821 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 06:25:44,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 06:25:44,822 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-04-05 06:25:44,824 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-04-05 06:25:44,824 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-04-05 06:25:44,824 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-04-05 06:25:44,824 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-04-05 06:25:44,824 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-04-05 06:25:44,825 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 06:25:44,825 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-05 06:25:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-05 06:25:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-05 06:25:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-05 06:25:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 06:25:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-05 06:25:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2022-04-05 06:25:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 06:25:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 06:25:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 06:25:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 06:25:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 06:25:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-04-05 06:25:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-05 06:25:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 06:25:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-05 06:25:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-04-05 06:25:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 06:25:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-05 06:25:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-04-05 06:25:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 06:25:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-04-05 06:25:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-04-05 06:25:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-04-05 06:25:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-05 06:25:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-05 06:25:44,828 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 06:25:44,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 06:25:44,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 06:25:44,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 06:25:44,959 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 06:25:44,960 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 06:25:45,271 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 06:25:45,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 06:25:45,277 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-05 06:25:45,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:25:45 BoogieIcfgContainer [2022-04-05 06:25:45,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 06:25:45,282 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 06:25:45,282 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 06:25:45,284 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 06:25:45,286 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:25:45" (1/1) ... [2022-04-05 06:25:45,289 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-05 06:25:45,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 06:25:45 BasicIcfg [2022-04-05 06:25:45,333 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 06:25:45,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 06:25:45,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 06:25:45,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 06:25:45,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 06:25:44" (1/4) ... [2022-04-05 06:25:45,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfba02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:25:45, skipping insertion in model container [2022-04-05 06:25:45,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:25:44" (2/4) ... [2022-04-05 06:25:45,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfba02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:25:45, skipping insertion in model container [2022-04-05 06:25:45,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:25:45" (3/4) ... [2022-04-05 06:25:45,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfba02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:25:45, skipping insertion in model container [2022-04-05 06:25:45,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 06:25:45" (4/4) ... [2022-04-05 06:25:45,342 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.cqvasr [2022-04-05 06:25:45,346 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 06:25:45,346 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 06:25:45,396 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 06:25:45,402 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-05 06:25:45,402 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 06:25:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-05 06:25:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-05 06:25:45,430 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:25:45,431 INFO L499 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:25:45,431 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:25:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:25:45,436 INFO L85 PathProgramCache]: Analyzing trace with hash 271192072, now seen corresponding path program 1 times [2022-04-05 06:25:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:25:45,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510175330] [2022-04-05 06:25:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:25:45,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:25:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:45,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:25:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 06:25:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-05 06:25:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:45,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-05 06:25:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:45,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-05 06:25:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-05 06:25:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:45,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-05 06:25:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:25:45,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:25:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510175330] [2022-04-05 06:25:45,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510175330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:25:45,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:25:45,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-05 06:25:45,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695252327] [2022-04-05 06:25:45,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:25:45,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 06:25:45,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:25:45,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 06:25:45,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-05 06:25:45,887 INFO L87 Difference]: Start difference. First operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-05 06:25:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:25:46,668 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-04-05 06:25:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 06:25:46,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-05 06:25:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:25:46,685 INFO L225 Difference]: With dead ends: 174 [2022-04-05 06:25:46,685 INFO L226 Difference]: Without dead ends: 98 [2022-04-05 06:25:46,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-05 06:25:46,692 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 150 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 06:25:46,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 97 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 06:25:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-05 06:25:46,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2022-04-05 06:25:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-05 06:25:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2022-04-05 06:25:46,732 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 44 [2022-04-05 06:25:46,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:25:46,732 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2022-04-05 06:25:46,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-05 06:25:46,733 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-04-05 06:25:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-05 06:25:46,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:25:46,735 INFO L499 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:25:46,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 06:25:46,736 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:25:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:25:46,736 INFO L85 PathProgramCache]: Analyzing trace with hash 444305129, now seen corresponding path program 1 times [2022-04-05 06:25:46,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:25:46,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450263013] [2022-04-05 06:25:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:25:46,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:25:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:25:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:46,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 06:25:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:46,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-05 06:25:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:46,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-05 06:25:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 06:25:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-05 06:25:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:46,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-05 06:25:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:47,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-05 06:25:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:47,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-05 06:25:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-05 06:25:47,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:25:47,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450263013] [2022-04-05 06:25:47,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450263013] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:25:47,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084344457] [2022-04-05 06:25:47,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:25:47,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:25:47,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:25:47,023 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-04-05 06:25:47,040 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-04-05 06:25:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:47,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-05 06:25:47,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:25:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-05 06:25:47,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:25:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-05 06:25:47,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084344457] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:25:47,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:25:47,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 15 [2022-04-05 06:25:47,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342590338] [2022-04-05 06:25:47,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:25:47,731 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 06:25:47,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:25:47,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 06:25:47,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-05 06:25:47,732 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-05 06:25:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:25:48,524 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2022-04-05 06:25:48,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 06:25:48,524 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 56 [2022-04-05 06:25:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:25:48,526 INFO L225 Difference]: With dead ends: 165 [2022-04-05 06:25:48,526 INFO L226 Difference]: Without dead ends: 97 [2022-04-05 06:25:48,527 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-04-05 06:25:48,528 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 183 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-05 06:25:48,529 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 88 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-05 06:25:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-05 06:25:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-04-05 06:25:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-04-05 06:25:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2022-04-05 06:25:48,552 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 56 [2022-04-05 06:25:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:25:48,552 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2022-04-05 06:25:48,552 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-05 06:25:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-04-05 06:25:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-05 06:25:48,560 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:25:48,560 INFO L499 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:25:48,582 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-04-05 06:25:48,775 WARN L460 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-04-05 06:25:48,776 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:25:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:25:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash 299143807, now seen corresponding path program 1 times [2022-04-05 06:25:48,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:25:48,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684045774] [2022-04-05 06:25:48,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:25:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:25:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:48,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:25:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:48,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 06:25:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:48,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 06:25:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:48,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:25:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:48,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 06:25:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:48,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-05 06:25:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:48,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 06:25:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:48,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-05 06:25:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:48,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-05 06:25:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-05 06:25:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:48,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-05 06:25:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-05 06:25:48,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:25:48,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684045774] [2022-04-05 06:25:48,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684045774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:25:48,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:25:48,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 06:25:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150301876] [2022-04-05 06:25:48,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:25:48,981 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 06:25:48,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:25:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 06:25:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-05 06:25:48,982 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-05 06:25:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:25:49,674 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2022-04-05 06:25:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-05 06:25:49,674 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 66 [2022-04-05 06:25:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:25:49,676 INFO L225 Difference]: With dead ends: 164 [2022-04-05 06:25:49,676 INFO L226 Difference]: Without dead ends: 99 [2022-04-05 06:25:49,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-05 06:25:49,678 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 141 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 06:25:49,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 84 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 06:25:49,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-05 06:25:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-04-05 06:25:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-04-05 06:25:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2022-04-05 06:25:49,692 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 66 [2022-04-05 06:25:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:25:49,692 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2022-04-05 06:25:49,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-05 06:25:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-04-05 06:25:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-05 06:25:49,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:25:49,694 INFO L499 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:25:49,694 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 06:25:49,694 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:25:49,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:25:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1890335243, now seen corresponding path program 1 times [2022-04-05 06:25:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:25:49,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205135496] [2022-04-05 06:25:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:25:49,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:25:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:25:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-05 06:25:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 06:25:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 06:25:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 06:25:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 06:25:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-05 06:25:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-05 06:25:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 06:25:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-05 06:25:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-05 06:25:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-05 06:25:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-05 06:25:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-05 06:25:49,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:25:49,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205135496] [2022-04-05 06:25:49,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205135496] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:25:49,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451888543] [2022-04-05 06:25:49,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:25:49,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:25:49,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:25:49,931 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-04-05 06:25:49,962 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-04-05 06:25:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:25:50,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-05 06:25:50,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:25:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-05 06:25:50,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 06:25:50,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451888543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:25:50,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-05 06:25:50,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 20 [2022-04-05 06:25:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278501773] [2022-04-05 06:25:50,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:25:50,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 06:25:50,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:25:50,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 06:25:50,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2022-04-05 06:25:50,237 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-05 06:25:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:25:50,354 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2022-04-05 06:25:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 06:25:50,355 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 79 [2022-04-05 06:25:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:25:50,357 INFO L225 Difference]: With dead ends: 150 [2022-04-05 06:25:50,357 INFO L226 Difference]: Without dead ends: 97 [2022-04-05 06:25:50,358 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2022-04-05 06:25:50,360 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 35 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:25:50,361 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 706 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:25:50,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-05 06:25:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-05 06:25:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-04-05 06:25:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2022-04-05 06:25:50,373 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 79 [2022-04-05 06:25:50,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:25:50,373 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2022-04-05 06:25:50,374 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-05 06:25:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-05 06:25:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-05 06:25:50,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:25:50,375 INFO L499 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:25:50,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-05 06:25:50,579 WARN L460 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-04-05 06:25:50,580 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:25:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:25:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash 407791861, now seen corresponding path program 1 times [2022-04-05 06:25:50,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:25:50,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481276254] [2022-04-05 06:25:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:25:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:25:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-05 06:25:50,622 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-05 06:25:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-05 06:25:50,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-05 06:25:50,709 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-05 06:25:50,709 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-05 06:25:50,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-05 06:25:50,713 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-05 06:25:50,716 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 06:25:50,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:25:50 BasicIcfg [2022-04-05 06:25:50,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 06:25:50,753 INFO L158 Benchmark]: Toolchain (without parser) took 6411.57ms. Allocated memory was 180.4MB in the beginning and 235.9MB in the end (delta: 55.6MB). Free memory was 129.7MB in the beginning and 88.7MB in the end (delta: 41.0MB). Peak memory consumption was 97.2MB. Max. memory is 8.0GB. [2022-04-05 06:25:50,753 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 06:25:50,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.08ms. Allocated memory is still 180.4MB. Free memory was 129.5MB in the beginning and 157.0MB in the end (delta: -27.5MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-04-05 06:25:50,753 INFO L158 Benchmark]: Boogie Preprocessor took 68.15ms. Allocated memory is still 180.4MB. Free memory was 157.0MB in the beginning and 154.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-05 06:25:50,754 INFO L158 Benchmark]: RCFGBuilder took 534.33ms. Allocated memory is still 180.4MB. Free memory was 154.5MB in the beginning and 135.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-05 06:25:50,754 INFO L158 Benchmark]: IcfgTransformer took 50.76ms. Allocated memory is still 180.4MB. Free memory was 135.2MB in the beginning and 133.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-05 06:25:50,754 INFO L158 Benchmark]: TraceAbstraction took 5416.91ms. Allocated memory was 180.4MB in the beginning and 235.9MB in the end (delta: 55.6MB). Free memory was 132.5MB in the beginning and 88.7MB in the end (delta: 43.8MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. [2022-04-05 06:25:50,756 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.11ms. Allocated memory is still 180.4MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 333.08ms. Allocated memory is still 180.4MB. Free memory was 129.5MB in the beginning and 157.0MB in the end (delta: -27.5MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.15ms. Allocated memory is still 180.4MB. Free memory was 157.0MB in the beginning and 154.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 534.33ms. Allocated memory is still 180.4MB. Free memory was 154.5MB in the beginning and 135.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * IcfgTransformer took 50.76ms. Allocated memory is still 180.4MB. Free memory was 135.2MB in the beginning and 133.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5416.91ms. Allocated memory was 180.4MB in the beginning and 235.9MB in the end (delta: 55.6MB). Free memory was 132.5MB in the beginning and 88.7MB in the end (delta: 43.8MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L110] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-1:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}, n={-1:0}] [L110] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L110] CALL task(nondet_tree()) VAL [t={-1:0}] [L86] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={-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) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}] [L91] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L91] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L92] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-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 12 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 551 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 509 mSDsluCounter, 975 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 650 mSDsCounter, 466 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2663 IncrementalHoareTripleChecker+Invalid, 3129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 466 mSolverCounterUnsat, 325 mSDtfsCounter, 2663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 251 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, InterpolantAutomatonStates: 48, 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, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 1212 SizeOfPredicates, 7 NumberOfNonLiveVariables, 708 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-04-05 06:25:50,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...