./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:51:53,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:51:53,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 04:51:53,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:51:53,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:51:53,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:51:53,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:51:53,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:51:53,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:51:53,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:51:53,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:51:53,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:51:53,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:51:53,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:51:53,776 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:51:53,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:51:53,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:51:53,777 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:51:53,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:51:53,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:51:53,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:51:53,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:51:53,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:51:53,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:51:53,778 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:51:53,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:51:53,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:51:53,778 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:51:53,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:51:53,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:51:53,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:51:53,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:51:53,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:51:53,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:51:53,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:51:53,779 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:51:53,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:51:53,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:51:53,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:51:53,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:51:53,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:51:53,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:51:53,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:51:53,780 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> b8fb715e20e93734f29581bef128b7f826b4b5933b157899cd0cb0d668434a9d [2025-02-08 04:51:54,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:51:54,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:51:54,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:51:54,040 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:51:54,040 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:51:54,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2025-02-08 04:51:55,345 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/295ca60f5/1235ffaca77a483eae15c474e5442d29/FLAGffbd95223 [2025-02-08 04:51:55,700 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:51:55,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i [2025-02-08 04:51:55,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/295ca60f5/1235ffaca77a483eae15c474e5442d29/FLAGffbd95223 [2025-02-08 04:51:55,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/295ca60f5/1235ffaca77a483eae15c474e5442d29 [2025-02-08 04:51:55,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:51:55,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:51:55,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:51:55,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:51:55,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:51:55,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:51:55" (1/1) ... [2025-02-08 04:51:55,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d2d9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:55, skipping insertion in model container [2025-02-08 04:51:55,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:51:55" (1/1) ... [2025-02-08 04:51:55,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:51:56,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[33021,33034] [2025-02-08 04:51:56,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[45234,45247] [2025-02-08 04:51:56,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:51:56,155 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:51:56,185 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[33021,33034] [2025-02-08 04:51:56,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-2.i[45234,45247] [2025-02-08 04:51:56,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:51:56,257 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:51:56,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56 WrapperNode [2025-02-08 04:51:56,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:51:56,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:51:56,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:51:56,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:51:56,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (1/1) ... [2025-02-08 04:51:56,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (1/1) ... [2025-02-08 04:51:56,357 INFO L138 Inliner]: procedures = 177, calls = 340, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1540 [2025-02-08 04:51:56,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:51:56,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:51:56,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:51:56,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:51:56,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (1/1) ... [2025-02-08 04:51:56,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (1/1) ... [2025-02-08 04:51:56,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (1/1) ... [2025-02-08 04:51:56,468 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [268, 2, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 62 writes are split as follows [58, 0, 4]. [2025-02-08 04:51:56,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (1/1) ... [2025-02-08 04:51:56,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (1/1) ... [2025-02-08 04:51:56,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (1/1) ... [2025-02-08 04:51:56,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (1/1) ... [2025-02-08 04:51:56,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (1/1) ... [2025-02-08 04:51:56,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (1/1) ... [2025-02-08 04:51:56,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:51:56,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:51:56,545 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:51:56,545 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:51:56,545 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (1/1) ... [2025-02-08 04:51:56,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:51:56,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:51:56,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 04:51:56,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 04:51:56,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:51:56,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:51:56,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 04:51:56,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 04:51:56,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 04:51:56,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:51:56,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:51:56,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 04:51:56,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:51:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:51:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 04:51:56,611 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:51:56,611 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:51:56,611 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 04:51:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-02-08 04:51:56,611 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-02-08 04:51:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:51:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:51:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:51:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:51:56,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 04:51:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 04:51:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:51:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:51:56,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 04:51:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:51:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:51:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:51:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 04:51:56,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:51:56,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:51:56,826 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:51:56,827 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:51:57,884 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 04:51:57,975 INFO L? ?]: Removed 353 outVars from TransFormulas that were not future-live. [2025-02-08 04:51:57,975 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:51:58,006 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:51:58,007 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 04:51:58,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:51:58 BoogieIcfgContainer [2025-02-08 04:51:58,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:51:58,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:51:58,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:51:58,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:51:58,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:51:55" (1/3) ... [2025-02-08 04:51:58,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9cd49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:51:58, skipping insertion in model container [2025-02-08 04:51:58,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:51:56" (2/3) ... [2025-02-08 04:51:58,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9cd49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:51:58, skipping insertion in model container [2025-02-08 04:51:58,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:51:58" (3/3) ... [2025-02-08 04:51:58,013 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test8-2.i [2025-02-08 04:51:58,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:51:58,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test8-2.i that has 6 procedures, 472 locations, 1 initial locations, 42 loop locations, and 2 error locations. [2025-02-08 04:51:58,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:51:58,091 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;@49a37377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:51:58,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 04:51:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 464 states, 437 states have (on average 1.6270022883295194) internal successors, (711), 454 states have internal predecessors, (711), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 04:51:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 04:51:58,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:51:58,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:51:58,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:51:58,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:51:58,107 INFO L85 PathProgramCache]: Analyzing trace with hash -153701349, now seen corresponding path program 1 times [2025-02-08 04:51:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:51:58,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163649978] [2025-02-08 04:51:58,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:51:58,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:51:58,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 04:51:58,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 04:51:58,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:51:58,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:51:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:51:58,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:51:58,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163649978] [2025-02-08 04:51:58,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163649978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:51:58,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:51:58,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:51:58,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799760404] [2025-02-08 04:51:58,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:51:58,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 04:51:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:51:58,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 04:51:58,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:51:58,250 INFO L87 Difference]: Start difference. First operand has 464 states, 437 states have (on average 1.6270022883295194) internal successors, (711), 454 states have internal predecessors, (711), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:51:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:51:58,384 INFO L93 Difference]: Finished difference Result 927 states and 1516 transitions. [2025-02-08 04:51:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 04:51:58,387 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 04:51:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:51:58,394 INFO L225 Difference]: With dead ends: 927 [2025-02-08 04:51:58,395 INFO L226 Difference]: Without dead ends: 424 [2025-02-08 04:51:58,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 04:51:58,399 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:51:58,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 636 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:51:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-02-08 04:51:58,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2025-02-08 04:51:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 400 states have (on average 1.4675) internal successors, (587), 415 states have internal predecessors, (587), 20 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:51:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 612 transitions. [2025-02-08 04:51:58,440 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 612 transitions. Word has length 8 [2025-02-08 04:51:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:51:58,440 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 612 transitions. [2025-02-08 04:51:58,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:51:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 612 transitions. [2025-02-08 04:51:58,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 04:51:58,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:51:58,443 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:51:58,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:51:58,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:51:58,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:51:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1218807855, now seen corresponding path program 1 times [2025-02-08 04:51:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:51:58,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171947070] [2025-02-08 04:51:58,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:51:58,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:51:58,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 04:51:58,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 04:51:58,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:51:58,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:51:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:51:58,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:51:58,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171947070] [2025-02-08 04:51:58,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171947070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:51:58,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:51:58,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:51:58,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515271701] [2025-02-08 04:51:58,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:51:58,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:51:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:51:58,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:51:58,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:51:58,783 INFO L87 Difference]: Start difference. First operand 424 states and 612 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:51:58,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:51:58,996 INFO L93 Difference]: Finished difference Result 1029 states and 1491 transitions. [2025-02-08 04:51:58,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:51:58,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-08 04:51:58,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:51:58,999 INFO L225 Difference]: With dead ends: 1029 [2025-02-08 04:51:59,000 INFO L226 Difference]: Without dead ends: 805 [2025-02-08 04:51:59,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:51:59,001 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 543 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:51:59,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1723 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:51:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-02-08 04:51:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 426. [2025-02-08 04:51:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 402 states have (on average 1.4651741293532339) internal successors, (589), 417 states have internal predecessors, (589), 20 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:51:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 614 transitions. [2025-02-08 04:51:59,018 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 614 transitions. Word has length 62 [2025-02-08 04:51:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:51:59,018 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 614 transitions. [2025-02-08 04:51:59,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:51:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 614 transitions. [2025-02-08 04:51:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 04:51:59,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:51:59,020 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:51:59,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:51:59,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:51:59,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:51:59,023 INFO L85 PathProgramCache]: Analyzing trace with hash -513930211, now seen corresponding path program 1 times [2025-02-08 04:51:59,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:51:59,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717262278] [2025-02-08 04:51:59,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:51:59,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:51:59,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 04:51:59,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 04:51:59,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:51:59,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:51:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:51:59,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:51:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717262278] [2025-02-08 04:51:59,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717262278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:51:59,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:51:59,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:51:59,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739510185] [2025-02-08 04:51:59,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:51:59,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:51:59,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:51:59,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:51:59,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:51:59,313 INFO L87 Difference]: Start difference. First operand 426 states and 614 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:51:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:51:59,453 INFO L93 Difference]: Finished difference Result 807 states and 1159 transitions. [2025-02-08 04:51:59,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:51:59,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 04:51:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:51:59,455 INFO L225 Difference]: With dead ends: 807 [2025-02-08 04:51:59,456 INFO L226 Difference]: Without dead ends: 384 [2025-02-08 04:51:59,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:51:59,459 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 30 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:51:59,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1415 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:51:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-08 04:51:59,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-02-08 04:51:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 360 states have (on average 1.4222222222222223) internal successors, (512), 375 states have internal predecessors, (512), 20 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 04:51:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 537 transitions. [2025-02-08 04:51:59,475 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 537 transitions. Word has length 83 [2025-02-08 04:51:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:51:59,475 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 537 transitions. [2025-02-08 04:51:59,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:51:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 537 transitions. [2025-02-08 04:51:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-08 04:51:59,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:51:59,482 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:51:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:51:59,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:51:59,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:51:59,482 INFO L85 PathProgramCache]: Analyzing trace with hash -801697098, now seen corresponding path program 1 times [2025-02-08 04:51:59,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:51:59,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178029904] [2025-02-08 04:51:59,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:51:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:51:59,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 04:51:59,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 04:51:59,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:51:59,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:51:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 04:51:59,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:51:59,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178029904] [2025-02-08 04:51:59,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178029904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:51:59,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:51:59,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 04:51:59,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143461507] [2025-02-08 04:51:59,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:51:59,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:51:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:51:59,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:51:59,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:51:59,646 INFO L87 Difference]: Start difference. First operand 384 states and 537 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:51:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:51:59,784 INFO L93 Difference]: Finished difference Result 1015 states and 1431 transitions. [2025-02-08 04:51:59,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:51:59,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-08 04:51:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:51:59,787 INFO L225 Difference]: With dead ends: 1015 [2025-02-08 04:51:59,787 INFO L226 Difference]: Without dead ends: 634 [2025-02-08 04:51:59,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:51:59,788 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 294 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:51:59,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1138 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:51:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-02-08 04:51:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2025-02-08 04:51:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 606 states have (on average 1.4290429042904291) internal successors, (866), 621 states have internal predecessors, (866), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:51:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 893 transitions. [2025-02-08 04:51:59,803 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 893 transitions. Word has length 83 [2025-02-08 04:51:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:51:59,804 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 893 transitions. [2025-02-08 04:51:59,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:51:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 893 transitions. [2025-02-08 04:51:59,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 04:51:59,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:51:59,806 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:51:59,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:51:59,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:51:59,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:51:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash -21560969, now seen corresponding path program 1 times [2025-02-08 04:51:59,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:51:59,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054056135] [2025-02-08 04:51:59,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:51:59,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:51:59,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 04:52:00,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 04:52:00,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:00,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:52:00,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:52:00,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054056135] [2025-02-08 04:52:00,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054056135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:52:00,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161650142] [2025-02-08 04:52:00,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:00,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:52:00,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:52:00,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:52:00,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 04:52:00,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 04:52:00,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 04:52:00,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:00,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:00,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 04:52:00,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:52:00,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 04:52:00,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-02-08 04:52:00,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 04:52:00,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-02-08 04:52:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:52:01,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:52:01,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161650142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:52:01,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:52:01,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-02-08 04:52:01,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117250990] [2025-02-08 04:52:01,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:52:01,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 04:52:01,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:52:01,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 04:52:01,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:52:01,158 INFO L87 Difference]: Start difference. First operand 631 states and 893 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:52:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:52:02,989 INFO L93 Difference]: Finished difference Result 1516 states and 2152 transitions. [2025-02-08 04:52:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 04:52:02,989 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2025-02-08 04:52:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:52:02,993 INFO L225 Difference]: With dead ends: 1516 [2025-02-08 04:52:02,993 INFO L226 Difference]: Without dead ends: 927 [2025-02-08 04:52:02,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-02-08 04:52:02,996 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 590 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:52:02,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 3655 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 04:52:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-02-08 04:52:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 631. [2025-02-08 04:52:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 606 states have (on average 1.4273927392739274) internal successors, (865), 621 states have internal predecessors, (865), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:52:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 892 transitions. [2025-02-08 04:52:03,022 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 892 transitions. Word has length 98 [2025-02-08 04:52:03,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:52:03,022 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 892 transitions. [2025-02-08 04:52:03,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:52:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 892 transitions. [2025-02-08 04:52:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 04:52:03,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:52:03,026 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:52:03,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 04:52:03,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:52:03,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:52:03,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:52:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1355576184, now seen corresponding path program 1 times [2025-02-08 04:52:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:52:03,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984393217] [2025-02-08 04:52:03,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:52:03,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 04:52:03,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 04:52:03,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:03,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 04:52:03,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:52:03,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984393217] [2025-02-08 04:52:03,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984393217] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:52:03,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721543255] [2025-02-08 04:52:03,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:52:03,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:52:03,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:52:03,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 04:52:03,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 04:52:03,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 04:52:03,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 04:52:03,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:52:03,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:52:03,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 04:52:03,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:53:01,376 WARN L286 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-08 04:53:21,366 WARN L286 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 16 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-08 04:53:37,969 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)