./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_test9-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 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:44:54,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:44:54,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:44:54,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:44:54,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:44:54,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:44:54,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:44:54,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:44:54,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:44:54,402 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:44:54,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:44:54,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:44:54,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:44:54,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:44:54,403 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:44:54,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:44:54,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:44:54,403 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:44:54,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:44:54,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:44:54,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:44:54,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:44:54,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:44:54,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:44:54,404 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:44:54,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:44:54,404 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:44:54,406 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:44:54,406 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:44:54,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:44:54,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:44:54,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:44:54,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:44:54,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:44:54,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:44:54,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:44:54,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:44:54,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:44:54,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:44:54,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:44:54,408 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:44:54,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:44:54,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:44:54,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:44:54,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:44:54,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:44:54,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:44:54,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:44:54,408 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 -> 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc [2025-01-09 20:44:54,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:44:54,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:44:54,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:44:54,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:44:54,620 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:44:54,621 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_test9-2.i [2025-01-09 20:44:55,762 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77424bff0/41d0ce6c995f49efbac98ad243884a0d/FLAG9b2aaec53 [2025-01-09 20:44:56,134 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:44:56,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2025-01-09 20:44:56,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77424bff0/41d0ce6c995f49efbac98ad243884a0d/FLAG9b2aaec53 [2025-01-09 20:44:56,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77424bff0/41d0ce6c995f49efbac98ad243884a0d [2025-01-09 20:44:56,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:44:56,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:44:56,334 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:44:56,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:44:56,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:44:56,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:56,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456b26e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56, skipping insertion in model container [2025-01-09 20:44:56,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:56,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:44:56,640 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_test9-2.i[33021,33034] [2025-01-09 20:44:56,769 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_test9-2.i[84583,84596] [2025-01-09 20:44:56,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:44:56,787 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:44:56,811 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_test9-2.i[33021,33034] [2025-01-09 20:44:56,883 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_test9-2.i[84583,84596] [2025-01-09 20:44:56,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:44:56,916 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:44:56,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56 WrapperNode [2025-01-09 20:44:56,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:44:56,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:44:56,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:44:56,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:44:56,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:56,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:57,042 INFO L138 Inliner]: procedures = 177, calls = 773, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3403 [2025-01-09 20:44:57,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:44:57,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:44:57,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:44:57,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:44:57,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:57,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:57,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:57,134 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [220, 2, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [50, 0, 4]. [2025-01-09 20:44:57,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:57,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:57,171 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:57,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:57,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:57,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:57,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:57,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:44:57,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:44:57,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:44:57,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:44:57,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (1/1) ... [2025-01-09 20:44:57,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:44:57,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:44:57,260 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-01-09 20:44:57,265 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-01-09 20:44:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:44:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:44:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:44:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:44:57,281 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:44:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:44:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:44:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:44:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:44:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:44:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:44:57,282 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:44:57,282 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:44:57,282 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:44:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:44:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:44:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:44:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:44:57,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:44:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:44:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:44:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:44:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:44:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:44:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:44:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:44:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:44:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:44:57,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:44:57,448 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:44:57,449 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:44:59,563 INFO L? ?]: Removed 823 outVars from TransFormulas that were not future-live. [2025-01-09 20:44:59,563 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:44:59,600 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:44:59,601 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2025-01-09 20:44:59,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:44:59 BoogieIcfgContainer [2025-01-09 20:44:59,603 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:44:59,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:44:59,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:44:59,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:44:59,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:44:56" (1/3) ... [2025-01-09 20:44:59,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689b9728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:44:59, skipping insertion in model container [2025-01-09 20:44:59,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:44:56" (2/3) ... [2025-01-09 20:44:59,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689b9728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:44:59, skipping insertion in model container [2025-01-09 20:44:59,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:44:59" (3/3) ... [2025-01-09 20:44:59,610 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test9-2.i [2025-01-09 20:44:59,620 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:44:59,621 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test9-2.i that has 5 procedures, 1411 locations, 1 initial locations, 38 loop locations, and 2 error locations. [2025-01-09 20:44:59,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:44:59,714 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;@9a61c20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:44:59,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 20:44:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 1403 states, 895 states have (on average 1.8279329608938548) internal successors, (1636), 1397 states have internal predecessors, (1636), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 20:44:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 20:44:59,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:44:59,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:44:59,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:44:59,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:44:59,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1337710400, now seen corresponding path program 1 times [2025-01-09 20:44:59,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:44:59,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528223307] [2025-01-09 20:44:59,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:44:59,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:44:59,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 20:44:59,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 20:44:59,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:44:59,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:44:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:44:59,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:44:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528223307] [2025-01-09 20:44:59,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528223307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:44:59,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:44:59,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:44:59,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132088227] [2025-01-09 20:44:59,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:44:59,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:44:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:44:59,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:44:59,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:44:59,877 INFO L87 Difference]: Start difference. First operand has 1403 states, 895 states have (on average 1.8279329608938548) internal successors, (1636), 1397 states have internal predecessors, (1636), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-01-09 20:45:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:00,050 INFO L93 Difference]: Finished difference Result 2804 states and 5782 transitions. [2025-01-09 20:45:00,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:45:00,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-01-09 20:45:00,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:00,081 INFO L225 Difference]: With dead ends: 2804 [2025-01-09 20:45:00,081 INFO L226 Difference]: Without dead ends: 1366 [2025-01-09 20:45:00,094 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-01-09 20:45:00,097 INFO L435 NwaCegarLoop]: 2578 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2578 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:00,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2578 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:45:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-01-09 20:45:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1366. [2025-01-09 20:45:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 859 states have (on average 1.7718277066356227) internal successors, (1522), 1360 states have internal predecessors, (1522), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 20:45:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2528 transitions. [2025-01-09 20:45:00,342 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2528 transitions. Word has length 9 [2025-01-09 20:45:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:00,342 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 2528 transitions. [2025-01-09 20:45:00,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-01-09 20:45:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2528 transitions. [2025-01-09 20:45:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 20:45:00,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:00,345 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] [2025-01-09 20:45:00,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:45:00,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:00,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1772636287, now seen corresponding path program 1 times [2025-01-09 20:45:00,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:00,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258999749] [2025-01-09 20:45:00,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:00,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 20:45:00,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 20:45:00,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:00,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:45:00,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:00,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258999749] [2025-01-09 20:45:00,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258999749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:45:00,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:45:00,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:45:00,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452178050] [2025-01-09 20:45:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:45:00,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:45:00,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:00,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:45:00,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:45:00,718 INFO L87 Difference]: Start difference. First operand 1366 states and 2528 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-09 20:45:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:01,448 INFO L93 Difference]: Finished difference Result 3884 states and 7283 transitions. [2025-01-09 20:45:01,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:45:01,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2025-01-09 20:45:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:01,470 INFO L225 Difference]: With dead ends: 3884 [2025-01-09 20:45:01,471 INFO L226 Difference]: Without dead ends: 2719 [2025-01-09 20:45:01,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-09 20:45:01,477 INFO L435 NwaCegarLoop]: 2761 mSDtfsCounter, 1507 mSDsluCounter, 4764 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 7525 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:01,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 7525 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 20:45:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2025-01-09 20:45:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 1368. [2025-01-09 20:45:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 861 states have (on average 1.7700348432055748) internal successors, (1524), 1362 states have internal predecessors, (1524), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 20:45:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2530 transitions. [2025-01-09 20:45:01,850 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2530 transitions. Word has length 63 [2025-01-09 20:45:01,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:01,851 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 2530 transitions. [2025-01-09 20:45:01,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-09 20:45:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2530 transitions. [2025-01-09 20:45:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:45:01,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:01,858 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:45:01,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:45:01,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:01,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:01,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1726903291, now seen corresponding path program 1 times [2025-01-09 20:45:01,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:01,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621235028] [2025-01-09 20:45:01,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:01,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:01,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:45:01,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:45:01,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:01,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:45:02,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:02,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621235028] [2025-01-09 20:45:02,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621235028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:45:02,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:45:02,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:45:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288555652] [2025-01-09 20:45:02,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:45:02,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:45:02,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:02,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:45:02,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:45:02,227 INFO L87 Difference]: Start difference. First operand 1368 states and 2530 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-01-09 20:45:02,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:02,332 INFO L93 Difference]: Finished difference Result 2690 states and 4990 transitions. [2025-01-09 20:45:02,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:45:02,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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 139 [2025-01-09 20:45:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:02,343 INFO L225 Difference]: With dead ends: 2690 [2025-01-09 20:45:02,343 INFO L226 Difference]: Without dead ends: 1326 [2025-01-09 20:45:02,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-09 20:45:02,349 INFO L435 NwaCegarLoop]: 2426 mSDtfsCounter, 30 mSDsluCounter, 4834 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7260 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:02,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7260 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:45:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-01-09 20:45:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2025-01-09 20:45:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 819 states have (on average 1.7667887667887667) internal successors, (1447), 1320 states have internal predecessors, (1447), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 20:45:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2453 transitions. [2025-01-09 20:45:02,451 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2453 transitions. Word has length 139 [2025-01-09 20:45:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:02,452 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 2453 transitions. [2025-01-09 20:45:02,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-01-09 20:45:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2453 transitions. [2025-01-09 20:45:02,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:45:02,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:02,455 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:45:02,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:45:02,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:02,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:02,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2011079597, now seen corresponding path program 1 times [2025-01-09 20:45:02,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:02,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659091224] [2025-01-09 20:45:02,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:02,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:02,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:45:02,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:45:02,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:02,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:45:02,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:02,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659091224] [2025-01-09 20:45:02,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659091224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:45:02,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:45:02,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:45:02,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273797770] [2025-01-09 20:45:02,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:45:02,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:45:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:02,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:45:02,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:45:02,641 INFO L87 Difference]: Start difference. First operand 1326 states and 2453 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-01-09 20:45:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:02,708 INFO L93 Difference]: Finished difference Result 2648 states and 4902 transitions. [2025-01-09 20:45:02,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:45:02,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 139 [2025-01-09 20:45:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:02,719 INFO L225 Difference]: With dead ends: 2648 [2025-01-09 20:45:02,719 INFO L226 Difference]: Without dead ends: 1326 [2025-01-09 20:45:02,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-09 20:45:02,726 INFO L435 NwaCegarLoop]: 2439 mSDtfsCounter, 1 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4856 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:02,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4856 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:45:02,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-01-09 20:45:02,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2025-01-09 20:45:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 819 states have (on average 1.763125763125763) internal successors, (1444), 1320 states have internal predecessors, (1444), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 20:45:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2450 transitions. [2025-01-09 20:45:02,824 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2450 transitions. Word has length 139 [2025-01-09 20:45:02,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:02,825 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 2450 transitions. [2025-01-09 20:45:02,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-01-09 20:45:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2450 transitions. [2025-01-09 20:45:02,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:45:02,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:02,827 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:45:02,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:45:02,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:02,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:02,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1820628401, now seen corresponding path program 1 times [2025-01-09 20:45:02,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:02,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603839595] [2025-01-09 20:45:02,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:02,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:02,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:45:02,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:45:02,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:02,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:45:02,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:02,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603839595] [2025-01-09 20:45:02,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603839595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:45:02,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:45:02,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:45:02,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466542392] [2025-01-09 20:45:02,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:45:02,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:45:02,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:03,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:45:03,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:45:03,000 INFO L87 Difference]: Start difference. First operand 1326 states and 2450 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-01-09 20:45:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:03,116 INFO L93 Difference]: Finished difference Result 3872 states and 7216 transitions. [2025-01-09 20:45:03,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:45:03,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 139 [2025-01-09 20:45:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:03,134 INFO L225 Difference]: With dead ends: 3872 [2025-01-09 20:45:03,134 INFO L226 Difference]: Without dead ends: 2550 [2025-01-09 20:45:03,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-09 20:45:03,141 INFO L435 NwaCegarLoop]: 2906 mSDtfsCounter, 1260 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 5337 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:03,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 5337 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:45:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2025-01-09 20:45:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2548. [2025-01-09 20:45:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 1541 states have (on average 1.7916937053861128) internal successors, (2761), 2542 states have internal predecessors, (2761), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-09 20:45:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 4767 transitions. [2025-01-09 20:45:03,368 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 4767 transitions. Word has length 139 [2025-01-09 20:45:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:03,369 INFO L471 AbstractCegarLoop]: Abstraction has 2548 states and 4767 transitions. [2025-01-09 20:45:03,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-01-09 20:45:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 4767 transitions. [2025-01-09 20:45:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:45:03,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:03,370 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:45:03,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:45:03,370 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:03,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:03,371 INFO L85 PathProgramCache]: Analyzing trace with hash 970676378, now seen corresponding path program 1 times [2025-01-09 20:45:03,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:03,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695908401] [2025-01-09 20:45:03,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:03,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:03,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:45:03,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:45:03,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:03,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:45:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695908401] [2025-01-09 20:45:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695908401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:45:03,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:45:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:45:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334352518] [2025-01-09 20:45:03,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:45:03,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:45:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:03,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:45:03,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:45:03,675 INFO L87 Difference]: Start difference. First operand 2548 states and 4767 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:03,892 INFO L93 Difference]: Finished difference Result 4927 states and 9309 transitions. [2025-01-09 20:45:03,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:45:03,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-01-09 20:45:03,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:03,908 INFO L225 Difference]: With dead ends: 4927 [2025-01-09 20:45:03,909 INFO L226 Difference]: Without dead ends: 2628 [2025-01-09 20:45:03,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:45:03,918 INFO L435 NwaCegarLoop]: 2420 mSDtfsCounter, 129 mSDsluCounter, 7145 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 9565 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:03,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 9565 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:45:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2025-01-09 20:45:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2552. [2025-01-09 20:45:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 1545 states have (on average 1.7909385113268608) internal successors, (2767), 2546 states have internal predecessors, (2767), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-09 20:45:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 4773 transitions. [2025-01-09 20:45:04,161 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 4773 transitions. Word has length 154 [2025-01-09 20:45:04,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:04,162 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 4773 transitions. [2025-01-09 20:45:04,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 4773 transitions. [2025-01-09 20:45:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:45:04,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:04,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:45:04,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:45:04,163 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:04,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1785950888, now seen corresponding path program 1 times [2025-01-09 20:45:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:04,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255710064] [2025-01-09 20:45:04,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:04,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:45:04,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:45:04,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:04,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:45:04,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:04,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255710064] [2025-01-09 20:45:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255710064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:45:04,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:45:04,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:45:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383088851] [2025-01-09 20:45:04,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:45:04,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:45:04,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:04,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:45:04,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:45:04,408 INFO L87 Difference]: Start difference. First operand 2552 states and 4773 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:04,558 INFO L93 Difference]: Finished difference Result 4767 states and 9079 transitions. [2025-01-09 20:45:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:45:04,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-01-09 20:45:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:04,573 INFO L225 Difference]: With dead ends: 4767 [2025-01-09 20:45:04,573 INFO L226 Difference]: Without dead ends: 2464 [2025-01-09 20:45:04,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:45:04,580 INFO L435 NwaCegarLoop]: 2344 mSDtfsCounter, 12 mSDsluCounter, 7001 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9345 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:04,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9345 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:45:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2025-01-09 20:45:04,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2464. [2025-01-09 20:45:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2464 states, 1457 states have (on average 1.789293067947838) internal successors, (2607), 2458 states have internal predecessors, (2607), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-09 20:45:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 4613 transitions. [2025-01-09 20:45:04,781 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 4613 transitions. Word has length 154 [2025-01-09 20:45:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:04,782 INFO L471 AbstractCegarLoop]: Abstraction has 2464 states and 4613 transitions. [2025-01-09 20:45:04,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 4613 transitions. [2025-01-09 20:45:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 20:45:04,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:04,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:45:04,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:45:04,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:04,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash -200837746, now seen corresponding path program 1 times [2025-01-09 20:45:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:04,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551068135] [2025-01-09 20:45:04,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:04,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:04,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 20:45:04,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 20:45:04,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:04,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:45:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:04,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551068135] [2025-01-09 20:45:04,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551068135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:45:04,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:45:04,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:45:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58899731] [2025-01-09 20:45:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:45:04,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:45:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:04,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:45:04,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:45:04,989 INFO L87 Difference]: Start difference. First operand 2464 states and 4613 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:06,897 INFO L93 Difference]: Finished difference Result 4917 states and 9214 transitions. [2025-01-09 20:45:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:45:06,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2025-01-09 20:45:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:06,919 INFO L225 Difference]: With dead ends: 4917 [2025-01-09 20:45:06,919 INFO L226 Difference]: Without dead ends: 2544 [2025-01-09 20:45:06,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:45:06,928 INFO L435 NwaCegarLoop]: 2666 mSDtfsCounter, 6133 mSDsluCounter, 2445 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 1539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6634 SdHoareTripleChecker+Valid, 5111 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1539 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:06,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6634 Valid, 5111 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1539 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 20:45:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2025-01-09 20:45:07,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 1371. [2025-01-09 20:45:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 864 states have (on average 1.712962962962963) internal successors, (1480), 1365 states have internal predecessors, (1480), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 20:45:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2486 transitions. [2025-01-09 20:45:07,243 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2486 transitions. Word has length 154 [2025-01-09 20:45:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:07,244 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 2486 transitions. [2025-01-09 20:45:07,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2486 transitions. [2025-01-09 20:45:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 20:45:07,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:07,247 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:45:07,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:45:07,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:07,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1063095389, now seen corresponding path program 1 times [2025-01-09 20:45:07,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:07,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341989665] [2025-01-09 20:45:07,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:07,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:07,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:45:07,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:45:07,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:07,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:45:07,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:07,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341989665] [2025-01-09 20:45:07,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341989665] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:45:07,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562609360] [2025-01-09 20:45:07,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:07,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:45:07,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:45:07,799 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-01-09 20:45:07,800 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-01-09 20:45:07,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:45:08,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:45:08,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:08,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:08,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:45:08,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:45:08,086 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-01-09 20:45:08,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:45:08,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:45:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:45:08,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562609360] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:45:08,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:45:08,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-01-09 20:45:08,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536245846] [2025-01-09 20:45:08,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:45:08,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 20:45:08,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:08,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 20:45:08,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:45:08,460 INFO L87 Difference]: Start difference. First operand 1371 states and 2486 transitions. Second operand has 12 states, 12 states have (on average 27.166666666666668) internal successors, (326), 12 states have internal predecessors, (326), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 20:45:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:13,254 INFO L93 Difference]: Finished difference Result 5221 states and 9610 transitions. [2025-01-09 20:45:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:45:13,255 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.166666666666668) internal successors, (326), 12 states have internal predecessors, (326), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 164 [2025-01-09 20:45:13,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:13,275 INFO L225 Difference]: With dead ends: 5221 [2025-01-09 20:45:13,275 INFO L226 Difference]: Without dead ends: 4098 [2025-01-09 20:45:13,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 20:45:13,280 INFO L435 NwaCegarLoop]: 2027 mSDtfsCounter, 4517 mSDsluCounter, 13417 mSDsCounter, 0 mSdLazyCounter, 5650 mSolverCounterSat, 1008 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5521 SdHoareTripleChecker+Valid, 15444 SdHoareTripleChecker+Invalid, 6658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1008 IncrementalHoareTripleChecker+Valid, 5650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:13,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5521 Valid, 15444 Invalid, 6658 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1008 Valid, 5650 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 20:45:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2025-01-09 20:45:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 1718. [2025-01-09 20:45:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1207 states have (on average 1.59983429991715) internal successors, (1931), 1708 states have internal predecessors, (1931), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2025-01-09 20:45:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2943 transitions. [2025-01-09 20:45:13,585 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2943 transitions. Word has length 164 [2025-01-09 20:45:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:13,586 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2943 transitions. [2025-01-09 20:45:13,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.166666666666668) internal successors, (326), 12 states have internal predecessors, (326), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 20:45:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2943 transitions. [2025-01-09 20:45:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 20:45:13,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:13,590 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 20:45:13,599 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-01-09 20:45:13,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:45:13,792 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:13,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1352005107, now seen corresponding path program 1 times [2025-01-09 20:45:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:13,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560239978] [2025-01-09 20:45:13,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:13,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:13,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 20:45:14,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 20:45:14,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:14,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:45:16,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:16,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560239978] [2025-01-09 20:45:16,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560239978] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:45:16,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011562601] [2025-01-09 20:45:16,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:16,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:45:16,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:45:16,196 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-01-09 20:45:16,197 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-01-09 20:45:16,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 20:45:16,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 20:45:16,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:16,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:16,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 20:45:16,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:45:16,686 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-01-09 20:45:16,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:16,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:16,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:17,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:17,073 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:45:17,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:45:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:45:17,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011562601] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:45:17,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:45:17,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 24 [2025-01-09 20:45:17,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811437574] [2025-01-09 20:45:17,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:45:17,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 20:45:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:17,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 20:45:17,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2025-01-09 20:45:17,443 INFO L87 Difference]: Start difference. First operand 1718 states and 2943 transitions. Second operand has 24 states, 24 states have (on average 42.083333333333336) internal successors, (1010), 24 states have internal predecessors, (1010), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 20:45:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:28,618 INFO L93 Difference]: Finished difference Result 10549 states and 19373 transitions. [2025-01-09 20:45:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 20:45:28,619 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 42.083333333333336) internal successors, (1010), 24 states have internal predecessors, (1010), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 392 [2025-01-09 20:45:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:28,653 INFO L225 Difference]: With dead ends: 10549 [2025-01-09 20:45:28,653 INFO L226 Difference]: Without dead ends: 9426 [2025-01-09 20:45:28,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 773 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 20:45:28,659 INFO L435 NwaCegarLoop]: 6860 mSDtfsCounter, 20378 mSDsluCounter, 39911 mSDsCounter, 0 mSdLazyCounter, 18068 mSolverCounterSat, 3980 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23388 SdHoareTripleChecker+Valid, 46771 SdHoareTripleChecker+Invalid, 22048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3980 IncrementalHoareTripleChecker+Valid, 18068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:28,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23388 Valid, 46771 Invalid, 22048 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3980 Valid, 18068 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2025-01-09 20:45:28,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9426 states. [2025-01-09 20:45:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9426 to 2582. [2025-01-09 20:45:29,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2582 states, 2065 states have (on average 1.4813559322033898) internal successors, (3059), 2566 states have internal predecessors, (3059), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 20:45:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 4083 transitions. [2025-01-09 20:45:29,297 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 4083 transitions. Word has length 392 [2025-01-09 20:45:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:29,298 INFO L471 AbstractCegarLoop]: Abstraction has 2582 states and 4083 transitions. [2025-01-09 20:45:29,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 42.083333333333336) internal successors, (1010), 24 states have internal predecessors, (1010), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 20:45:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 4083 transitions. [2025-01-09 20:45:29,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2025-01-09 20:45:29,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:29,310 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-01-09 20:45:29,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 20:45:29,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:45:29,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:29,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:29,512 INFO L85 PathProgramCache]: Analyzing trace with hash -471375841, now seen corresponding path program 2 times [2025-01-09 20:45:29,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:29,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241146081] [2025-01-09 20:45:29,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:45:29,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:29,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 848 statements into 2 equivalence classes. [2025-01-09 20:45:29,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 848 statements. [2025-01-09 20:45:29,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:45:29,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:45:29,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241146081] [2025-01-09 20:45:29,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241146081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:45:29,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:45:29,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:45:29,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257954040] [2025-01-09 20:45:29,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:45:29,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:45:29,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:29,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:45:29,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:45:29,881 INFO L87 Difference]: Start difference. First operand 2582 states and 4083 transitions. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:30,641 INFO L93 Difference]: Finished difference Result 3719 states and 6264 transitions. [2025-01-09 20:45:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:45:30,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 848 [2025-01-09 20:45:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:30,654 INFO L225 Difference]: With dead ends: 3719 [2025-01-09 20:45:30,655 INFO L226 Difference]: Without dead ends: 2597 [2025-01-09 20:45:30,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:45:30,660 INFO L435 NwaCegarLoop]: 2346 mSDtfsCounter, 51 mSDsluCounter, 13623 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 15969 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:30,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 15969 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 20:45:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2025-01-09 20:45:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2593. [2025-01-09 20:45:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2593 states, 2076 states have (on average 1.4788053949903661) internal successors, (3070), 2577 states have internal predecessors, (3070), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 20:45:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 4094 transitions. [2025-01-09 20:45:30,928 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 4094 transitions. Word has length 848 [2025-01-09 20:45:30,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:30,929 INFO L471 AbstractCegarLoop]: Abstraction has 2593 states and 4094 transitions. [2025-01-09 20:45:30,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:30,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 4094 transitions. [2025-01-09 20:45:30,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2025-01-09 20:45:30,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:30,948 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-01-09 20:45:30,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:45:30,948 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:30,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:30,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1224023286, now seen corresponding path program 1 times [2025-01-09 20:45:30,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:30,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502287550] [2025-01-09 20:45:30,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:30,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:31,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 849 statements into 1 equivalence classes. [2025-01-09 20:45:31,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 849 of 849 statements. [2025-01-09 20:45:31,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:31,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:45:33,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:33,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502287550] [2025-01-09 20:45:33,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502287550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:45:33,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:45:33,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:45:33,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907891703] [2025-01-09 20:45:33,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:45:33,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:45:33,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:33,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:45:33,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:45:33,035 INFO L87 Difference]: Start difference. First operand 2593 states and 4094 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:33,412 INFO L93 Difference]: Finished difference Result 3731 states and 6273 transitions. [2025-01-09 20:45:33,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:45:33,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 849 [2025-01-09 20:45:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:33,423 INFO L225 Difference]: With dead ends: 3731 [2025-01-09 20:45:33,424 INFO L226 Difference]: Without dead ends: 2598 [2025-01-09 20:45:33,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:45:33,428 INFO L435 NwaCegarLoop]: 2353 mSDtfsCounter, 20 mSDsluCounter, 11356 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 13709 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:33,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 13709 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:45:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2025-01-09 20:45:33,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2597. [2025-01-09 20:45:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2080 states have (on average 1.4783653846153846) internal successors, (3075), 2581 states have internal predecessors, (3075), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 20:45:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 4099 transitions. [2025-01-09 20:45:33,627 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 4099 transitions. Word has length 849 [2025-01-09 20:45:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:33,629 INFO L471 AbstractCegarLoop]: Abstraction has 2597 states and 4099 transitions. [2025-01-09 20:45:33,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 4099 transitions. [2025-01-09 20:45:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2025-01-09 20:45:33,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:33,636 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-01-09 20:45:33,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:45:33,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:33,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:33,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1839857822, now seen corresponding path program 1 times [2025-01-09 20:45:33,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:33,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952179606] [2025-01-09 20:45:33,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:33,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:33,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 849 statements into 1 equivalence classes. [2025-01-09 20:45:34,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 849 of 849 statements. [2025-01-09 20:45:34,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:34,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:45:35,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:35,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952179606] [2025-01-09 20:45:35,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952179606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:45:35,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:45:35,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:45:35,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750837858] [2025-01-09 20:45:35,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:45:35,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:45:35,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:35,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:45:35,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:45:35,129 INFO L87 Difference]: Start difference. First operand 2597 states and 4099 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:35,439 INFO L93 Difference]: Finished difference Result 3742 states and 6287 transitions. [2025-01-09 20:45:35,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:45:35,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 849 [2025-01-09 20:45:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:35,447 INFO L225 Difference]: With dead ends: 3742 [2025-01-09 20:45:35,447 INFO L226 Difference]: Without dead ends: 2605 [2025-01-09 20:45:35,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:45:35,451 INFO L435 NwaCegarLoop]: 2346 mSDtfsCounter, 24 mSDsluCounter, 13656 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 16002 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:35,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 16002 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:45:35,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2025-01-09 20:45:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2597. [2025-01-09 20:45:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2080 states have (on average 1.4783653846153846) internal successors, (3075), 2581 states have internal predecessors, (3075), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 20:45:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 4099 transitions. [2025-01-09 20:45:35,622 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 4099 transitions. Word has length 849 [2025-01-09 20:45:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:35,623 INFO L471 AbstractCegarLoop]: Abstraction has 2597 states and 4099 transitions. [2025-01-09 20:45:35,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 4099 transitions. [2025-01-09 20:45:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 20:45:35,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:35,631 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-01-09 20:45:35,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:45:35,632 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:35,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1704743531, now seen corresponding path program 1 times [2025-01-09 20:45:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:35,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011582084] [2025-01-09 20:45:35,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:35,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:35,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-01-09 20:45:35,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-01-09 20:45:35,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:35,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 20:45:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:37,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011582084] [2025-01-09 20:45:37,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011582084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:45:37,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:45:37,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:45:37,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556378089] [2025-01-09 20:45:37,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:45:37,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:45:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:37,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:45:37,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:45:37,499 INFO L87 Difference]: Start difference. First operand 2597 states and 4099 transitions. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:45:37,897 INFO L93 Difference]: Finished difference Result 3745 states and 6292 transitions. [2025-01-09 20:45:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:45:37,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2025-01-09 20:45:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:45:37,912 INFO L225 Difference]: With dead ends: 3745 [2025-01-09 20:45:37,913 INFO L226 Difference]: Without dead ends: 2608 [2025-01-09 20:45:37,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:45:37,916 INFO L435 NwaCegarLoop]: 2347 mSDtfsCounter, 31 mSDsluCounter, 16014 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18361 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:45:37,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18361 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:45:37,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2025-01-09 20:45:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2605. [2025-01-09 20:45:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 2088 states have (on average 1.4774904214559388) internal successors, (3085), 2589 states have internal predecessors, (3085), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 20:45:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4109 transitions. [2025-01-09 20:45:38,126 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4109 transitions. Word has length 850 [2025-01-09 20:45:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:45:38,127 INFO L471 AbstractCegarLoop]: Abstraction has 2605 states and 4109 transitions. [2025-01-09 20:45:38,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:45:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4109 transitions. [2025-01-09 20:45:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 20:45:38,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:45:38,135 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-01-09 20:45:38,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:45:38,136 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:45:38,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:45:38,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1011640351, now seen corresponding path program 1 times [2025-01-09 20:45:38,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:45:38,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378297334] [2025-01-09 20:45:38,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:45:38,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 20:45:38,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 20:45:38,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:38,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:45:45,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:45:45,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378297334] [2025-01-09 20:45:45,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378297334] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:45:45,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456471884] [2025-01-09 20:45:45,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:45:45,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:45:45,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:45:45,602 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:45:45,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 20:45:46,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 20:45:46,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 20:45:46,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:45:46,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:45:46,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 4160 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 20:45:46,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:45:46,755 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-01-09 20:45:46,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:46,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:47,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:47,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:47,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:47,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:47,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:47,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:47,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:47,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 20:45:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:45:47,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:45:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:45:48,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456471884] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:45:48,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:45:48,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 48 [2025-01-09 20:45:48,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511394843] [2025-01-09 20:45:48,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:45:48,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 20:45:48,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:45:48,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 20:45:48,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=1501, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 20:45:48,366 INFO L87 Difference]: Start difference. First operand 2605 states and 4109 transitions. Second operand has 48 states, 48 states have (on average 49.604166666666664) internal successors, (2381), 48 states have internal predecessors, (2381), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)