./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_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:30:12,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:30:12,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:30:12,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:30:12,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:30:12,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:30:12,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:30:12,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:30:12,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:30:12,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:30:12,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:30:12,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:30:12,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:30:12,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:30:12,702 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:30:12,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:30:12,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:30:12,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:30:12,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:30:12,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:30:12,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:30:12,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:30:12,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:30:12,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:30:12,706 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:30:12,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:30:12,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:30:12,707 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:30:12,707 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:30:12,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:30:12,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:30:12,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:30:12,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:30:12,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:30:12,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:30:12,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:30:12,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:30:12,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:30:12,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:30:12,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:30:12,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:30:12,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:30:12,712 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-clean/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-clean/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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2024-10-11 02:30:12,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:30:13,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:30:13,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:30:13,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:30:13,006 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:30:13,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c [2024-10-11 02:30:14,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:30:14,672 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:30:14,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c [2024-10-11 02:30:14,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/38537823b/aad0cfa8454c42499b9dbb5e226e4526/FLAG92a1621b1 [2024-10-11 02:30:14,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/38537823b/aad0cfa8454c42499b9dbb5e226e4526 [2024-10-11 02:30:14,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:30:14,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:30:14,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:30:14,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:30:14,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:30:14,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:14,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db6685d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14, skipping insertion in model container [2024-10-11 02:30:14,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:14,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:30:14,886 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_iter.c[586,599] [2024-10-11 02:30:14,905 WARN L1659 CHandler]: Possible shadowing of function min [2024-10-11 02:30:14,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:30:14,933 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:30:14,943 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_iter.c[586,599] [2024-10-11 02:30:14,951 WARN L1659 CHandler]: Possible shadowing of function min [2024-10-11 02:30:14,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:30:14,977 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:30:14,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14 WrapperNode [2024-10-11 02:30:14,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:30:14,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:30:14,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:30:14,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:30:14,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:14,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:15,014 INFO L138 Inliner]: procedures = 29, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2024-10-11 02:30:15,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:30:15,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:30:15,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:30:15,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:30:15,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:15,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:15,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:15,063 INFO L175 MemorySlicer]: Split 28 memory accesses to 4 slices as follows [2, 19, 2, 5]. 68 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 7 writes are split as follows [0, 4, 1, 2]. [2024-10-11 02:30:15,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:15,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:15,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:15,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:15,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:15,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:15,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:30:15,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:30:15,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:30:15,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:30:15,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (1/1) ... [2024-10-11 02:30:15,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:30:15,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:30:15,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:30:15,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:30:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:30:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 02:30:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 02:30:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 02:30:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 02:30:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 02:30:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 02:30:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 02:30:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 02:30:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 02:30:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-10-11 02:30:15,199 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-10-11 02:30:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 02:30:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 02:30:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 02:30:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 02:30:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-11 02:30:15,200 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-11 02:30:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 02:30:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 02:30:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 02:30:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 02:30:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-10-11 02:30:15,201 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-10-11 02:30:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:30:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:30:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:30:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:30:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 02:30:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-10-11 02:30:15,201 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-10-11 02:30:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:30:15,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:30:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 02:30:15,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 02:30:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-10-11 02:30:15,205 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-10-11 02:30:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 02:30:15,418 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:30:15,426 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:30:15,786 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-10-11 02:30:15,786 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:30:15,822 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:30:15,822 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 02:30:15,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:30:15 BoogieIcfgContainer [2024-10-11 02:30:15,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:30:15,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:30:15,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:30:15,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:30:15,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:30:14" (1/3) ... [2024-10-11 02:30:15,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d21c621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:30:15, skipping insertion in model container [2024-10-11 02:30:15,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:14" (2/3) ... [2024-10-11 02:30:15,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d21c621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:30:15, skipping insertion in model container [2024-10-11 02:30:15,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:30:15" (3/3) ... [2024-10-11 02:30:15,833 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2024-10-11 02:30:15,850 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:30:15,850 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:30:15,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:30:15,909 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;@1f6064fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:30:15,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:30:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 02:30:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 02:30:15,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:30:15,926 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-11 02:30:15,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:30:15,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:30:15,932 INFO L85 PathProgramCache]: Analyzing trace with hash -813364378, now seen corresponding path program 1 times [2024-10-11 02:30:15,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:30:15,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134188033] [2024-10-11 02:30:15,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:30:15,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:30:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:16,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:30:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:16,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:30:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:16,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:30:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:16,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:30:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:16,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:30:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:16,518 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-11 02:30:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:30:16,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134188033] [2024-10-11 02:30:16,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134188033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:30:16,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:30:16,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:30:16,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638369638] [2024-10-11 02:30:16,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:30:16,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:30:16,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:30:16,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:30:16,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:30:16,558 INFO L87 Difference]: Start difference. First operand has 77 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 02:30:17,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:30:17,120 INFO L93 Difference]: Finished difference Result 136 states and 193 transitions. [2024-10-11 02:30:17,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:30:17,123 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-11 02:30:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:30:17,132 INFO L225 Difference]: With dead ends: 136 [2024-10-11 02:30:17,132 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 02:30:17,136 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-11 02:30:17,139 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 103 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:30:17,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 171 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:30:17,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 02:30:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2024-10-11 02:30:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2024-10-11 02:30:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2024-10-11 02:30:17,230 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 35 [2024-10-11 02:30:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:30:17,231 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2024-10-11 02:30:17,231 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-11 02:30:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2024-10-11 02:30:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 02:30:17,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:30:17,256 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-11 02:30:17,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:30:17,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:30:17,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:30:17,260 INFO L85 PathProgramCache]: Analyzing trace with hash -916736927, now seen corresponding path program 1 times [2024-10-11 02:30:17,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:30:17,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012682801] [2024-10-11 02:30:17,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:30:17,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:30:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:17,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:30:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:17,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:30:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:17,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:30:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:17,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:30:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:30:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:17,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:30:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:17,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:30:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:17,657 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-11 02:30:17,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:30:17,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012682801] [2024-10-11 02:30:17,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012682801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:30:17,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285678596] [2024-10-11 02:30:17,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:30:17,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:30:17,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:30:17,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:30:17,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:30:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:17,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 02:30:17,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:30:17,927 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-11 02:30:17,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:30:18,143 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-11 02:30:18,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285678596] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:30:18,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:30:18,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 11 [2024-10-11 02:30:18,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760411795] [2024-10-11 02:30:18,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:30:18,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:30:18,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:30:18,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:30:18,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:30:18,162 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 02:30:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:30:18,809 INFO L93 Difference]: Finished difference Result 137 states and 183 transitions. [2024-10-11 02:30:18,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:30:18,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 47 [2024-10-11 02:30:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:30:18,812 INFO L225 Difference]: With dead ends: 137 [2024-10-11 02:30:18,812 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 02:30:18,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:30:18,815 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 101 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:30:18,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 249 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 02:30:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 02:30:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2024-10-11 02:30:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2024-10-11 02:30:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2024-10-11 02:30:18,841 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 47 [2024-10-11 02:30:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:30:18,841 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2024-10-11 02:30:18,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 02:30:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2024-10-11 02:30:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 02:30:18,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:30:18,844 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-11 02:30:18,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:30:19,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:30:19,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:30:19,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:30:19,050 INFO L85 PathProgramCache]: Analyzing trace with hash 933921012, now seen corresponding path program 1 times [2024-10-11 02:30:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:30:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804023834] [2024-10-11 02:30:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:30:19,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:30:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:19,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:30:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:19,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:30:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:19,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:30:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:19,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:30:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:19,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:30:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:19,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:30:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:19,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:30:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:19,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 02:30:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:19,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:30:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:19,327 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-11 02:30:19,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:30:19,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804023834] [2024-10-11 02:30:19,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804023834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:30:19,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:30:19,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:30:19,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772431680] [2024-10-11 02:30:19,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:30:19,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:30:19,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:30:19,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:30:19,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:30:19,330 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 02:30:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:30:19,854 INFO L93 Difference]: Finished difference Result 137 states and 183 transitions. [2024-10-11 02:30:19,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:30:19,855 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-11 02:30:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:30:19,857 INFO L225 Difference]: With dead ends: 137 [2024-10-11 02:30:19,859 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 02:30:19,860 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-10-11 02:30:19,861 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 122 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:30:19,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 229 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:30:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 02:30:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-10-11 02:30:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.18) internal successors, (59), 53 states have internal predecessors, (59), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2024-10-11 02:30:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 106 transitions. [2024-10-11 02:30:19,881 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 106 transitions. Word has length 59 [2024-10-11 02:30:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:30:19,883 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 106 transitions. [2024-10-11 02:30:19,883 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-11 02:30:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2024-10-11 02:30:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 02:30:19,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:30:19,886 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-11 02:30:19,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:30:19,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:30:19,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:30:19,887 INFO L85 PathProgramCache]: Analyzing trace with hash -749122468, now seen corresponding path program 1 times [2024-10-11 02:30:19,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:30:19,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014281348] [2024-10-11 02:30:19,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:30:19,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:30:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:30:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:30:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:30:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:30:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:30:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:30:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:30:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:30:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:30:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:30:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:30:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,381 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-11 02:30:20,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:30:20,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014281348] [2024-10-11 02:30:20,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014281348] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:30:20,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732453751] [2024-10-11 02:30:20,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:30:20,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:30:20,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:30:20,389 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:30:20,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:30:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:30:20,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 02:30:20,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:30:20,651 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-11 02:30:20,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:30:20,883 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-11 02:30:20,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732453751] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:30:20,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:30:20,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 19 [2024-10-11 02:30:20,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556389112] [2024-10-11 02:30:20,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:30:20,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 02:30:20,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:30:20,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 02:30:20,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:30:20,889 INFO L87 Difference]: Start difference. First operand 80 states and 106 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-11 02:30:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:30:21,866 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2024-10-11 02:30:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 02:30:21,867 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-11 02:30:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:30:21,868 INFO L225 Difference]: With dead ends: 131 [2024-10-11 02:30:21,868 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 02:30:21,870 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-11 02:30:21,874 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 147 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:30:21,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 377 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:30:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 02:30:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-10-11 02:30:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.169811320754717) internal successors, (62), 56 states have internal predecessors, (62), 20 states have call successors, (20), 7 states have call predecessors, (20), 10 states have return successors, (29), 20 states have call predecessors, (29), 20 states have call successors, (29) [2024-10-11 02:30:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2024-10-11 02:30:21,888 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 72 [2024-10-11 02:30:21,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:30:21,890 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2024-10-11 02:30:21,890 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-11 02:30:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2024-10-11 02:30:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 02:30:21,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:30:21,893 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-11 02:30:21,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:30:22,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:30:22,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:30:22,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:30:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash -250240353, now seen corresponding path program 1 times [2024-10-11 02:30:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:30:22,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386124546] [2024-10-11 02:30:22,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:30:22,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:30:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:30:22,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 02:30:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:30:22,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 02:30:22,187 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 02:30:22,188 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:30:22,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:30:22,194 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 02:30:22,240 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:30:22,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:30:22 BoogieIcfgContainer [2024-10-11 02:30:22,243 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:30:22,243 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:30:22,244 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:30:22,244 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:30:22,244 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:30:15" (3/4) ... [2024-10-11 02:30:22,245 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 02:30:22,309 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:30:22,309 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:30:22,309 INFO L158 Benchmark]: Toolchain (without parser) took 7612.39ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 125.8MB in the beginning and 136.6MB in the end (delta: -10.8MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2024-10-11 02:30:22,309 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:30:22,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.77ms. Allocated memory is still 161.5MB. Free memory was 125.8MB in the beginning and 111.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 02:30:22,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.24ms. Allocated memory is still 161.5MB. Free memory was 111.1MB in the beginning and 109.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:30:22,310 INFO L158 Benchmark]: Boogie Preprocessor took 82.55ms. Allocated memory is still 161.5MB. Free memory was 109.0MB in the beginning and 105.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:30:22,310 INFO L158 Benchmark]: RCFGBuilder took 723.41ms. Allocated memory is still 161.5MB. Free memory was 105.9MB in the beginning and 113.4MB in the end (delta: -7.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 02:30:22,311 INFO L158 Benchmark]: TraceAbstraction took 6416.92ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 112.3MB in the beginning and 139.8MB in the end (delta: -27.5MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-10-11 02:30:22,311 INFO L158 Benchmark]: Witness Printer took 65.25ms. Allocated memory is still 216.0MB. Free memory was 139.8MB in the beginning and 136.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:30:22,315 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.15ms. Allocated memory is still 104.9MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.77ms. Allocated memory is still 161.5MB. Free memory was 125.8MB in the beginning and 111.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.24ms. Allocated memory is still 161.5MB. Free memory was 111.1MB in the beginning and 109.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.55ms. Allocated memory is still 161.5MB. Free memory was 109.0MB in the beginning and 105.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 723.41ms. Allocated memory is still 161.5MB. Free memory was 105.9MB in the beginning and 113.4MB in the end (delta: -7.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6416.92ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 112.3MB in the beginning and 139.8MB in the end (delta: -27.5MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Witness Printer took 65.25ms. Allocated memory is still 216.0MB. Free memory was 139.8MB in the beginning and 136.6MB 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: [L110] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-1:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}] [L110] RET, EXPR nondet_tree() [L110] CALL task(nondet_tree()) [L86] 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] [L86] RET, EXPR min(t) VAL [t={-1:0}] [L86] int a = min(t); [L87] int b; VAL [a=2147483647, b={5:0}, t={-1:0}] [L89] CALL, EXPR size(t) VAL [\old(t)={-1:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [\old(t)={-1:0}, t={-1:0}] [L82] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\old(t)={0:0}, \result=0] [L82] RET, EXPR size(t->left) VAL [\old(t)={-1:0}, t={-1:0}] [L82] EXPR t->right VAL [\old(t)={-1:0}] [L82] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\old(t)={0:0}, \result=0] [L82] RET, EXPR size(t->right) VAL [\old(t)={-1:0}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}] [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}] [L91] int *x = calloc(n, sizeof(int)); [L92] CALL tree_inorder(t, x, n) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=1, t={-1:0}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-2:0}] [L73] 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}] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=2] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-2:0}] [L75] 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] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, \result=2, a={-2:0}, i=2] [L92] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-2:0}] [L93] EXPR x[0] [L93] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0] [L16] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 502 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 473 mSDsluCounter, 1026 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 859 mSDsCounter, 360 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2251 IncrementalHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 360 mSolverCounterUnsat, 167 mSDtfsCounter, 2251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=4, InterpolantAutomatonStates: 48, 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, 2.2s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 1268 SizeOfPredicates, 6 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 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-11 02:30:22,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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