/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:07:42,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:07:42,076 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-15 22:07:42,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:07:42,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:07:42,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:07:42,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:07:42,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:07:42,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:07:42,111 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:07:42,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:07:42,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:07:42,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:07:42,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:07:42,113 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:07:42,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:07:42,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:07:42,113 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:07:42,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:07:42,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:07:42,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:07:42,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:07:42,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:07:42,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:07:42,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:07:42,116 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:07:42,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:07:42,116 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:07:42,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:07:42,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:07:42,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:07:42,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:07:42,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:07:42,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:07:42,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:07:42,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:07:42,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:07:42,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:07:42,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:07:42,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:07:42,119 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:07:42,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:07:42,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:07:42,119 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 -> true [2023-12-15 22:07:42,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:07:42,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:07:42,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:07:42,326 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:07:42,327 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:07:42,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2023-12-15 22:07:43,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:07:43,577 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:07:43,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c [2023-12-15 22:07:43,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d469e73d/5582119fc9be4fffa107c1c6626cf17d/FLAGbda3633fd [2023-12-15 22:07:43,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d469e73d/5582119fc9be4fffa107c1c6626cf17d [2023-12-15 22:07:43,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:07:43,610 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:07:43,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:07:43,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:07:43,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:07:43,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c41b612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43, skipping insertion in model container [2023-12-15 22:07:43,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,638 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:07:43,770 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_iter_incorrect.c[619,632] [2023-12-15 22:07:43,783 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-15 22:07:43,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:07:43,798 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:07:43,806 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_iter_incorrect.c[619,632] [2023-12-15 22:07:43,811 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-15 22:07:43,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:07:43,828 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:07:43,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43 WrapperNode [2023-12-15 22:07:43,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:07:43,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:07:43,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:07:43,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:07:43,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,882 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2023-12-15 22:07:43,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:07:43,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:07:43,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:07:43,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:07:43,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,926 INFO L175 MemorySlicer]: Split 27 memory accesses to 4 slices as follows [2, 5, 2, 18]. 67 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, 2, 1, 4]. [2023-12-15 22:07:43,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:07:43,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:07:43,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:07:43,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:07:43,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (1/1) ... [2023-12-15 22:07:43,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:07:43,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:07:43,983 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-15 22:07:44,014 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-15 22:07:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:07:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-15 22:07:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 22:07:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 22:07:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-15 22:07:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-15 22:07:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 22:07:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 22:07:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 22:07:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 22:07:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-12-15 22:07:44,023 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-12-15 22:07:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 22:07:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 22:07:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 22:07:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 22:07:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-12-15 22:07:44,024 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-12-15 22:07:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 22:07:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 22:07:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-15 22:07:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-15 22:07:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-12-15 22:07:44,024 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-12-15 22:07:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:07:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 22:07:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 22:07:44,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 22:07:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 22:07:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-12-15 22:07:44,025 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-12-15 22:07:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:07:44,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:07:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-15 22:07:44,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-15 22:07:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-12-15 22:07:44,025 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-12-15 22:07:44,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 22:07:44,106 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:07:44,108 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:07:44,386 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:07:44,415 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:07:44,416 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-15 22:07:44,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:07:44 BoogieIcfgContainer [2023-12-15 22:07:44,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:07:44,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:07:44,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:07:44,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:07:44,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:07:43" (1/3) ... [2023-12-15 22:07:44,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162b8501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:07:44, skipping insertion in model container [2023-12-15 22:07:44,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:07:43" (2/3) ... [2023-12-15 22:07:44,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162b8501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:07:44, skipping insertion in model container [2023-12-15 22:07:44,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:07:44" (3/3) ... [2023-12-15 22:07:44,440 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2023-12-15 22:07:44,452 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:07:44,452 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 22:07:44,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:07:44,509 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;@6872ede2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:07:44,509 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 22:07:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 22:07:44,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-15 22:07:44,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:07:44,521 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-15 22:07:44,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:07:44,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:07:44,526 INFO L85 PathProgramCache]: Analyzing trace with hash 320711133, now seen corresponding path program 1 times [2023-12-15 22:07:44,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:07:44,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358682051] [2023-12-15 22:07:44,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:07:44,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:07:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:44,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:07:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:44,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:07:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:44,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 22:07:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:44,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:07:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:44,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-15 22:07:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:44,997 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-15 22:07:44,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:07:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358682051] [2023-12-15 22:07:44,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358682051] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:07:44,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:07:44,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 22:07:45,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553729575] [2023-12-15 22:07:45,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:07:45,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 22:07:45,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:07:45,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 22:07:45,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 22:07:45,031 INFO L87 Difference]: Start difference. First operand has 75 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 8 states, 8 states have (on average 3.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-15 22:07:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:07:45,379 INFO L93 Difference]: Finished difference Result 134 states and 188 transitions. [2023-12-15 22:07:45,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:07:45,381 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-15 22:07:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:07:45,388 INFO L225 Difference]: With dead ends: 134 [2023-12-15 22:07:45,389 INFO L226 Difference]: Without dead ends: 80 [2023-12-15 22:07:45,392 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-15 22:07:45,394 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 97 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:07:45,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 165 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 22:07:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-15 22:07:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2023-12-15 22:07:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 48 states have internal predecessors, (55), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2023-12-15 22:07:45,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2023-12-15 22:07:45,429 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 35 [2023-12-15 22:07:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:07:45,429 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2023-12-15 22:07:45,429 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-15 22:07:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2023-12-15 22:07:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-15 22:07:45,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:07:45,431 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-15 22:07:45,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 22:07:45,432 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:07:45,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:07:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash 944594216, now seen corresponding path program 1 times [2023-12-15 22:07:45,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:07:45,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897570436] [2023-12-15 22:07:45,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:07:45,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:07:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:45,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:07:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:45,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:07:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:45,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 22:07:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:07:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:07:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:45,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-15 22:07:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:45,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:07:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:45,801 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-15 22:07:45,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:07:45,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897570436] [2023-12-15 22:07:45,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897570436] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:07:45,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838159648] [2023-12-15 22:07:45,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:07:45,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:07:45,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:07:45,817 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-15 22:07:45,819 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-15 22:07:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:45,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 22:07:45,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:07:46,051 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-15 22:07:46,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:07:46,194 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-15 22:07:46,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838159648] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:07:46,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:07:46,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2023-12-15 22:07:46,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909942557] [2023-12-15 22:07:46,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:07:46,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 22:07:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:07:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 22:07:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:07:46,197 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-15 22:07:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:07:46,665 INFO L93 Difference]: Finished difference Result 136 states and 181 transitions. [2023-12-15 22:07:46,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 22:07:46,666 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 47 [2023-12-15 22:07:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:07:46,670 INFO L225 Difference]: With dead ends: 136 [2023-12-15 22:07:46,671 INFO L226 Difference]: Without dead ends: 80 [2023-12-15 22:07:46,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-12-15 22:07:46,675 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 104 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:07:46,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 248 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 22:07:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-15 22:07:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2023-12-15 22:07:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2023-12-15 22:07:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2023-12-15 22:07:46,687 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 47 [2023-12-15 22:07:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:07:46,687 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2023-12-15 22:07:46,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-15 22:07:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2023-12-15 22:07:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-15 22:07:46,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:07:46,689 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-15 22:07:46,694 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-15 22:07:46,889 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-15 22:07:46,890 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:07:46,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:07:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1061745653, now seen corresponding path program 1 times [2023-12-15 22:07:46,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:07:46,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166914081] [2023-12-15 22:07:46,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:07:46,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:07:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:46,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:07:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:07:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:07:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 22:07:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-15 22:07:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:07:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:07:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 22:07:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-15 22:07:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,139 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-15 22:07:47,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:07:47,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166914081] [2023-12-15 22:07:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166914081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:07:47,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:07:47,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 22:07:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590655023] [2023-12-15 22:07:47,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:07:47,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 22:07:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:07:47,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 22:07:47,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-15 22:07:47,144 INFO L87 Difference]: Start difference. First operand 77 states and 101 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-15 22:07:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:07:47,555 INFO L93 Difference]: Finished difference Result 136 states and 181 transitions. [2023-12-15 22:07:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 22:07:47,555 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-15 22:07:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:07:47,561 INFO L225 Difference]: With dead ends: 136 [2023-12-15 22:07:47,561 INFO L226 Difference]: Without dead ends: 82 [2023-12-15 22:07:47,562 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-15 22:07:47,564 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 115 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:07:47,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 226 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 22:07:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-15 22:07:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2023-12-15 22:07:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.163265306122449) internal successors, (57), 52 states have internal predecessors, (57), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2023-12-15 22:07:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2023-12-15 22:07:47,582 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 59 [2023-12-15 22:07:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:07:47,582 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2023-12-15 22:07:47,582 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-15 22:07:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2023-12-15 22:07:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 22:07:47,584 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:07:47,584 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-15 22:07:47,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 22:07:47,584 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:07:47,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:07:47,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1631947453, now seen corresponding path program 1 times [2023-12-15 22:07:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:07:47,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664672273] [2023-12-15 22:07:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:07:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:07:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:07:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:07:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:07:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 22:07:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:07:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:07:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 22:07:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:07:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:07:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 22:07:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 22:07:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:47,858 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-15 22:07:47,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:07:47,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664672273] [2023-12-15 22:07:47,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664672273] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:07:47,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591213568] [2023-12-15 22:07:47,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:07:47,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:07:47,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:07:47,873 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-15 22:07:47,938 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-15 22:07:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:07:48,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-15 22:07:48,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:07:48,081 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-15 22:07:48,082 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:07:48,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591213568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:07:48,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 22:07:48,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 17 [2023-12-15 22:07:48,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210104670] [2023-12-15 22:07:48,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:07:48,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 22:07:48,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:07:48,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 22:07:48,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2023-12-15 22:07:48,083 INFO L87 Difference]: Start difference. First operand 79 states and 104 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-15 22:07:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:07:48,181 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2023-12-15 22:07:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:07:48,181 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-15 22:07:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:07:48,182 INFO L225 Difference]: With dead ends: 127 [2023-12-15 22:07:48,182 INFO L226 Difference]: Without dead ends: 81 [2023-12-15 22:07:48,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2023-12-15 22:07:48,183 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:07:48,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 498 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:07:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-15 22:07:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-15 22:07:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.16) internal successors, (58), 54 states have internal predecessors, (58), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30) [2023-12-15 22:07:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2023-12-15 22:07:48,190 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 72 [2023-12-15 22:07:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:07:48,191 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2023-12-15 22:07:48,191 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-15 22:07:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2023-12-15 22:07:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-15 22:07:48,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:07:48,193 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-15 22:07:48,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 22:07:48,397 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-15 22:07:48,398 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:07:48,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:07:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash -582366336, now seen corresponding path program 1 times [2023-12-15 22:07:48,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:07:48,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065032555] [2023-12-15 22:07:48,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:07:48,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:07:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 22:07:48,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 22:07:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 22:07:48,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 22:07:48,475 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 22:07:48,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 22:07:48,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 22:07:48,479 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-15 22:07:48,481 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:07:48,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:07:48 BoogieIcfgContainer [2023-12-15 22:07:48,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:07:48,508 INFO L158 Benchmark]: Toolchain (without parser) took 4897.85ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 140.7MB in the beginning and 192.2MB in the end (delta: -51.5MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. [2023-12-15 22:07:48,508 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:07:48,508 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.66ms. Allocated memory is still 192.9MB. Free memory was 140.7MB in the beginning and 128.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 22:07:48,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.81ms. Allocated memory is still 192.9MB. Free memory was 128.0MB in the beginning and 126.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 22:07:48,509 INFO L158 Benchmark]: Boogie Preprocessor took 71.31ms. Allocated memory is still 192.9MB. Free memory was 126.0MB in the beginning and 122.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 22:07:48,509 INFO L158 Benchmark]: RCFGBuilder took 460.78ms. Allocated memory is still 192.9MB. Free memory was 122.4MB in the beginning and 98.8MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-15 22:07:48,509 INFO L158 Benchmark]: TraceAbstraction took 4088.50ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 98.2MB in the beginning and 192.2MB in the end (delta: -93.9MB). Peak memory consumption was 58.3MB. Max. memory is 8.0GB. [2023-12-15 22:07:48,510 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.12ms. Allocated memory is still 192.9MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.66ms. Allocated memory is still 192.9MB. Free memory was 140.7MB in the beginning and 128.0MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.81ms. Allocated memory is still 192.9MB. Free memory was 128.0MB in the beginning and 126.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.31ms. Allocated memory is still 192.9MB. Free memory was 126.0MB in the beginning and 122.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 460.78ms. Allocated memory is still 192.9MB. Free memory was 122.4MB in the beginning and 98.8MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4088.50ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 98.2MB in the beginning and 192.2MB in the end (delta: -93.9MB). Peak memory consumption was 58.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L105] 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}] [L105] RET, EXPR nondet_tree() [L105] CALL task(nondet_tree()) [L83] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={-1:0}, n={-1: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 [n={-1:0}, n={-1:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={-1:0}, n={-1: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, n={-1:0}, n={-1:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-1:0}, n={-1:0}] [L83] RET, EXPR min(t) VAL [t={-1:0}, t={-1:0}] [L83] int a = min(t); [L84] int b; VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L86] CALL, EXPR size(t) VAL [t={-1:0}] [L78] COND FALSE !(!t) [L79] EXPR t->left VAL [t={-1:0}, t={-1:0}] [L79] CALL, EXPR size(t->left) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->left) VAL [t={-1:0}, t={-1:0}] [L79] EXPR t->right VAL [t={-1:0}, t={-1:0}] [L79] CALL, EXPR size(t->right) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->right) VAL [t={-1:0}, t={-1:0}] [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume_abort_if_not(n != 0) [L88] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}] [L88] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}, x={-3:0}] [L89] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-1:0}] [L67] COND FALSE !(!t) [L70] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-1:0}, t={-1:0}] [L70] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L70] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-1:0}, t={-1:0}] [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-1:0}, t={-1:0}] [L72] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L72] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-1:0}, t={-1:0}] [L72] i = tree_inorder(t->right, a, i) [L73] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-1:0}, t={-1:0}] [L89] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}, x={-3:0}] [L90] EXPR x[0] [L90] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 378 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 1137 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 928 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1377 IncrementalHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 209 mSDtfsCounter, 1377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=4, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 1031 SizeOfPredicates, 10 NumberOfNonLiveVariables, 627 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-15 22:07:48,537 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...