./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/verifythis/tree_del_rec.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 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:29:01,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:29:01,423 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:29:01,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:29:01,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:29:01,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:29:01,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:29:01,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:29:01,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:29:01,472 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:29:01,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:29:01,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:29:01,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:29:01,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:29:01,476 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:29:01,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:29:01,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:29:01,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:29:01,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:29:01,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:29:01,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:29:01,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:29:01,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:29:01,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:29:01,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:29:01,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:29:01,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:29:01,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:29:01,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:29:01,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:29:01,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:29:01,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:29:01,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:29:01,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:29:01,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:29:01,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:29:01,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:29:01,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:29:01,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:29:01,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:29:01,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:29:01,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:29:01,488 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 -> 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 [2024-11-09 23:29:01,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:29:01,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:29:01,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:29:01,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:29:01,804 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:29:01,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec.c [2024-11-09 23:29:03,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:29:03,433 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:29:03,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec.c [2024-11-09 23:29:03,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96cdc58a/b6ffe817d4be4aa4b1aca9ae2f609b4c/FLAG066fa64c4 [2024-11-09 23:29:03,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96cdc58a/b6ffe817d4be4aa4b1aca9ae2f609b4c [2024-11-09 23:29:03,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:29:03,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:29:03,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:29:03,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:29:03,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:29:03,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68c73cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03, skipping insertion in model container [2024-11-09 23:29:03,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:29:03,650 WARN L250 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.c[585,598] [2024-11-09 23:29:03,664 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-09 23:29:03,666 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-09 23:29:03,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:29:03,690 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:29:03,703 WARN L250 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.c[585,598] [2024-11-09 23:29:03,708 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-09 23:29:03,709 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-09 23:29:03,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:29:03,754 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:29:03,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03 WrapperNode [2024-11-09 23:29:03,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:29:03,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:29:03,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:29:03,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:29:03,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,801 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-11-09 23:29:03,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:29:03,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:29:03,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:29:03,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:29:03,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,819 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,840 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 5, 2, 16]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 7 writes are split as follows [0, 2, 1, 4]. [2024-11-09 23:29:03,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:29:03,878 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:29:03,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:29:03,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:29:03,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (1/1) ... [2024-11-09 23:29:03,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:29:03,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:29:03,921 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-11-09 23:29:03,927 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-11-09 23:29:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:29:03,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 23:29:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 23:29:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 23:29:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 23:29:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 23:29:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2024-11-09 23:29:03,984 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2024-11-09 23:29:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 23:29:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 23:29:03,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 23:29:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 23:29:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-11-09 23:29:03,985 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-11-09 23:29:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 23:29:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 23:29:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 23:29:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 23:29:03,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-09 23:29:03,985 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-09 23:29:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 23:29:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 23:29:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 23:29:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 23:29:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-09 23:29:03,986 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-09 23:29:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:29:03,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 23:29:03,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 23:29:03,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 23:29:03,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 23:29:03,987 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-11-09 23:29:03,989 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-11-09 23:29:03,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:29:03,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:29:03,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 23:29:03,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 23:29:03,990 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-11-09 23:29:03,990 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-11-09 23:29:03,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 23:29:04,162 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:29:04,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:29:04,292 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L39: havoc ~a~0, ~b~0, ~c~0; [2024-11-09 23:29:04,321 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: havoc ~n~0.base, ~n~0.offset; [2024-11-09 23:29:04,504 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-09 23:29:04,504 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:29:04,525 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:29:04,526 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:29:04,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:29:04 BoogieIcfgContainer [2024-11-09 23:29:04,527 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:29:04,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:29:04,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:29:04,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:29:04,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:29:03" (1/3) ... [2024-11-09 23:29:04,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bfa5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:29:04, skipping insertion in model container [2024-11-09 23:29:04,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:03" (2/3) ... [2024-11-09 23:29:04,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bfa5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:29:04, skipping insertion in model container [2024-11-09 23:29:04,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:29:04" (3/3) ... [2024-11-09 23:29:04,536 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2024-11-09 23:29:04,550 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:29:04,550 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:29:04,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:29:04,610 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;@1d9c56fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:29:04,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:29:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 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-11-09 23:29:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 23:29:04,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:29:04,624 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, 1, 1] [2024-11-09 23:29:04,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:29:04,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:29:04,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2119770980, now seen corresponding path program 1 times [2024-11-09 23:29:04,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:29:04,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684487247] [2024-11-09 23:29:04,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:29:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:05,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:05,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:05,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 23:29:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:05,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 23:29:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:05,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 23:29:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:29:05,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:29:05,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684487247] [2024-11-09 23:29:05,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684487247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:29:05,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:29:05,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:29:05,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741221885] [2024-11-09 23:29:05,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:29:05,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:29:05,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:29:05,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:29:05,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:29:05,339 INFO L87 Difference]: Start difference. First operand has 89 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 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-11-09 23:29:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:29:05,966 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2024-11-09 23:29:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:29:05,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 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 37 [2024-11-09 23:29:05,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:29:05,981 INFO L225 Difference]: With dead ends: 157 [2024-11-09 23:29:05,982 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 23:29:05,987 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-11-09 23:29:05,991 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 78 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:29:05,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 224 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:29:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 23:29:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2024-11-09 23:29:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 53 states have internal predecessors, (60), 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-11-09 23:29:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2024-11-09 23:29:06,064 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 37 [2024-11-09 23:29:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:29:06,067 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2024-11-09 23:29:06,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 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-11-09 23:29:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2024-11-09 23:29:06,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 23:29:06,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:29:06,072 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, 1, 1] [2024-11-09 23:29:06,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:29:06,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:29:06,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:29:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash -491854847, now seen corresponding path program 1 times [2024-11-09 23:29:06,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:29:06,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667215690] [2024-11-09 23:29:06,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:06,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:29:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 23:29:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 23:29:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 23:29:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 23:29:06,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:29:06,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667215690] [2024-11-09 23:29:06,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667215690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:29:06,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246520174] [2024-11-09 23:29:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:06,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:29:06,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:29:06,508 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-11-09 23:29:06,509 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-11-09 23:29:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 23:29:06,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:29:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 23:29:06,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:29:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 23:29:07,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246520174] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:29:07,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:29:07,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2024-11-09 23:29:07,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820477178] [2024-11-09 23:29:07,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:29:07,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:29:07,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:29:07,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:29:07,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:29:07,079 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 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-11-09 23:29:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:29:07,821 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2024-11-09 23:29:07,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:29:07,822 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 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 49 [2024-11-09 23:29:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:29:07,824 INFO L225 Difference]: With dead ends: 150 [2024-11-09 23:29:07,824 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 23:29:07,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 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-11-09 23:29:07,826 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 114 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 23:29:07,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 310 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 23:29:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 23:29:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-09 23:29:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.150943396226415) internal successors, (61), 55 states have internal predecessors, (61), 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-11-09 23:29:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2024-11-09 23:29:07,844 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 49 [2024-11-09 23:29:07,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:29:07,844 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2024-11-09 23:29:07,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 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-11-09 23:29:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2024-11-09 23:29:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 23:29:07,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:29:07,847 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, 1, 1] [2024-11-09 23:29:07,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 23:29:08,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:29:08,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:29:08,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:29:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash -609591335, now seen corresponding path program 1 times [2024-11-09 23:29:08,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:29:08,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399798608] [2024-11-09 23:29:08,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:08,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:29:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 23:29:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 23:29:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 23:29:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 23:29:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 23:29:08,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:29:08,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399798608] [2024-11-09 23:29:08,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399798608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:29:08,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:29:08,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 23:29:08,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676994160] [2024-11-09 23:29:08,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:29:08,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:29:08,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:29:08,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:29:08,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:29:08,312 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 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-11-09 23:29:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:29:08,822 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2024-11-09 23:29:08,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:29:08,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 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 61 [2024-11-09 23:29:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:29:08,825 INFO L225 Difference]: With dead ends: 150 [2024-11-09 23:29:08,825 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 23:29:08,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:29:08,827 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 131 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:29:08,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 241 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:29:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 23:29:08,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-09 23:29:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 57 states have internal predecessors, (62), 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-11-09 23:29:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2024-11-09 23:29:08,841 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 61 [2024-11-09 23:29:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:29:08,842 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2024-11-09 23:29:08,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 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-11-09 23:29:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2024-11-09 23:29:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 23:29:08,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:29:08,845 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, 1, 1] [2024-11-09 23:29:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:29:08,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:29:08,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:29:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash -218336205, now seen corresponding path program 1 times [2024-11-09 23:29:08,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:29:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491141430] [2024-11-09 23:29:08,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:29:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 23:29:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 23:29:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 23:29:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:29:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 23:29:09,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:29:09,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491141430] [2024-11-09 23:29:09,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491141430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:29:09,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:29:09,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 23:29:09,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874132223] [2024-11-09 23:29:09,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:29:09,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:29:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:29:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:29:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:29:09,128 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:29:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:29:09,629 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2024-11-09 23:29:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:29:09,629 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 5 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 74 [2024-11-09 23:29:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:29:09,631 INFO L225 Difference]: With dead ends: 142 [2024-11-09 23:29:09,631 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 23:29:09,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:29:09,633 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 123 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:29:09,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 239 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:29:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 23:29:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-09 23:29:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 59 states have internal predecessors, (63), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (31), 22 states have call predecessors, (31), 22 states have call successors, (31) [2024-11-09 23:29:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2024-11-09 23:29:09,652 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 74 [2024-11-09 23:29:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:29:09,653 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2024-11-09 23:29:09,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:29:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2024-11-09 23:29:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 23:29:09,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:29:09,656 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, 1, 1] [2024-11-09 23:29:09,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:29:09,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:29:09,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:29:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1082238154, now seen corresponding path program 1 times [2024-11-09 23:29:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:29:09,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969394417] [2024-11-09 23:29:09,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:29:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:29:09,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 23:29:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:29:09,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 23:29:09,772 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 23:29:09,773 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:29:09,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:29:09,778 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 23:29:09,834 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:29:09,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:29:09 BoogieIcfgContainer [2024-11-09 23:29:09,840 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:29:09,841 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:29:09,841 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:29:09,841 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:29:09,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:29:04" (3/4) ... [2024-11-09 23:29:09,842 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 23:29:09,909 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:29:09,909 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:29:09,910 INFO L158 Benchmark]: Toolchain (without parser) took 6448.31ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 120.8MB in the beginning and 197.7MB in the end (delta: -76.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:29:09,910 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 176.2MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:29:09,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.70ms. Allocated memory is still 176.2MB. Free memory was 120.8MB in the beginning and 106.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 23:29:09,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.34ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 104.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:29:09,910 INFO L158 Benchmark]: Boogie Preprocessor took 73.76ms. Allocated memory is still 176.2MB. Free memory was 104.8MB in the beginning and 101.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 23:29:09,910 INFO L158 Benchmark]: IcfgBuilder took 648.56ms. Allocated memory is still 176.2MB. Free memory was 101.3MB in the beginning and 76.8MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 23:29:09,911 INFO L158 Benchmark]: TraceAbstraction took 5311.73ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 76.1MB in the beginning and 200.9MB in the end (delta: -124.8MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2024-11-09 23:29:09,911 INFO L158 Benchmark]: Witness Printer took 68.12ms. Allocated memory is still 243.3MB. Free memory was 200.9MB in the beginning and 197.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:29:09,912 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.29ms. Allocated memory is still 176.2MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.70ms. Allocated memory is still 176.2MB. Free memory was 120.8MB in the beginning and 106.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.34ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 104.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.76ms. Allocated memory is still 176.2MB. Free memory was 104.8MB in the beginning and 101.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 648.56ms. Allocated memory is still 176.2MB. Free memory was 101.3MB in the beginning and 76.8MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5311.73ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 76.1MB in the beginning and 200.9MB in the end (delta: -124.8MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. * Witness Printer took 68.12ms. Allocated memory is still 243.3MB. Free memory was 200.9MB in the beginning and 197.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: [L102] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-1:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}] [L102] RET, EXPR nondet_tree() [L102] CALL task(nondet_tree()) [L78] CALL, EXPR min(t) VAL [\old(n)={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [\old(n)={-1:0}, a=2147483647, n={-1:0}] [L41] CALL, EXPR min(n->left) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L41] RET, EXPR min(n->left) VAL [\old(n)={-1:0}, a=2147483647, n={-1:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [\old(n)={-1:0}, a=2147483647, b=2147483647] [L42] CALL, EXPR min(n->right) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L42] RET, EXPR min(n->right) VAL [\old(n)={-1:0}, a=2147483647, b=2147483647] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\old(n)={-1:0}, \result=2147483647] [L78] RET, EXPR min(t) VAL [t={-1:0}] [L78] int a = min(t); [L79] int b; VAL [a=2147483647, b={5:0}, t={-1:0}] [L81] CALL, EXPR size(t) VAL [\old(t)={-1:0}] [L73] COND FALSE !(!t) [L74] EXPR t->left VAL [\old(t)={-1:0}, t={-1:0}] [L74] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\old(t)={0:0}, \result=0] [L74] RET, EXPR size(t->left) VAL [\old(t)={-1:0}, t={-1:0}] [L74] EXPR t->right VAL [\old(t)={-1:0}] [L74] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\old(t)={0:0}, \result=0] [L74] RET, EXPR size(t->right) VAL [\old(t)={-1:0}] [L74] return size(t->left) + size(t->right) + 1; [L81] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}] [L81] int n = size(t); [L82] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L82] RET assume_cycle_if_not(n != 0) [L83] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}] [L83] int *x = calloc(n, sizeof(int)); [L84] CALL tree_inorder(t, x, n) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}] [L62] COND FALSE !(!t) [L65] EXPR t->left VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=1, t={-1:0}] [L65] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-2:0}] [L65] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=1, t={-1:0}] [L65] i = tree_inorder(t->left, a, i) [L66] EXPR i++ [L66] EXPR t->data [L66] a[i++] = t->data [L67] EXPR t->right VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=2] [L67] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-2:0}] [L67] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=2] [L67] i = tree_inorder(t->right, a, i) [L68] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, \result=2, a={-2:0}, i=2] [L84] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-2:0}] [L85] EXPR x[0] [L85] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0] [L16] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 485 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 446 mSDsluCounter, 1014 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 832 mSDsCounter, 331 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2156 IncrementalHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 331 mSolverCounterUnsat, 182 mSDtfsCounter, 2156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, InterpolantAutomatonStates: 42, 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, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 864 SizeOfPredicates, 2 NumberOfNonLiveVariables, 242 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 90/96 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-11-09 23:29:09,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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