/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:40:30,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:40:30,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:40:30,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:40:30,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:40:30,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:40:30,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:40:30,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:40:30,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:40:30,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:40:30,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:40:30,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:40:30,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:40:30,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:40:30,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:40:30,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:40:30,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:40:30,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:40:30,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:40:30,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:40:30,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:40:30,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:40:30,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:40:30,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:40:30,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:40:30,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:40:30,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:40:30,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:40:30,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:40:30,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:40:30,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:40:30,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:40:30,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:40:30,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:40:30,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:40:30,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:40:30,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:40:30,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:40:30,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:40:30,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:40:30,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:40:30,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:40:30,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:40:30,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:40:30,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:40:30,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:40:30,251 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:40:30,251 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:40:30,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:40:30,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:40:30,252 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:40:30,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:40:30,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:40:30,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:40:30,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:40:30,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:40:30,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:40:30,253 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:40:30,253 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:40:30,253 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:40:30,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:40:30,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:40:30,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:40:30,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:40:30,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:40:30,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:40:30,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:40:30,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:40:30,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:40:30,255 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:40:30,255 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:40:30,255 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:40:30,255 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:40:30,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:40:30,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:40:30,256 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-01-10 06:40:30,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:40:30,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:40:30,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:40:30,452 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:40:30,453 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:40:30,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2022-01-10 06:40:30,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed7855ae/53d258a016be4555ab1efb40b7fe007f/FLAG22c0f4793 [2022-01-10 06:40:30,867 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:40:30,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2022-01-10 06:40:30,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed7855ae/53d258a016be4555ab1efb40b7fe007f/FLAG22c0f4793 [2022-01-10 06:40:30,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed7855ae/53d258a016be4555ab1efb40b7fe007f [2022-01-10 06:40:30,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:40:30,887 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:40:30,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:40:30,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:40:30,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:40:30,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:40:30" (1/1) ... [2022-01-10 06:40:30,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6f5ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:30, skipping insertion in model container [2022-01-10 06:40:30,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:40:30" (1/1) ... [2022-01-10 06:40:30,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:40:30,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:40:31,029 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_rec_incorrect.c[618,631] [2022-01-10 06:40:31,037 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 06:40:31,038 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 06:40:31,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:40:31,067 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 06:40:31,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:40:31,072 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_rec_incorrect.c[618,631] [2022-01-10 06:40:31,078 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 06:40:31,080 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 06:40:31,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:40:31,099 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:40:31,108 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_rec_incorrect.c[618,631] [2022-01-10 06:40:31,111 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 06:40:31,112 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 06:40:31,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:40:31,127 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:40:31,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:31 WrapperNode [2022-01-10 06:40:31,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:40:31,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:40:31,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:40:31,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:40:31,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:31" (1/1) ... [2022-01-10 06:40:31,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:31" (1/1) ... [2022-01-10 06:40:31,169 INFO L137 Inliner]: procedures = 31, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2022-01-10 06:40:31,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:40:31,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:40:31,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:40:31,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:40:31,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:31" (1/1) ... [2022-01-10 06:40:31,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:31" (1/1) ... [2022-01-10 06:40:31,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:31" (1/1) ... [2022-01-10 06:40:31,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:31" (1/1) ... [2022-01-10 06:40:31,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:31" (1/1) ... [2022-01-10 06:40:31,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:31" (1/1) ... [2022-01-10 06:40:31,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:31" (1/1) ... [2022-01-10 06:40:31,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:40:31,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:40:31,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:40:31,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:40:31,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:31" (1/1) ... [2022-01-10 06:40:31,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:40:31,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:40:31,230 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-01-10 06:40:31,231 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-01-10 06:40:31,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:40:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:40:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 06:40:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:40:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-01-10 06:40:31,253 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-01-10 06:40:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-01-10 06:40:31,253 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-01-10 06:40:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:40:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-01-10 06:40:31,253 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-01-10 06:40:31,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:40:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-01-10 06:40:31,254 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-01-10 06:40:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:40:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-01-10 06:40:31,254 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-01-10 06:40:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:40:31,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:40:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 06:40:31,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 06:40:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-01-10 06:40:31,254 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-01-10 06:40:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:40:31,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:40:31,333 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:40:31,336 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:40:31,662 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:40:31,666 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:40:31,666 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 06:40:31,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:40:31 BoogieIcfgContainer [2022-01-10 06:40:31,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:40:31,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:40:31,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:40:31,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:40:31,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:40:30" (1/3) ... [2022-01-10 06:40:31,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd89556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:40:31, skipping insertion in model container [2022-01-10 06:40:31,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:31" (2/3) ... [2022-01-10 06:40:31,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd89556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:40:31, skipping insertion in model container [2022-01-10 06:40:31,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:40:31" (3/3) ... [2022-01-10 06:40:31,673 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2022-01-10 06:40:31,676 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:40:31,676 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:40:31,704 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:40:31,708 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 06:40:31,709 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:40:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-01-10 06:40:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 06:40:31,724 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:40:31,724 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:40:31,724 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:40:31,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:40:31,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1063546971, now seen corresponding path program 1 times [2022-01-10 06:40:31,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:40:31,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769538291] [2022-01-10 06:40:31,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:40:31,736 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:40:31,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:40:31,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:40:31,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:40:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:40:31,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:40:31,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:40:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:40:31,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:40:31,987 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:40:31,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769538291] [2022-01-10 06:40:31,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769538291] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:40:31,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:40:31,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:40:31,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18679328] [2022-01-10 06:40:31,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:40:31,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:40:31,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:40:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:40:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:40:32,010 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:40:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:40:32,028 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2022-01-10 06:40:32,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:40:32,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-01-10 06:40:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:40:32,035 INFO L225 Difference]: With dead ends: 145 [2022-01-10 06:40:32,035 INFO L226 Difference]: Without dead ends: 80 [2022-01-10 06:40:32,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:40:32,040 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:40:32,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:40:32,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-10 06:40:32,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-01-10 06:40:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-01-10 06:40:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2022-01-10 06:40:32,073 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 37 [2022-01-10 06:40:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:40:32,074 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2022-01-10 06:40:32,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:40:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-01-10 06:40:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 06:40:32,076 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:40:32,076 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:40:32,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 06:40:32,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:40:32,277 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:40:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:40:32,279 INFO L85 PathProgramCache]: Analyzing trace with hash -930597735, now seen corresponding path program 1 times [2022-01-10 06:40:32,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:40:32,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224008071] [2022-01-10 06:40:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:40:32,280 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:40:32,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:40:32,280 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:40:32,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:40:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:40:32,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:40:32,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:40:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:40:32,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:40:32,460 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:40:32,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224008071] [2022-01-10 06:40:32,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224008071] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:40:32,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:40:32,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:40:32,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918534144] [2022-01-10 06:40:32,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:40:32,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:40:32,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:40:32,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:40:32,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:40:32,467 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:40:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:40:32,513 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2022-01-10 06:40:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:40:32,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-01-10 06:40:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:40:32,517 INFO L225 Difference]: With dead ends: 139 [2022-01-10 06:40:32,517 INFO L226 Difference]: Without dead ends: 82 [2022-01-10 06:40:32,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:40:32,518 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:40:32,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:40:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-10 06:40:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-01-10 06:40:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 52 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2022-01-10 06:40:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2022-01-10 06:40:32,533 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 37 [2022-01-10 06:40:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:40:32,533 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2022-01-10 06:40:32,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:40:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2022-01-10 06:40:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 06:40:32,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:40:32,535 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:40:32,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 06:40:32,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:40:32,745 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:40:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:40:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash -423186624, now seen corresponding path program 1 times [2022-01-10 06:40:32,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:40:32,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501078533] [2022-01-10 06:40:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:40:32,746 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:40:32,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:40:32,747 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:40:32,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:40:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:40:32,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 06:40:32,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:40:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 06:40:33,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:40:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 06:40:33,292 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:40:33,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501078533] [2022-01-10 06:40:33,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501078533] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:40:33,293 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:40:33,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-01-10 06:40:33,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883250191] [2022-01-10 06:40:33,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:40:33,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 06:40:33,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:40:33,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 06:40:33,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:40:33,294 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 06:40:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:40:33,434 INFO L93 Difference]: Finished difference Result 147 states and 191 transitions. [2022-01-10 06:40:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:40:33,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 49 [2022-01-10 06:40:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:40:33,437 INFO L225 Difference]: With dead ends: 147 [2022-01-10 06:40:33,438 INFO L226 Difference]: Without dead ends: 84 [2022-01-10 06:40:33,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:40:33,439 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:40:33,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 638 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:40:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-10 06:40:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-01-10 06:40:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 54 states have internal predecessors, (60), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (27), 22 states have call predecessors, (27), 22 states have call successors, (27) [2022-01-10 06:40:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2022-01-10 06:40:33,446 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 49 [2022-01-10 06:40:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:40:33,446 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2022-01-10 06:40:33,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 06:40:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2022-01-10 06:40:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 06:40:33,448 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:40:33,448 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:40:33,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-01-10 06:40:33,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:40:33,655 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:40:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:40:33,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1597150819, now seen corresponding path program 1 times [2022-01-10 06:40:33,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:40:33,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086302764] [2022-01-10 06:40:33,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:40:33,656 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:40:33,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:40:33,658 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:40:33,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:40:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:40:33,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:40:33,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:40:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 06:40:33,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:40:33,881 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:40:33,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086302764] [2022-01-10 06:40:33,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086302764] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:40:33,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:40:33,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 06:40:33,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017015025] [2022-01-10 06:40:33,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:40:33,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 06:40:33,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:40:33,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 06:40:33,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:40:33,882 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 06:40:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:40:34,027 INFO L93 Difference]: Finished difference Result 147 states and 191 transitions. [2022-01-10 06:40:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:40:34,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 59 [2022-01-10 06:40:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:40:34,029 INFO L225 Difference]: With dead ends: 147 [2022-01-10 06:40:34,029 INFO L226 Difference]: Without dead ends: 86 [2022-01-10 06:40:34,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:40:34,030 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 43 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:40:34,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 588 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:40:34,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-10 06:40:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-01-10 06:40:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.150943396226415) internal successors, (61), 56 states have internal predecessors, (61), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2022-01-10 06:40:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2022-01-10 06:40:34,037 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 59 [2022-01-10 06:40:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:40:34,037 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2022-01-10 06:40:34,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 06:40:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2022-01-10 06:40:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 06:40:34,038 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:40:34,039 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:40:34,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 06:40:34,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:40:34,246 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:40:34,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:40:34,247 INFO L85 PathProgramCache]: Analyzing trace with hash -84800448, now seen corresponding path program 1 times [2022-01-10 06:40:34,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:40:34,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497185833] [2022-01-10 06:40:34,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:40:34,247 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:40:34,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:40:34,248 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:40:34,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:40:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:40:34,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 06:40:34,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:40:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-01-10 06:40:34,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:40:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-10 06:40:37,178 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:40:37,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497185833] [2022-01-10 06:40:37,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497185833] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:40:37,179 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:40:37,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-01-10 06:40:37,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576372557] [2022-01-10 06:40:37,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:40:37,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 06:40:37,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:40:37,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 06:40:37,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=291, Unknown=1, NotChecked=0, Total=342 [2022-01-10 06:40:37,182 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 6 states have call successors, (15), 2 states have call predecessors, (15), 9 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) [2022-01-10 06:40:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:40:37,564 INFO L93 Difference]: Finished difference Result 207 states and 294 transitions. [2022-01-10 06:40:37,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 06:40:37,565 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 6 states have call successors, (15), 2 states have call predecessors, (15), 9 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) Word has length 72 [2022-01-10 06:40:37,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:40:37,566 INFO L225 Difference]: With dead ends: 207 [2022-01-10 06:40:37,566 INFO L226 Difference]: Without dead ends: 152 [2022-01-10 06:40:37,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=68, Invalid=393, Unknown=1, NotChecked=0, Total=462 [2022-01-10 06:40:37,568 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 38 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:40:37,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 1765 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 127 Invalid, 0 Unknown, 27 Unchecked, 0.2s Time] [2022-01-10 06:40:37,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-01-10 06:40:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 115. [2022-01-10 06:40:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 74 states have internal predecessors, (79), 31 states have call successors, (31), 7 states have call predecessors, (31), 13 states have return successors, (57), 33 states have call predecessors, (57), 31 states have call successors, (57) [2022-01-10 06:40:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2022-01-10 06:40:37,582 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 72 [2022-01-10 06:40:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:40:37,582 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2022-01-10 06:40:37,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 6 states have call successors, (15), 2 states have call predecessors, (15), 9 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) [2022-01-10 06:40:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2022-01-10 06:40:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 06:40:37,587 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:40:37,588 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:40:37,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:40:37,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:40:37,788 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:40:37,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:40:37,789 INFO L85 PathProgramCache]: Analyzing trace with hash 305350656, now seen corresponding path program 1 times [2022-01-10 06:40:37,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:40:37,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512244087] [2022-01-10 06:40:37,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:40:37,790 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:40:37,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:40:37,790 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:40:37,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:40:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:40:37,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 06:40:37,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:40:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-01-10 06:40:38,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:40:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-10 06:40:42,886 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:40:42,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512244087] [2022-01-10 06:40:42,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512244087] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:40:42,886 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:40:42,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2022-01-10 06:40:42,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101925611] [2022-01-10 06:40:42,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:40:42,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 06:40:42,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:40:42,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 06:40:42,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=360, Unknown=1, NotChecked=0, Total=420 [2022-01-10 06:40:42,887 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (15), 2 states have call predecessors, (15), 9 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) [2022-01-10 06:40:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:40:43,399 INFO L93 Difference]: Finished difference Result 208 states and 309 transitions. [2022-01-10 06:40:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 06:40:43,399 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (15), 2 states have call predecessors, (15), 9 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) Word has length 73 [2022-01-10 06:40:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:40:43,401 INFO L225 Difference]: With dead ends: 208 [2022-01-10 06:40:43,401 INFO L226 Difference]: Without dead ends: 140 [2022-01-10 06:40:43,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=85, Invalid=514, Unknown=1, NotChecked=0, Total=600 [2022-01-10 06:40:43,402 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 25 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:40:43,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 1937 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2022-01-10 06:40:43,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-01-10 06:40:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 119. [2022-01-10 06:40:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 78 states have internal predecessors, (84), 31 states have call successors, (31), 7 states have call predecessors, (31), 14 states have return successors, (60), 33 states have call predecessors, (60), 31 states have call successors, (60) [2022-01-10 06:40:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2022-01-10 06:40:43,414 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 73 [2022-01-10 06:40:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:40:43,414 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2022-01-10 06:40:43,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (15), 2 states have call predecessors, (15), 9 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) [2022-01-10 06:40:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2022-01-10 06:40:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-10 06:40:43,415 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:40:43,415 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-01-10 06:40:43,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-01-10 06:40:43,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:40:43,624 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:40:43,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:40:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash 788189184, now seen corresponding path program 2 times [2022-01-10 06:40:43,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:40:43,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337925993] [2022-01-10 06:40:43,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:40:43,625 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:40:43,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:40:43,626 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:40:43,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:40:43,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:40:43,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:40:43,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:40:43,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:40:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-10 06:40:43,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:40:43,901 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:40:43,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337925993] [2022-01-10 06:40:43,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337925993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:40:43,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:40:43,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 06:40:43,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997738565] [2022-01-10 06:40:43,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:40:43,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 06:40:43,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:40:43,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 06:40:43,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:40:43,902 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-01-10 06:40:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:40:44,339 INFO L93 Difference]: Finished difference Result 201 states and 299 transitions. [2022-01-10 06:40:44,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:40:44,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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 75 [2022-01-10 06:40:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:40:44,341 INFO L225 Difference]: With dead ends: 201 [2022-01-10 06:40:44,341 INFO L226 Difference]: Without dead ends: 121 [2022-01-10 06:40:44,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:40:44,343 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 36 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:40:44,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 583 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 06:40:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-10 06:40:44,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-01-10 06:40:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 80 states have internal predecessors, (85), 31 states have call successors, (31), 7 states have call predecessors, (31), 15 states have return successors, (62), 33 states have call predecessors, (62), 31 states have call successors, (62) [2022-01-10 06:40:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-01-10 06:40:44,355 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 75 [2022-01-10 06:40:44,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:40:44,356 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-01-10 06:40:44,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-01-10 06:40:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-01-10 06:40:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-10 06:40:44,357 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:40:44,357 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-01-10 06:40:44,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:40:44,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:40:44,579 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:40:44,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:40:44,580 INFO L85 PathProgramCache]: Analyzing trace with hash -736712621, now seen corresponding path program 1 times [2022-01-10 06:40:44,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:40:44,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810079013] [2022-01-10 06:40:44,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:40:44,580 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:40:44,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:40:44,582 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:40:44,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:40:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:40:44,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 06:40:44,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:40:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-10 06:40:44,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:40:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-10 06:40:48,053 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:40:48,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810079013] [2022-01-10 06:40:48,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810079013] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:40:48,053 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:40:48,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2022-01-10 06:40:48,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943606191] [2022-01-10 06:40:48,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:40:48,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 06:40:48,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:40:48,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 06:40:48,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=522, Unknown=1, NotChecked=0, Total=600 [2022-01-10 06:40:48,055 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 21 states have internal predecessors, (65), 6 states have call successors, (19), 2 states have call predecessors, (19), 9 states have return successors, (20), 8 states have call predecessors, (20), 6 states have call successors, (20) [2022-01-10 06:40:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:40:48,801 INFO L93 Difference]: Finished difference Result 237 states and 348 transitions. [2022-01-10 06:40:48,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 06:40:48,802 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 21 states have internal predecessors, (65), 6 states have call successors, (19), 2 states have call predecessors, (19), 9 states have return successors, (20), 8 states have call predecessors, (20), 6 states have call successors, (20) Word has length 87 [2022-01-10 06:40:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:40:48,803 INFO L225 Difference]: With dead ends: 237 [2022-01-10 06:40:48,803 INFO L226 Difference]: Without dead ends: 163 [2022-01-10 06:40:48,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=125, Invalid=804, Unknown=1, NotChecked=0, Total=930 [2022-01-10 06:40:48,804 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 51 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 06:40:48,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 2063 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 254 Invalid, 0 Unknown, 94 Unchecked, 0.5s Time] [2022-01-10 06:40:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-01-10 06:40:48,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 120. [2022-01-10 06:40:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.162162162162162) internal successors, (86), 79 states have internal predecessors, (86), 31 states have call successors, (31), 7 states have call predecessors, (31), 14 states have return successors, (59), 33 states have call predecessors, (59), 31 states have call successors, (59) [2022-01-10 06:40:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2022-01-10 06:40:48,814 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 87 [2022-01-10 06:40:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:40:48,814 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2022-01-10 06:40:48,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 21 states have internal predecessors, (65), 6 states have call successors, (19), 2 states have call predecessors, (19), 9 states have return successors, (20), 8 states have call predecessors, (20), 6 states have call successors, (20) [2022-01-10 06:40:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2022-01-10 06:40:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-10 06:40:48,815 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:40:48,815 INFO L514 BasicCegarLoop]: trace histogram [4, 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] [2022-01-10 06:40:48,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 06:40:49,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:40:49,025 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:40:49,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:40:49,025 INFO L85 PathProgramCache]: Analyzing trace with hash -29461357, now seen corresponding path program 2 times [2022-01-10 06:40:49,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:40:49,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50752516] [2022-01-10 06:40:49,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:40:49,026 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:40:49,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:40:49,026 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:40:49,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 06:40:49,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:40:49,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-01-10 06:40:49,506 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 06:40:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:40:50,013 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 06:40:50,013 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 06:40:50,014 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:40:50,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 06:40:50,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:40:50,223 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2022-01-10 06:40:50,225 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:40:50,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:40:50 BoogieIcfgContainer [2022-01-10 06:40:50,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:40:50,270 INFO L158 Benchmark]: Toolchain (without parser) took 19382.81ms. Allocated memory was 188.7MB in the beginning and 228.6MB in the end (delta: 39.8MB). Free memory was 137.7MB in the beginning and 101.6MB in the end (delta: 36.1MB). Peak memory consumption was 76.3MB. Max. memory is 8.0GB. [2022-01-10 06:40:50,270 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:40:50,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.24ms. Allocated memory is still 188.7MB. Free memory was 137.5MB in the beginning and 161.0MB in the end (delta: -23.4MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-01-10 06:40:50,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.97ms. Allocated memory is still 188.7MB. Free memory was 161.0MB in the beginning and 159.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:40:50,271 INFO L158 Benchmark]: Boogie Preprocessor took 27.45ms. Allocated memory is still 188.7MB. Free memory was 159.4MB in the beginning and 157.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:40:50,271 INFO L158 Benchmark]: RCFGBuilder took 470.13ms. Allocated memory is still 188.7MB. Free memory was 157.3MB in the beginning and 137.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-01-10 06:40:50,272 INFO L158 Benchmark]: TraceAbstraction took 18601.24ms. Allocated memory was 188.7MB in the beginning and 228.6MB in the end (delta: 39.8MB). Free memory was 136.8MB in the beginning and 101.6MB in the end (delta: 35.3MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. [2022-01-10 06:40:50,285 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.09ms. Allocated memory is still 188.7MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.24ms. Allocated memory is still 188.7MB. Free memory was 137.5MB in the beginning and 161.0MB in the end (delta: -23.4MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.97ms. Allocated memory is still 188.7MB. Free memory was 161.0MB in the beginning and 159.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.45ms. Allocated memory is still 188.7MB. Free memory was 159.4MB in the beginning and 157.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 470.13ms. Allocated memory is still 188.7MB. Free memory was 157.3MB in the beginning and 137.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 18601.24ms. Allocated memory was 188.7MB in the beginning and 228.6MB in the end (delta: 39.8MB). Free memory was 136.8MB in the beginning and 101.6MB in the end (delta: 35.3MB). Peak memory consumption was 76.2MB. 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: [L98] 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={5: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={5:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={5:0}, n={5:0}] [L98] RET, EXPR nondet_tree() VAL [nondet_tree()={5:0}] [L98] CALL task(nondet_tree()) [L76] CALL, EXPR min(t) VAL [n={5:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={5:0}, n={5:0}, n->left={0:0}] [L40] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n={5:0}, n={5:0}, n->left={0:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={5:0}, n={5:0}, n->right={0:0}] [L41] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n={5:0}, n={5:0}, n->right={0:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={5:0}, n={5:0}] [L76] RET, EXPR min(t) VAL [min(t)=2147483647, t={5:0}, t={5:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={7:0}, t={5:0}, t={5:0}] [L79] CALL, EXPR size(t) VAL [t={5:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t={5:0}, t={5:0}, t->left={0:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [size(t->left)=0, t={5:0}, t={5:0}, t->left={0:0}] [L72] EXPR t->right VAL [size(t->left)=0, t={5:0}, t={5:0}, t->left={0:0}, t->right={0:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={5:0}, t={5:0}, t->left={0:0}, t->right={0:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={7:0}, size(t)=1, t={5:0}, t={5:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume_abort_if_not(n != 0) [L81] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={7:0}, calloc(n, sizeof(int))={4:0}, n=1, t={5:0}, t={5:0}] [L81] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={7:0}, calloc(n, sizeof(int))={4:0}, n=1, t={5:0}, t={5:0}, x={4:0}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={4:0}, t={5:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(i)=1, a={4:0}, a={4:0}, i=1, t={5:0}, t={5:0}, t->left={0:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={4:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={4:0}, a={4:0}, i=1, t={0:0}, t={0:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={4:0}, a={4:0}, i=1, t={5:0}, t={5:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] EXPR t->right VAL [\old(i)=1, a={4:0}, a={4:0}, i=2, t={5:0}, t={5:0}, t->right={0:0}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={4:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={4:0}, a={4:0}, i=2, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={4:0}, a={4:0}, i=2, t={5:0}, t={5:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={4:0}, a={4:0}, i=2, t={5:0}, t={5:0}] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={7:0}, calloc(n, sizeof(int))={4:0}, n=1, t={5:0}, t={5:0}, tree_inorder(t, x, n)=2, x={4:0}] [L83] EXPR x[0] VAL [a=2147483647, b={7:0}, calloc(n, sizeof(int))={4:0}, n=1, t={5:0}, t={5:0}, x={4:0}, x[0]=0] [L83] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 285 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 8081 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 183 IncrementalHoareTripleChecker+Unchecked, 7200 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 788 IncrementalHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 881 mSDtfsCounter, 788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 785 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=7, InterpolantAutomatonStates: 88, 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, 8 MinimizatonAttempts, 101 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 758 ConstructedInterpolants, 19 QuantifiedInterpolants, 1718 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1786 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 278/320 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-01-10 06:40:50,329 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...