./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:13:13,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:13:13,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:13:13,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:13:13,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:13:13,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:13:13,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:13:13,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:13:13,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:13:13,563 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:13:13,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:13:13,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:13:13,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:13:13,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:13:13,565 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:13:13,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:13:13,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:13:13,566 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:13:13,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:13:13,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:13:13,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:13:13,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:13:13,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:13:13,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:13:13,572 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:13:13,572 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:13:13,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:13:13,573 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:13:13,573 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:13:13,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:13:13,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:13:13,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:13:13,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:13:13,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:13:13,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:13:13,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:13:13,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:13:13,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:13:13,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:13:13,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:13:13,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:13:13,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:13:13,578 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 [2024-10-24 01:13:13,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:13:13,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:13:13,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:13:13,871 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:13:13,872 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:13:13,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2024-10-24 01:13:15,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:13:15,638 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:13:15,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2024-10-24 01:13:15,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac0fcc23/425ac3db265a4b6e86a6284ea237b03a/FLAGedcab83b3 [2024-10-24 01:13:15,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac0fcc23/425ac3db265a4b6e86a6284ea237b03a [2024-10-24 01:13:15,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:13:15,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:13:15,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:13:15,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:13:15,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:13:15,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:13:15" (1/1) ... [2024-10-24 01:13:15,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9e7f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:15, skipping insertion in model container [2024-10-24 01:13:15,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:13:15" (1/1) ... [2024-10-24 01:13:16,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:13:16,220 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2024-10-24 01:13:16,244 WARN L1660 CHandler]: Possible shadowing of function min [2024-10-24 01:13:16,246 WARN L1660 CHandler]: Possible shadowing of function min [2024-10-24 01:13:16,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:13:16,295 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:13:16,310 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2024-10-24 01:13:16,318 WARN L1660 CHandler]: Possible shadowing of function min [2024-10-24 01:13:16,322 WARN L1660 CHandler]: Possible shadowing of function min [2024-10-24 01:13:16,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:13:16,356 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:13:16,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16 WrapperNode [2024-10-24 01:13:16,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:13:16,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:13:16,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:13:16,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:13:16,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (1/1) ... [2024-10-24 01:13:16,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (1/1) ... [2024-10-24 01:13:16,394 INFO L138 Inliner]: procedures = 29, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2024-10-24 01:13:16,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:13:16,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:13:16,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:13:16,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:13:16,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (1/1) ... [2024-10-24 01:13:16,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (1/1) ... [2024-10-24 01:13:16,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (1/1) ... [2024-10-24 01:13:16,433 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 5, 2, 15]. 63 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]. [2024-10-24 01:13:16,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (1/1) ... [2024-10-24 01:13:16,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (1/1) ... [2024-10-24 01:13:16,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (1/1) ... [2024-10-24 01:13:16,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (1/1) ... [2024-10-24 01:13:16,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (1/1) ... [2024-10-24 01:13:16,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (1/1) ... [2024-10-24 01:13:16,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:13:16,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:13:16,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:13:16,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:13:16,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (1/1) ... [2024-10-24 01:13:16,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:13:16,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:13:16,497 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) [2024-10-24 01:13:16,501 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 [2024-10-24 01:13:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:13:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 01:13:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 01:13:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 01:13:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 01:13:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 01:13:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2024-10-24 01:13:16,556 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2024-10-24 01:13:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 01:13:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 01:13:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 01:13:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 01:13:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-10-24 01:13:16,556 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-10-24 01:13:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 01:13:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 01:13:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 01:13:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 01:13:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-24 01:13:16,557 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-24 01:13:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 01:13:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 01:13:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 01:13:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 01:13:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-10-24 01:13:16,558 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-10-24 01:13:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:13:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 01:13:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 01:13:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 01:13:16,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 01:13:16,562 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-10-24 01:13:16,562 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-10-24 01:13:16,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:13:16,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:13:16,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 01:13:16,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 01:13:16,563 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-10-24 01:13:16,563 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-10-24 01:13:16,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 01:13:16,736 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:13:16,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:13:17,102 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-24 01:13:17,103 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:13:17,135 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:13:17,136 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:13:17,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:13:17 BoogieIcfgContainer [2024-10-24 01:13:17,136 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:13:17,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:13:17,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:13:17,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:13:17,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:13:15" (1/3) ... [2024-10-24 01:13:17,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11bc61e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:13:17, skipping insertion in model container [2024-10-24 01:13:17,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:13:16" (2/3) ... [2024-10-24 01:13:17,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11bc61e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:13:17, skipping insertion in model container [2024-10-24 01:13:17,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:13:17" (3/3) ... [2024-10-24 01:13:17,145 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2024-10-24 01:13:17,164 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:13:17,164 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:13:17,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:13:17,236 INFO L333 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, 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;@1e102536, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:13:17,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:13:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 01:13:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 01:13:17,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:13:17,253 INFO L215 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] [2024-10-24 01:13:17,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:13:17,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:13:17,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1984045083, now seen corresponding path program 1 times [2024-10-24 01:13:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:13:17,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133365348] [2024-10-24 01:13:17,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:13:17,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:13:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:17,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:13:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 01:13:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:17,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:13:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:17,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 01:13:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:17,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:13:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:13:17,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:13:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133365348] [2024-10-24 01:13:17,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133365348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:13:17,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:13:17,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:13:17,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090329156] [2024-10-24 01:13:17,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:13:17,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:13:17,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:13:17,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:13:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:13:17,758 INFO L87 Difference]: Start difference. First operand has 79 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:13:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:13:18,207 INFO L93 Difference]: Finished difference Result 138 states and 186 transitions. [2024-10-24 01:13:18,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:13:18,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2024-10-24 01:13:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:13:18,221 INFO L225 Difference]: With dead ends: 138 [2024-10-24 01:13:18,222 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 01:13:18,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:13:18,233 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 71 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:13:18,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 87 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:13:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 01:13:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2024-10-24 01:13:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 01:13:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2024-10-24 01:13:18,279 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 35 [2024-10-24 01:13:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:13:18,280 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2024-10-24 01:13:18,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:13:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2024-10-24 01:13:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 01:13:18,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:13:18,283 INFO L215 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] [2024-10-24 01:13:18,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:13:18,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:13:18,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:13:18,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1289853859, now seen corresponding path program 1 times [2024-10-24 01:13:18,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:13:18,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007292583] [2024-10-24 01:13:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:13:18,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:13:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:18,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:13:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:18,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 01:13:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:18,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:13:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 01:13:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:18,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:13:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:13:18,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:13:18,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007292583] [2024-10-24 01:13:18,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007292583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:13:18,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:13:18,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:13:18,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048741227] [2024-10-24 01:13:18,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:13:18,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:13:18,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:13:18,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:13:18,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:13:18,641 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. 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) [2024-10-24 01:13:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:13:19,181 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2024-10-24 01:13:19,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:13:19,182 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 [2024-10-24 01:13:19,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:13:19,185 INFO L225 Difference]: With dead ends: 138 [2024-10-24 01:13:19,185 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 01:13:19,186 INFO L431 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 [2024-10-24 01:13:19,187 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 109 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:13:19,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 145 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:13:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 01:13:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2024-10-24 01:13:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2024-10-24 01:13:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2024-10-24 01:13:19,206 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 35 [2024-10-24 01:13:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:13:19,206 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2024-10-24 01:13:19,207 INFO L472 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) [2024-10-24 01:13:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2024-10-24 01:13:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 01:13:19,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:13:19,209 INFO L215 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] [2024-10-24 01:13:19,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:13:19,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:13:19,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:13:19,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1627645274, now seen corresponding path program 1 times [2024-10-24 01:13:19,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:13:19,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111796410] [2024-10-24 01:13:19,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:13:19,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:13:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:19,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:13:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:19,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 01:13:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:19,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:13:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:19,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:13:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:19,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 01:13:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 01:13:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:19,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 01:13:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 01:13:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:13:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111796410] [2024-10-24 01:13:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111796410] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:13:19,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718004037] [2024-10-24 01:13:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:13:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:13:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:13:19,733 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) [2024-10-24 01:13:19,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:13:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:19,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 01:13:19,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:13:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 01:13:20,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:13:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 01:13:20,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718004037] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:13:20,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:13:20,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2024-10-24 01:13:20,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150293477] [2024-10-24 01:13:20,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:13:20,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:13:20,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:13:20,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:13:20,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:13:20,211 INFO L87 Difference]: Start difference. First operand 79 states and 102 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) [2024-10-24 01:13:20,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:13:20,812 INFO L93 Difference]: Finished difference Result 144 states and 189 transitions. [2024-10-24 01:13:20,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:13:20,813 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 [2024-10-24 01:13:20,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:13:20,817 INFO L225 Difference]: With dead ends: 144 [2024-10-24 01:13:20,819 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 01:13:20,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:13:20,823 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 73 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:13:20,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 188 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:13:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 01:13:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2024-10-24 01:13:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (27), 22 states have call predecessors, (27), 22 states have call successors, (27) [2024-10-24 01:13:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2024-10-24 01:13:20,848 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 47 [2024-10-24 01:13:20,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:13:20,849 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2024-10-24 01:13:20,849 INFO L472 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) [2024-10-24 01:13:20,849 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2024-10-24 01:13:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 01:13:20,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:13:20,851 INFO L215 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] [2024-10-24 01:13:20,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:13:21,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:13:21,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:13:21,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:13:21,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1568532159, now seen corresponding path program 1 times [2024-10-24 01:13:21,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:13:21,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845465772] [2024-10-24 01:13:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:13:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:13:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:21,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:13:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:21,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:13:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:21,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 01:13:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:21,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 01:13:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:21,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:13:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:21,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:13:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:21,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 01:13:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:21,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:13:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:21,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 01:13:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 01:13:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:13:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845465772] [2024-10-24 01:13:21,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845465772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:13:21,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:13:21,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:13:21,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013222395] [2024-10-24 01:13:21,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:13:21,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:13:21,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:13:21,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:13:21,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:13:21,383 INFO L87 Difference]: Start difference. First operand 81 states and 105 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) [2024-10-24 01:13:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:13:21,946 INFO L93 Difference]: Finished difference Result 144 states and 189 transitions. [2024-10-24 01:13:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:13:21,947 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 [2024-10-24 01:13:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:13:21,948 INFO L225 Difference]: With dead ends: 144 [2024-10-24 01:13:21,948 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 01:13:21,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:13:21,950 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 123 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:13:21,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 217 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:13:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 01:13:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-10-24 01:13:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2024-10-24 01:13:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2024-10-24 01:13:21,965 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 59 [2024-10-24 01:13:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:13:21,965 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2024-10-24 01:13:21,966 INFO L472 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) [2024-10-24 01:13:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2024-10-24 01:13:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 01:13:21,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:13:21,968 INFO L215 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] [2024-10-24 01:13:21,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:13:21,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:13:21,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:13:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2046686025, now seen corresponding path program 1 times [2024-10-24 01:13:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:13:21,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719620113] [2024-10-24 01:13:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:13:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:13:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:13:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:13:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 01:13:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 01:13:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:13:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 01:13:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 01:13:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 01:13:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 01:13:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 01:13:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 01:13:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 01:13:22,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:13:22,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719620113] [2024-10-24 01:13:22,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719620113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:13:22,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229721626] [2024-10-24 01:13:22,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:13:22,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:13:22,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:13:22,510 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) [2024-10-24 01:13:22,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 01:13:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:13:22,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 01:13:22,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:13:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 01:13:22,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:13:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 01:13:23,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229721626] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:13:23,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:13:23,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 19 [2024-10-24 01:13:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370546807] [2024-10-24 01:13:23,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:13:23,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 01:13:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:13:23,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 01:13:23,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-10-24 01:13:23,018 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 15 states have internal predecessors, (54), 8 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2024-10-24 01:13:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:13:23,981 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2024-10-24 01:13:23,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 01:13:23,982 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 15 states have internal predecessors, (54), 8 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) Word has length 72 [2024-10-24 01:13:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:13:23,985 INFO L225 Difference]: With dead ends: 138 [2024-10-24 01:13:23,985 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 01:13:23,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 01:13:23,991 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 104 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:13:23,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 344 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:13:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 01:13:24,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-10-24 01:13:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 22 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (30), 22 states have call predecessors, (30), 22 states have call successors, (30) [2024-10-24 01:13:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2024-10-24 01:13:24,010 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 72 [2024-10-24 01:13:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:13:24,011 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2024-10-24 01:13:24,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 15 states have internal predecessors, (54), 8 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2024-10-24 01:13:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2024-10-24 01:13:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 01:13:24,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:13:24,018 INFO L215 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] [2024-10-24 01:13:24,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 01:13:24,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:13:24,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:13:24,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:13:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1573299318, now seen corresponding path program 1 times [2024-10-24 01:13:24,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:13:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56770409] [2024-10-24 01:13:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:13:24,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:13:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 01:13:24,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 01:13:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 01:13:24,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 01:13:24,330 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 01:13:24,332 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 01:13:24,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:13:24,339 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 01:13:24,401 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 01:13:24,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:13:24 BoogieIcfgContainer [2024-10-24 01:13:24,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 01:13:24,405 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 01:13:24,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 01:13:24,405 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 01:13:24,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:13:17" (3/4) ... [2024-10-24 01:13:24,410 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 01:13:24,461 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 01:13:24,461 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 01:13:24,462 INFO L158 Benchmark]: Toolchain (without parser) took 8477.54ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 104.6MB in the beginning and 138.2MB in the end (delta: -33.7MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-10-24 01:13:24,462 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 01:13:24,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.46ms. Allocated memory is still 155.2MB. Free memory was 104.6MB in the beginning and 90.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 01:13:24,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.43ms. Allocated memory is still 155.2MB. Free memory was 90.5MB in the beginning and 89.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 01:13:24,462 INFO L158 Benchmark]: Boogie Preprocessor took 60.62ms. Allocated memory is still 155.2MB. Free memory was 89.1MB in the beginning and 85.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 01:13:24,463 INFO L158 Benchmark]: RCFGBuilder took 676.81ms. Allocated memory is still 155.2MB. Free memory was 85.7MB in the beginning and 60.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 01:13:24,463 INFO L158 Benchmark]: TraceAbstraction took 7266.05ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 59.9MB in the beginning and 142.4MB in the end (delta: -82.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 01:13:24,463 INFO L158 Benchmark]: Witness Printer took 56.29ms. Allocated memory is still 211.8MB. Free memory was 142.4MB in the beginning and 138.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 01:13:24,464 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.19ms. Allocated memory is still 155.2MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.46ms. Allocated memory is still 155.2MB. Free memory was 104.6MB in the beginning and 90.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.43ms. Allocated memory is still 155.2MB. Free memory was 90.5MB in the beginning and 89.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.62ms. Allocated memory is still 155.2MB. Free memory was 89.1MB in the beginning and 85.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 676.81ms. Allocated memory is still 155.2MB. Free memory was 85.7MB in the beginning and 60.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7266.05ms. Allocated memory was 155.2MB in the beginning and 211.8MB in the end (delta: 56.6MB). Free memory was 59.9MB in the beginning and 142.4MB in the end (delta: -82.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 56.29ms. Allocated memory is still 211.8MB. Free memory was 142.4MB in the beginning and 138.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L98] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-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}] [L98] RET, EXPR nondet_tree() [L98] CALL task(nondet_tree()) [L76] CALL, EXPR min(t) VAL [\old(n)={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [\old(n)={-1:0}, n={-1:0}] [L40] CALL, EXPR min(n->left) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L40] RET, EXPR min(n->left) VAL [\old(n)={-1:0}, n={-1:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [\old(n)={-1:0}, a=2147483647] [L41] CALL, EXPR min(n->right) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L41] RET, EXPR min(n->right) VAL [\old(n)={-1:0}, a=2147483647] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\old(n)={-1:0}, \result=2147483647] [L76] RET, EXPR min(t) VAL [t={-1:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={5:0}, t={-1:0}] [L79] CALL, EXPR size(t) VAL [\old(t)={-1:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [\old(t)={-1:0}, t={-1:0}] [L72] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\old(t)={0:0}, \result=0] [L72] RET, EXPR size(t->left) VAL [\old(t)={-1:0}, t={-1:0}] [L72] EXPR t->right VAL [\old(t)={-1:0}] [L72] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\old(t)={0:0}, \result=0] [L72] RET, EXPR size(t->right) VAL [\old(t)={-1:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) [L80] RET assume_abort_if_not(n != 0) [L81] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}] [L81] int *x = calloc(n, sizeof(int)); [L82] CALL tree_inorder(t, x, n) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=1, t={-1:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-3:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=1, t={-1:0}] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] EXPR t->right VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=2] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-3:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=2] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, \result=2, a={-3:0}, i=2] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-3:0}] [L83] EXPR x[0] [L83] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0] [L16] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 516 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 480 mSDsluCounter, 981 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 778 mSDsCounter, 382 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2348 IncrementalHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 382 mSolverCounterUnsat, 203 mSDtfsCounter, 2348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=5, InterpolantAutomatonStates: 55, 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, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 1340 SizeOfPredicates, 6 NumberOfNonLiveVariables, 627 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 156/168 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! [2024-10-24 01:13:24,490 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE