/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 05:51:12,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 05:51:12,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 05:51:12,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 05:51:12,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 05:51:12,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 05:51:12,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 05:51:12,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 05:51:12,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 05:51:12,710 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 05:51:12,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 05:51:12,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 05:51:12,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 05:51:12,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 05:51:12,712 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 05:51:12,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 05:51:12,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 05:51:12,712 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 05:51:12,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 05:51:12,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 05:51:12,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 05:51:12,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 05:51:12,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 05:51:12,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 05:51:12,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 05:51:12,714 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 05:51:12,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 05:51:12,714 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 05:51:12,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 05:51:12,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 05:51:12,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 05:51:12,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 05:51:12,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 05:51:12,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 05:51:12,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 05:51:12,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 05:51:12,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 05:51:12,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 05:51:12,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 05:51:12,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 05:51:12,716 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 05:51:12,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 05:51:12,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 05:51:12,717 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 05:51:12,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 05:51:12,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 05:51:12,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 05:51:12,923 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 05:51:12,923 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 05:51:12,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec.c [2023-12-16 05:51:13,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 05:51:14,000 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 05:51:14,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c [2023-12-16 05:51:14,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f38f2cc7f/07c215013be14287bfb8cd4f6cf24ef0/FLAG00f5bad83 [2023-12-16 05:51:14,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f38f2cc7f/07c215013be14287bfb8cd4f6cf24ef0 [2023-12-16 05:51:14,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 05:51:14,017 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 05:51:14,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 05:51:14,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 05:51:14,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 05:51:14,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39014364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14, skipping insertion in model container [2023-12-16 05:51:14,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,042 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 05:51:14,154 WARN L239 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.c[585,598] [2023-12-16 05:51:14,175 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-16 05:51:14,177 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-16 05:51:14,198 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 05:51:14,206 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 05:51:14,219 WARN L239 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.c[585,598] [2023-12-16 05:51:14,223 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-16 05:51:14,224 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-16 05:51:14,230 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 05:51:14,242 INFO L206 MainTranslator]: Completed translation [2023-12-16 05:51:14,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14 WrapperNode [2023-12-16 05:51:14,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 05:51:14,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 05:51:14,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 05:51:14,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 05:51:14,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,268 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2023-12-16 05:51:14,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 05:51:14,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 05:51:14,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 05:51:14,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 05:51:14,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,293 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 16, 2, 5]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 7 writes are split as follows [0, 4, 1, 2]. [2023-12-16 05:51:14,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 05:51:14,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 05:51:14,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 05:51:14,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 05:51:14,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (1/1) ... [2023-12-16 05:51:14,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 05:51:14,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:51:14,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 05:51:14,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 05:51:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 05:51:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 05:51:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 05:51:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 05:51:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 05:51:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-16 05:51:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2023-12-16 05:51:14,365 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2023-12-16 05:51:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 05:51:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 05:51:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 05:51:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 05:51:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-12-16 05:51:14,365 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-12-16 05:51:14,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 05:51:14,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 05:51:14,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 05:51:14,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 05:51:14,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-12-16 05:51:14,366 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-12-16 05:51:14,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 05:51:14,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 05:51:14,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 05:51:14,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-16 05:51:14,368 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-12-16 05:51:14,368 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-12-16 05:51:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 05:51:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 05:51:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 05:51:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 05:51:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 05:51:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-12-16 05:51:14,369 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-12-16 05:51:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 05:51:14,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 05:51:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 05:51:14,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 05:51:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-12-16 05:51:14,370 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-12-16 05:51:14,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 05:51:14,456 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 05:51:14,458 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 05:51:14,653 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 05:51:14,667 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 05:51:14,667 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 05:51:14,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:51:14 BoogieIcfgContainer [2023-12-16 05:51:14,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 05:51:14,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 05:51:14,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 05:51:14,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 05:51:14,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:51:14" (1/3) ... [2023-12-16 05:51:14,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650012b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:51:14, skipping insertion in model container [2023-12-16 05:51:14,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:51:14" (2/3) ... [2023-12-16 05:51:14,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650012b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:51:14, skipping insertion in model container [2023-12-16 05:51:14,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:51:14" (3/3) ... [2023-12-16 05:51:14,673 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2023-12-16 05:51:14,685 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 05:51:14,685 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 05:51:14,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 05:51:14,722 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@178529d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 05:51:14,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 05:51:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 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) [2023-12-16 05:51:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 05:51:14,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:51:14,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:51:14,738 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:51:14,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:51:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1569702549, now seen corresponding path program 1 times [2023-12-16 05:51:14,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:51:14,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543938667] [2023-12-16 05:51:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:51:14,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:51:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:51:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 05:51:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 05:51:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-16 05:51:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:51:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 05:51:15,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:51:15,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543938667] [2023-12-16 05:51:15,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543938667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:51:15,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:51:15,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 05:51:15,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319353181] [2023-12-16 05:51:15,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:51:15,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 05:51:15,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:51:15,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 05:51:15,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 05:51:15,190 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:51:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:51:15,596 INFO L93 Difference]: Finished difference Result 145 states and 202 transitions. [2023-12-16 05:51:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 05:51:15,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2023-12-16 05:51:15,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:51:15,607 INFO L225 Difference]: With dead ends: 145 [2023-12-16 05:51:15,608 INFO L226 Difference]: Without dead ends: 85 [2023-12-16 05:51:15,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-16 05:51:15,612 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 117 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 05:51:15,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 157 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 05:51:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-16 05:51:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2023-12-16 05:51:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.163265306122449) internal successors, (57), 50 states have internal predecessors, (57), 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) [2023-12-16 05:51:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2023-12-16 05:51:15,677 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 35 [2023-12-16 05:51:15,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:51:15,678 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2023-12-16 05:51:15,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 05:51:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2023-12-16 05:51:15,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 05:51:15,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:51:15,680 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:51:15,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 05:51:15,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:51:15,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:51:15,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1164948578, now seen corresponding path program 1 times [2023-12-16 05:51:15,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:51:15,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167495497] [2023-12-16 05:51:15,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:51:15,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:51:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:51:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 05:51:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 05:51:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:51:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:51:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-16 05:51:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-16 05:51:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 05:51:15,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:51:15,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167495497] [2023-12-16 05:51:15,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167495497] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:51:15,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794466305] [2023-12-16 05:51:15,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:51:15,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:51:15,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:51:15,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:51:15,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 05:51:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:16,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 05:51:16,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:51:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 05:51:16,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 05:51:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 05:51:16,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794466305] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 05:51:16,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 05:51:16,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 11 [2023-12-16 05:51:16,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364653448] [2023-12-16 05:51:16,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 05:51:16,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 05:51:16,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:51:16,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 05:51:16,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-16 05:51:16,246 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-16 05:51:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:51:16,730 INFO L93 Difference]: Finished difference Result 145 states and 191 transitions. [2023-12-16 05:51:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 05:51:16,731 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 47 [2023-12-16 05:51:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:51:16,732 INFO L225 Difference]: With dead ends: 145 [2023-12-16 05:51:16,733 INFO L226 Difference]: Without dead ends: 85 [2023-12-16 05:51:16,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-12-16 05:51:16,734 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 84 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 05:51:16,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 213 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 05:51:16,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-16 05:51:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2023-12-16 05:51:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.16) internal successors, (58), 52 states have internal predecessors, (58), 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) [2023-12-16 05:51:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2023-12-16 05:51:16,743 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 47 [2023-12-16 05:51:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:51:16,743 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2023-12-16 05:51:16,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-16 05:51:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2023-12-16 05:51:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 05:51:16,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:51:16,745 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-16 05:51:16,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 05:51:16,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:51:16,951 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:51:16,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:51:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash 146784617, now seen corresponding path program 1 times [2023-12-16 05:51:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:51:16,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463874451] [2023-12-16 05:51:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:51:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:51:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:51:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:51:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:51:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 05:51:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:51:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:51:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:51:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-16 05:51:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-16 05:51:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-16 05:51:17,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:51:17,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463874451] [2023-12-16 05:51:17,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463874451] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:51:17,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:51:17,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 05:51:17,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458098328] [2023-12-16 05:51:17,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:51:17,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 05:51:17,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:51:17,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 05:51:17,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-16 05:51:17,185 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-16 05:51:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:51:17,604 INFO L93 Difference]: Finished difference Result 145 states and 191 transitions. [2023-12-16 05:51:17,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 05:51:17,605 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 59 [2023-12-16 05:51:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:51:17,606 INFO L225 Difference]: With dead ends: 145 [2023-12-16 05:51:17,606 INFO L226 Difference]: Without dead ends: 87 [2023-12-16 05:51:17,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-12-16 05:51:17,607 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 118 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 05:51:17,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 214 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 05:51:17,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-16 05:51:17,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2023-12-16 05:51:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 54 states have internal predecessors, (59), 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) [2023-12-16 05:51:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2023-12-16 05:51:17,624 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 59 [2023-12-16 05:51:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:51:17,625 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2023-12-16 05:51:17,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-16 05:51:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2023-12-16 05:51:17,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 05:51:17,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:51:17,627 INFO L195 NwaCegarLoop]: 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] [2023-12-16 05:51:17,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 05:51:17,627 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:51:17,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:51:17,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1976244599, now seen corresponding path program 1 times [2023-12-16 05:51:17,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:51:17,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244071531] [2023-12-16 05:51:17,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:51:17,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:51:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:51:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:51:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:51:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 05:51:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:51:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:51:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 05:51:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:51:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:51:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 05:51:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 05:51:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-16 05:51:17,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:51:17,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244071531] [2023-12-16 05:51:17,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244071531] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:51:17,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716029112] [2023-12-16 05:51:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:51:17,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:51:17,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:51:17,977 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:51:17,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 05:51:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:51:18,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 05:51:18,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:51:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-16 05:51:18,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:51:18,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716029112] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:51:18,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:51:18,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2023-12-16 05:51:18,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404008361] [2023-12-16 05:51:18,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:51:18,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 05:51:18,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:51:18,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 05:51:18,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2023-12-16 05:51:18,164 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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) [2023-12-16 05:51:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:51:18,254 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2023-12-16 05:51:18,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 05:51:18,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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 72 [2023-12-16 05:51:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:51:18,259 INFO L225 Difference]: With dead ends: 136 [2023-12-16 05:51:18,259 INFO L226 Difference]: Without dead ends: 86 [2023-12-16 05:51:18,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2023-12-16 05:51:18,263 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:51:18,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 558 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:51:18,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-16 05:51:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-16 05:51:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 56 states have internal predecessors, (60), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (31), 22 states have call predecessors, (31), 22 states have call successors, (31) [2023-12-16 05:51:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 113 transitions. [2023-12-16 05:51:18,275 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 113 transitions. Word has length 72 [2023-12-16 05:51:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:51:18,275 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 113 transitions. [2023-12-16 05:51:18,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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) [2023-12-16 05:51:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions. [2023-12-16 05:51:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-16 05:51:18,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:51:18,277 INFO L195 NwaCegarLoop]: 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] [2023-12-16 05:51:18,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 05:51:18,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-16 05:51:18,489 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:51:18,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:51:18,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1845875786, now seen corresponding path program 1 times [2023-12-16 05:51:18,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:51:18,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183950198] [2023-12-16 05:51:18,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:51:18,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:51:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 05:51:18,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 05:51:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 05:51:18,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 05:51:18,551 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 05:51:18,551 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 05:51:18,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 05:51:18,555 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 05:51:18,557 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 05:51:18,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:51:18 BoogieIcfgContainer [2023-12-16 05:51:18,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 05:51:18,589 INFO L158 Benchmark]: Toolchain (without parser) took 4572.69ms. Allocated memory was 305.1MB in the beginning and 421.5MB in the end (delta: 116.4MB). Free memory was 253.2MB in the beginning and 341.4MB in the end (delta: -88.2MB). Peak memory consumption was 29.8MB. Max. memory is 8.0GB. [2023-12-16 05:51:18,590 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 05:51:18,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.69ms. Allocated memory is still 305.1MB. Free memory was 253.2MB in the beginning and 240.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 05:51:18,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.30ms. Allocated memory is still 305.1MB. Free memory was 240.1MB in the beginning and 238.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 05:51:18,590 INFO L158 Benchmark]: Boogie Preprocessor took 41.91ms. Allocated memory is still 305.1MB. Free memory was 238.5MB in the beginning and 235.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 05:51:18,590 INFO L158 Benchmark]: RCFGBuilder took 356.55ms. Allocated memory is still 305.1MB. Free memory was 235.4MB in the beginning and 211.8MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-16 05:51:18,591 INFO L158 Benchmark]: TraceAbstraction took 3920.02ms. Allocated memory was 305.1MB in the beginning and 421.5MB in the end (delta: 116.4MB). Free memory was 210.8MB in the beginning and 341.4MB in the end (delta: -130.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 05:51:18,591 INFO L338 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 209.7MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.69ms. Allocated memory is still 305.1MB. Free memory was 253.2MB in the beginning and 240.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.30ms. Allocated memory is still 305.1MB. Free memory was 240.1MB in the beginning and 238.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.91ms. Allocated memory is still 305.1MB. Free memory was 238.5MB in the beginning and 235.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 356.55ms. Allocated memory is still 305.1MB. Free memory was 235.4MB in the beginning and 211.8MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3920.02ms. Allocated memory was 305.1MB in the beginning and 421.5MB in the end (delta: 116.4MB). Free memory was 210.8MB in the beginning and 341.4MB in the end (delta: -130.6MB). There was no memory consumed. 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: [L102] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-1:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}, n={-1:0}] [L102] RET, EXPR nondet_tree() [L102] CALL task(nondet_tree()) [L78] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}] [L41] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->left) VAL [a=2147483647, n={-1:0}, n={-1:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}] [L42] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L42] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L78] RET, EXPR min(t) VAL [t={-1:0}, t={-1:0}] [L78] int a = min(t); [L79] int b; VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L81] CALL, EXPR size(t) VAL [t={-1:0}] [L73] COND FALSE !(!t) [L74] EXPR t->left VAL [t={-1:0}, t={-1:0}] [L74] CALL, EXPR size(t->left) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->left) VAL [t={-1:0}, t={-1:0}] [L74] EXPR t->right VAL [t={-1:0}, t={-1:0}] [L74] CALL, EXPR size(t->right) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->right) VAL [t={-1:0}, t={-1:0}] [L74] return size(t->left) + size(t->right) + 1; [L81] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L81] int n = size(t); [L82] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume_cycle_if_not(n != 0) [L83] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}] [L83] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L84] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L62] COND FALSE !(!t) [L65] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}] [L65] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}] [L65] i = tree_inorder(t->left, a, i) [L66] EXPR i++ [L66] EXPR t->data [L66] a[i++] = t->data [L67] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L67] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L67] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L67] i = tree_inorder(t->right, a, i) [L68] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L84] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L85] EXPR x[0] [L85] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 353 mSDsluCounter, 1142 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 929 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1476 IncrementalHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 213 mSDtfsCounter, 1476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=4, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 1041 SizeOfPredicates, 10 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 124/132 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! [2023-12-16 05:51:18,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...