/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_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 05:23:38,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 05:23:38,902 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-21 05:23:38,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 05:23:38,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 05:23:38,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 05:23:38,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 05:23:38,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 05:23:38,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 05:23:38,930 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 05:23:38,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 05:23:38,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 05:23:38,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 05:23:38,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 05:23:38,932 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 05:23:38,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 05:23:38,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 05:23:38,933 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 05:23:38,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 05:23:38,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 05:23:38,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 05:23:38,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 05:23:38,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 05:23:38,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 05:23:38,935 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 05:23:38,935 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 05:23:38,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 05:23:38,935 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 05:23:38,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 05:23:38,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 05:23:38,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 05:23:38,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 05:23:38,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 05:23:38,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 05:23:38,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 05:23:38,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 05:23:38,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 05:23:38,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 05:23:38,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 05:23:38,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 05:23:38,938 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 05:23:38,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 05:23:38,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 05:23:38,938 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-21 05:23:39,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 05:23:39,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 05:23:39,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 05:23:39,106 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 05:23:39,107 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 05:23:39,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2023-12-21 05:23:40,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 05:23:40,329 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 05:23:40,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2023-12-21 05:23:40,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2e9e331/d294f467602d44db8dae88d21e08c1ad/FLAG9f8cff73c [2023-12-21 05:23:40,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2e9e331/d294f467602d44db8dae88d21e08c1ad [2023-12-21 05:23:40,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 05:23:40,355 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 05:23:40,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 05:23:40,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 05:23:40,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 05:23:40,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1880d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40, skipping insertion in model container [2023-12-21 05:23:40,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,374 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 05:23:40,464 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.c[586,599] [2023-12-21 05:23:40,476 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-21 05:23:40,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 05:23:40,491 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 05:23:40,500 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.c[586,599] [2023-12-21 05:23:40,514 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-21 05:23:40,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 05:23:40,544 INFO L206 MainTranslator]: Completed translation [2023-12-21 05:23:40,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40 WrapperNode [2023-12-21 05:23:40,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 05:23:40,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 05:23:40,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 05:23:40,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 05:23:40,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,583 INFO L138 Inliner]: procedures = 29, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112 [2023-12-21 05:23:40,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 05:23:40,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 05:23:40,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 05:23:40,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 05:23:40,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,634 INFO L175 MemorySlicer]: Split 28 memory accesses to 4 slices as follows [2, 2, 5, 19]. 68 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, 1, 2, 4]. [2023-12-21 05:23:40,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 05:23:40,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 05:23:40,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 05:23:40,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 05:23:40,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (1/1) ... [2023-12-21 05:23:40,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 05:23:40,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:23:40,683 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-21 05:23:40,709 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-21 05:23:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 05:23:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 05:23:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-21 05:23:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-21 05:23:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-21 05:23:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-21 05:23:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 05:23:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 05:23:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 05:23:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 05:23:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-12-21 05:23:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-12-21 05:23:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 05:23:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 05:23:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 05:23:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 05:23:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-12-21 05:23:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-12-21 05:23:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-21 05:23:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-21 05:23:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-21 05:23:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-21 05:23:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-12-21 05:23:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-12-21 05:23:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 05:23:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 05:23:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 05:23:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 05:23:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 05:23:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-12-21 05:23:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-12-21 05:23:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 05:23:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 05:23:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-21 05:23:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-21 05:23:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-12-21 05:23:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-12-21 05:23:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 05:23:40,837 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 05:23:40,838 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 05:23:41,079 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 05:23:41,097 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 05:23:41,097 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 05:23:41,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:23:41 BoogieIcfgContainer [2023-12-21 05:23:41,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 05:23:41,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 05:23:41,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 05:23:41,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 05:23:41,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:23:40" (1/3) ... [2023-12-21 05:23:41,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d78593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:23:41, skipping insertion in model container [2023-12-21 05:23:41,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:23:40" (2/3) ... [2023-12-21 05:23:41,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d78593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:23:41, skipping insertion in model container [2023-12-21 05:23:41,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:23:41" (3/3) ... [2023-12-21 05:23:41,107 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2023-12-21 05:23:41,119 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 05:23:41,119 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 05:23:41,159 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 05:23:41,167 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;@46b749c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 05:23:41,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 05:23:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 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-21 05:23:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 05:23:41,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:23:41,182 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-21 05:23:41,182 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:23:41,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:23:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash -813364378, now seen corresponding path program 1 times [2023-12-21 05:23:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:23:41,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364005483] [2023-12-21 05:23:41,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:23:41,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:23:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:41,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 05:23:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:41,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 05:23:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:41,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 05:23:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:41,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-21 05:23:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:41,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 05:23:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:41,649 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-21 05:23:41,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:23:41,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364005483] [2023-12-21 05:23:41,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364005483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:23:41,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 05:23:41,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 05:23:41,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772961715] [2023-12-21 05:23:41,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:23:41,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 05:23:41,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:23:41,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 05:23:41,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-21 05:23:41,682 INFO L87 Difference]: Start difference. First operand has 77 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 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-21 05:23:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:23:42,049 INFO L93 Difference]: Finished difference Result 137 states and 196 transitions. [2023-12-21 05:23:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 05:23:42,051 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-21 05:23:42,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:23:42,061 INFO L225 Difference]: With dead ends: 137 [2023-12-21 05:23:42,061 INFO L226 Difference]: Without dead ends: 81 [2023-12-21 05:23:42,065 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-21 05:23:42,068 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 105 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 05:23:42,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 171 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 05:23:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-21 05:23:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-12-21 05:23:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 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-21 05:23:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2023-12-21 05:23:42,105 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 35 [2023-12-21 05:23:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:23:42,105 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2023-12-21 05:23:42,105 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-21 05:23:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2023-12-21 05:23:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-21 05:23:42,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:23:42,107 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-21 05:23:42,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 05:23:42,107 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:23:42,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:23:42,108 INFO L85 PathProgramCache]: Analyzing trace with hash -916736927, now seen corresponding path program 1 times [2023-12-21 05:23:42,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:23:42,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749789056] [2023-12-21 05:23:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:23:42,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:23:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:42,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 05:23:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:42,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 05:23:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:42,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 05:23:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:42,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 05:23:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:42,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 05:23:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:42,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-21 05:23:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:42,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 05:23:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:42,425 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-21 05:23:42,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:23:42,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749789056] [2023-12-21 05:23:42,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749789056] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 05:23:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473867015] [2023-12-21 05:23:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:23:42,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:23:42,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:23:42,429 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-21 05:23:42,460 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-21 05:23:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:42,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-21 05:23:42,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:23:42,662 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-21 05:23:42,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:23:42,792 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-21 05:23:42,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473867015] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:23:42,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 05:23:42,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 11 [2023-12-21 05:23:42,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22879560] [2023-12-21 05:23:42,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 05:23:42,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 05:23:42,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:23:42,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 05:23:42,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-21 05:23:42,795 INFO L87 Difference]: Start difference. First operand 76 states and 100 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-21 05:23:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:23:43,191 INFO L93 Difference]: Finished difference Result 137 states and 183 transitions. [2023-12-21 05:23:43,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 05:23:43,192 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-21 05:23:43,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:23:43,195 INFO L225 Difference]: With dead ends: 137 [2023-12-21 05:23:43,196 INFO L226 Difference]: Without dead ends: 81 [2023-12-21 05:23:43,198 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-21 05:23:43,200 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 107 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 05:23:43,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 219 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 05:23:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-21 05:23:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2023-12-21 05:23:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 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-21 05:23:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2023-12-21 05:23:43,221 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 47 [2023-12-21 05:23:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:23:43,221 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2023-12-21 05:23:43,222 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-21 05:23:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2023-12-21 05:23:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 05:23:43,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:23:43,228 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-21 05:23:43,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 05:23:43,433 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-21 05:23:43,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:23:43,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:23:43,435 INFO L85 PathProgramCache]: Analyzing trace with hash 933921012, now seen corresponding path program 1 times [2023-12-21 05:23:43,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:23:43,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931558464] [2023-12-21 05:23:43,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:23:43,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:23:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:43,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 05:23:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 05:23:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:43,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 05:23:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:43,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 05:23:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:43,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-21 05:23:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:43,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 05:23:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:43,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 05:23:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-21 05:23:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:43,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-21 05:23:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:43,648 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-21 05:23:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:23:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931558464] [2023-12-21 05:23:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931558464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:23:43,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 05:23:43,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 05:23:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11934317] [2023-12-21 05:23:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:23:43,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 05:23:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:23:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 05:23:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-21 05:23:43,650 INFO L87 Difference]: Start difference. First operand 78 states and 103 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-21 05:23:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:23:44,024 INFO L93 Difference]: Finished difference Result 137 states and 183 transitions. [2023-12-21 05:23:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 05:23:44,025 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-21 05:23:44,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:23:44,026 INFO L225 Difference]: With dead ends: 137 [2023-12-21 05:23:44,026 INFO L226 Difference]: Without dead ends: 83 [2023-12-21 05:23:44,026 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-21 05:23:44,027 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 121 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 05:23:44,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 226 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 05:23:44,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-21 05:23:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2023-12-21 05:23:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.18) internal successors, (59), 53 states have internal predecessors, (59), 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-21 05:23:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 106 transitions. [2023-12-21 05:23:44,035 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 106 transitions. Word has length 59 [2023-12-21 05:23:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:23:44,035 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 106 transitions. [2023-12-21 05:23:44,035 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-21 05:23:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2023-12-21 05:23:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 05:23:44,036 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:23:44,036 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-21 05:23:44,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 05:23:44,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:23:44,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:23:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash -749122468, now seen corresponding path program 1 times [2023-12-21 05:23:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:23:44,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970277171] [2023-12-21 05:23:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:23:44,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:23:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 05:23:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 05:23:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 05:23:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 05:23:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 05:23:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 05:23:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 05:23:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 05:23:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 05:23:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-21 05:23:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 05:23:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,313 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-21 05:23:44,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:23:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970277171] [2023-12-21 05:23:44,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970277171] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 05:23:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123333865] [2023-12-21 05:23:44,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:23:44,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:23:44,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:23:44,329 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-21 05:23:44,360 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-21 05:23:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:23:44,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 05:23:44,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:23:44,523 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-21 05:23:44,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 05:23:44,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123333865] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:23:44,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 05:23:44,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 17 [2023-12-21 05:23:44,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977876860] [2023-12-21 05:23:44,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:23:44,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 05:23:44,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:23:44,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 05:23:44,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2023-12-21 05:23:44,525 INFO L87 Difference]: Start difference. First operand 80 states and 106 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-21 05:23:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:23:44,611 INFO L93 Difference]: Finished difference Result 128 states and 170 transitions. [2023-12-21 05:23:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 05:23:44,612 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-21 05:23:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:23:44,615 INFO L225 Difference]: With dead ends: 128 [2023-12-21 05:23:44,615 INFO L226 Difference]: Without dead ends: 82 [2023-12-21 05:23:44,615 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-21 05:23:44,617 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 44 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 512 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-21 05:23:44,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 512 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 05:23:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-21 05:23:44,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-12-21 05:23:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 55 states have internal predecessors, (60), 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-21 05:23:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2023-12-21 05:23:44,637 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 72 [2023-12-21 05:23:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:23:44,637 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2023-12-21 05:23:44,637 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-21 05:23:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2023-12-21 05:23:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-21 05:23:44,639 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:23:44,639 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-21 05:23:44,646 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-21 05:23:44,847 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-21 05:23:44,847 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:23:44,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:23:44,848 INFO L85 PathProgramCache]: Analyzing trace with hash -250240353, now seen corresponding path program 1 times [2023-12-21 05:23:44,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:23:44,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956264353] [2023-12-21 05:23:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:23:44,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:23:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 05:23:44,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 05:23:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 05:23:44,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 05:23:44,937 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 05:23:44,938 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 05:23:44,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 05:23:44,941 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-21 05:23:44,943 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 05:23:44,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 05:23:44 BoogieIcfgContainer [2023-12-21 05:23:44,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 05:23:44,990 INFO L158 Benchmark]: Toolchain (without parser) took 4634.67ms. Allocated memory was 224.4MB in the beginning and 269.5MB in the end (delta: 45.1MB). Free memory was 183.6MB in the beginning and 79.4MB in the end (delta: 104.2MB). Peak memory consumption was 150.4MB. Max. memory is 8.0GB. [2023-12-21 05:23:44,991 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory was 121.9MB in the beginning and 121.7MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 05:23:44,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.14ms. Allocated memory is still 224.4MB. Free memory was 183.1MB in the beginning and 170.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 05:23:44,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.78ms. Allocated memory is still 224.4MB. Free memory was 170.5MB in the beginning and 168.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 05:23:44,992 INFO L158 Benchmark]: Boogie Preprocessor took 64.53ms. Allocated memory is still 224.4MB. Free memory was 168.9MB in the beginning and 165.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 05:23:44,992 INFO L158 Benchmark]: RCFGBuilder took 448.57ms. Allocated memory is still 224.4MB. Free memory was 165.3MB in the beginning and 141.2MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-21 05:23:44,992 INFO L158 Benchmark]: TraceAbstraction took 3890.16ms. Allocated memory was 224.4MB in the beginning and 269.5MB in the end (delta: 45.1MB). Free memory was 140.6MB in the beginning and 79.4MB in the end (delta: 61.3MB). Peak memory consumption was 107.4MB. Max. memory is 8.0GB. [2023-12-21 05:23:44,994 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 175.1MB. Free memory was 121.9MB in the beginning and 121.7MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.14ms. Allocated memory is still 224.4MB. Free memory was 183.1MB in the beginning and 170.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.78ms. Allocated memory is still 224.4MB. Free memory was 170.5MB in the beginning and 168.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.53ms. Allocated memory is still 224.4MB. Free memory was 168.9MB in the beginning and 165.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 448.57ms. Allocated memory is still 224.4MB. Free memory was 165.3MB in the beginning and 141.2MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3890.16ms. Allocated memory was 224.4MB in the beginning and 269.5MB in the end (delta: 45.1MB). Free memory was 140.6MB in the beginning and 79.4MB in the end (delta: 61.3MB). Peak memory consumption was 107.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L110] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}] [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}] [L110] RET, EXPR nondet_tree() [L110] CALL task(nondet_tree()) [L86] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}] [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}] [L86] RET, EXPR min(t) VAL [t={-1:0}, t={-1:0}] [L86] int a = min(t); [L87] int b; VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L89] CALL, EXPR size(t) VAL [t={-1:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [t={-1:0}, t={-1:0}] [L82] CALL, EXPR size(t->left) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->left) VAL [t={-1:0}, t={-1:0}] [L82] EXPR t->right VAL [t={-1:0}, t={-1:0}] [L82] CALL, EXPR size(t->right) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->right) VAL [t={-1:0}, t={-1:0}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}] [L91] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L92] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L73] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L75] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L92] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L93] EXPR x[0] [L93] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 395 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 377 mSDsluCounter, 1128 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 916 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1357 IncrementalHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 212 mSDtfsCounter, 1357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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.4s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 1019 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-21 05:23:45,028 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...