./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-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_SFH_test8-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:00:02,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:00:03,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 21:00:03,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:00:03,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:00:03,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:00:03,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:00:03,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:00:03,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:00:03,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:00:03,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:00:03,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:00:03,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:00:03,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:00:03,080 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:00:03,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:00:03,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:00:03,081 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:00:03,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:00:03,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:00:03,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:00:03,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:00:03,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:00:03,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:00:03,081 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:00:03,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:00:03,082 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:00:03,082 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:00:03,082 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:00:03,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:00:03,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:00:03,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:00:03,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:00:03,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:00:03,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:00:03,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:00:03,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:00:03,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:00:03,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:00:03,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:00:03,083 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:00:03,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:00:03,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:00:03,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:00:03,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:00:03,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:00:03,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:00:03,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:00:03,084 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 -> dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd [2025-01-09 21:00:03,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:00:03,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:00:03,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:00:03,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:00:03,307 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:00:03,308 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_SFH_test8-2.i [2025-01-09 21:00:04,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a779f8d5/4dd5cb669e8a4552be09e17de4383c1d/FLAGeac4c1281 [2025-01-09 21:00:04,747 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:00:04,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2025-01-09 21:00:04,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a779f8d5/4dd5cb669e8a4552be09e17de4383c1d/FLAGeac4c1281 [2025-01-09 21:00:04,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a779f8d5/4dd5cb669e8a4552be09e17de4383c1d [2025-01-09 21:00:04,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:00:04,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:00:04,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:00:04,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:00:04,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:00:04,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:00:04" (1/1) ... [2025-01-09 21:00:04,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218fa8d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:04, skipping insertion in model container [2025-01-09 21:00:04,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:00:04" (1/1) ... [2025-01-09 21:00:04,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:00:05,037 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_SFH_test8-2.i[33021,33034] [2025-01-09 21:00:05,120 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_SFH_test8-2.i[45234,45247] [2025-01-09 21:00:05,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:00:05,140 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:00:05,169 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_SFH_test8-2.i[33021,33034] [2025-01-09 21:00:05,234 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_SFH_test8-2.i[45234,45247] [2025-01-09 21:00:05,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:00:05,270 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:00:05,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05 WrapperNode [2025-01-09 21:00:05,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:00:05,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:00:05,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:00:05,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:00:05,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,348 INFO L138 Inliner]: procedures = 177, calls = 340, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1540 [2025-01-09 21:00:05,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:00:05,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:00:05,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:00:05,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:00:05,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,425 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 34, 268]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2025-01-09 21:00:05,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,465 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:00:05,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:00:05,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:00:05,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:00:05,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (1/1) ... [2025-01-09 21:00:05,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:00:05,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:05,554 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 21:00:05,563 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 21:00:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 21:00:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 21:00:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 21:00:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 21:00:05,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 21:00:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 21:00:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 21:00:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 21:00:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 21:00:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 21:00:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 21:00:05,594 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 21:00:05,594 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 21:00:05,594 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 21:00:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-01-09 21:00:05,594 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-01-09 21:00:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:00:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:00:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:00:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:00:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 21:00:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:00:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:00:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:00:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 21:00:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:00:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 21:00:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 21:00:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 21:00:05,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:00:05,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:00:05,785 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:00:05,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:00:07,046 INFO L? ?]: Removed 354 outVars from TransFormulas that were not future-live. [2025-01-09 21:00:07,046 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:00:07,056 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:00:07,057 INFO L312 CfgBuilder]: Removed 35 assume(true) statements. [2025-01-09 21:00:07,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:00:07 BoogieIcfgContainer [2025-01-09 21:00:07,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:00:07,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:00:07,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:00:07,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:00:07,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:00:04" (1/3) ... [2025-01-09 21:00:07,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c5effc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:00:07, skipping insertion in model container [2025-01-09 21:00:07,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:00:05" (2/3) ... [2025-01-09 21:00:07,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c5effc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:00:07, skipping insertion in model container [2025-01-09 21:00:07,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:00:07" (3/3) ... [2025-01-09 21:00:07,063 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test8-2.i [2025-01-09 21:00:07,072 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:00:07,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test8-2.i that has 6 procedures, 475 locations, 1 initial locations, 42 loop locations, and 2 error locations. [2025-01-09 21:00:07,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:00:07,136 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;@716ca095, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:00:07,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:00:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 467 states, 441 states have (on average 1.6213151927437641) internal successors, (715), 458 states have internal predecessors, (715), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 21:00:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 21:00:07,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:07,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:07,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:07,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash -978364192, now seen corresponding path program 1 times [2025-01-09 21:00:07,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:07,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187086951] [2025-01-09 21:00:07,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:07,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:07,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 21:00:07,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 21:00:07,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:07,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:07,244 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 21:00:07,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:07,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187086951] [2025-01-09 21:00:07,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187086951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:07,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:07,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:00:07,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835700241] [2025-01-09 21:00:07,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:07,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:00:07,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:07,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:00:07,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:00:07,267 INFO L87 Difference]: Start difference. First operand has 467 states, 441 states have (on average 1.6213151927437641) internal successors, (715), 458 states have internal predecessors, (715), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.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 21:00:07,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:07,327 INFO L93 Difference]: Finished difference Result 932 states and 1525 transitions. [2025-01-09 21:00:07,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:00:07,329 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 21:00:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:07,337 INFO L225 Difference]: With dead ends: 932 [2025-01-09 21:00:07,337 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 21:00:07,340 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 21:00:07,342 INFO L435 NwaCegarLoop]: 683 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, 683 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 21:00:07,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:00:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 21:00:07,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2025-01-09 21:00:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 405 states have (on average 1.4641975308641975) internal successors, (593), 421 states have internal predecessors, (593), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 21:00:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 633 transitions. [2025-01-09 21:00:07,401 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 633 transitions. Word has length 9 [2025-01-09 21:00:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:07,401 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 633 transitions. [2025-01-09 21:00:07,401 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 21:00:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 633 transitions. [2025-01-09 21:00:07,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 21:00:07,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:07,405 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 21:00:07,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:00:07,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:07,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:07,406 INFO L85 PathProgramCache]: Analyzing trace with hash -739758881, now seen corresponding path program 1 times [2025-01-09 21:00:07,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:07,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901872958] [2025-01-09 21:00:07,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:07,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:07,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:00:07,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:00:07,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:07,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:07,830 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 21:00:07,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:07,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901872958] [2025-01-09 21:00:07,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901872958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:07,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:07,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:00:07,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018449351] [2025-01-09 21:00:07,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:07,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:00:07,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:07,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:00:07,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:00:07,832 INFO L87 Difference]: Start difference. First operand 430 states and 633 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 21:00:07,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:07,991 INFO L93 Difference]: Finished difference Result 1040 states and 1532 transitions. [2025-01-09 21:00:07,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:00:07,992 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 21:00:07,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:07,996 INFO L225 Difference]: With dead ends: 1040 [2025-01-09 21:00:07,999 INFO L226 Difference]: Without dead ends: 813 [2025-01-09 21:00:07,999 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 21:00:08,000 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 545 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:08,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1834 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:00:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-01-09 21:00:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 432. [2025-01-09 21:00:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 407 states have (on average 1.461916461916462) internal successors, (595), 423 states have internal predecessors, (595), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 21:00:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 635 transitions. [2025-01-09 21:00:08,019 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 635 transitions. Word has length 63 [2025-01-09 21:00:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:08,020 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 635 transitions. [2025-01-09 21:00:08,020 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 21:00:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 635 transitions. [2025-01-09 21:00:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 21:00:08,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:08,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:08,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:00:08,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:08,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:08,022 INFO L85 PathProgramCache]: Analyzing trace with hash -113861570, now seen corresponding path program 1 times [2025-01-09 21:00:08,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:08,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113625257] [2025-01-09 21:00:08,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:08,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:08,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:00:08,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:00:08,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:08,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:08,263 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 21:00:08,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:08,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113625257] [2025-01-09 21:00:08,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113625257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:08,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:08,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:00:08,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360925607] [2025-01-09 21:00:08,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:08,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:00:08,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:08,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:00:08,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:00:08,264 INFO L87 Difference]: Start difference. First operand 432 states and 635 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:00:08,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:08,352 INFO L93 Difference]: Finished difference Result 818 states and 1200 transitions. [2025-01-09 21:00:08,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:00:08,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-01-09 21:00:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:08,354 INFO L225 Difference]: With dead ends: 818 [2025-01-09 21:00:08,356 INFO L226 Difference]: Without dead ends: 390 [2025-01-09 21:00:08,356 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 21:00:08,357 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 33 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:08,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1573 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:00:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-01-09 21:00:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-01-09 21:00:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 365 states have (on average 1.4191780821917808) internal successors, (518), 381 states have internal predecessors, (518), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 21:00:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 558 transitions. [2025-01-09 21:00:08,378 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 558 transitions. Word has length 85 [2025-01-09 21:00:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:08,378 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 558 transitions. [2025-01-09 21:00:08,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:00:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 558 transitions. [2025-01-09 21:00:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 21:00:08,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:08,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:08,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:00:08,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:08,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash -226195348, now seen corresponding path program 1 times [2025-01-09 21:00:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793639854] [2025-01-09 21:00:08,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:08,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:00:08,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:00:08,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:08,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:08,539 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 21:00:08,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:08,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793639854] [2025-01-09 21:00:08,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793639854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:08,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:08,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:00:08,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778659045] [2025-01-09 21:00:08,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:08,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:00:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:08,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:00:08,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:00:08,542 INFO L87 Difference]: Start difference. First operand 390 states and 558 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:00:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:08,591 INFO L93 Difference]: Finished difference Result 770 states and 1106 transitions. [2025-01-09 21:00:08,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:00:08,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-01-09 21:00:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:08,593 INFO L225 Difference]: With dead ends: 770 [2025-01-09 21:00:08,593 INFO L226 Difference]: Without dead ends: 384 [2025-01-09 21:00:08,594 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 21:00:08,594 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 9 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:08,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1574 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:00:08,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-01-09 21:00:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-01-09 21:00:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 359 states have (on average 1.415041782729805) internal successors, (508), 375 states have internal predecessors, (508), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 21:00:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 548 transitions. [2025-01-09 21:00:08,612 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 548 transitions. Word has length 85 [2025-01-09 21:00:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:08,613 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 548 transitions. [2025-01-09 21:00:08,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:00:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 548 transitions. [2025-01-09 21:00:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 21:00:08,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:08,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:08,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:00:08,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:08,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:08,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1778442124, now seen corresponding path program 1 times [2025-01-09 21:00:08,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:08,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939080734] [2025-01-09 21:00:08,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:08,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:08,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:00:08,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:00:08,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:08,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:08,754 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 21:00:08,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:08,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939080734] [2025-01-09 21:00:08,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939080734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:08,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:08,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:00:08,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214874280] [2025-01-09 21:00:08,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:08,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:00:08,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:08,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:00:08,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:00:08,757 INFO L87 Difference]: Start difference. First operand 384 states and 548 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:00:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:08,831 INFO L93 Difference]: Finished difference Result 1009 states and 1443 transitions. [2025-01-09 21:00:08,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:00:08,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-01-09 21:00:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:08,837 INFO L225 Difference]: With dead ends: 1009 [2025-01-09 21:00:08,838 INFO L226 Difference]: Without dead ends: 629 [2025-01-09 21:00:08,839 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 21:00:08,843 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 290 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:08,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1256 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:00:08,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-01-09 21:00:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2025-01-09 21:00:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 600 states have (on average 1.4216666666666666) internal successors, (853), 616 states have internal predecessors, (853), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 21:00:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 895 transitions. [2025-01-09 21:00:08,880 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 895 transitions. Word has length 85 [2025-01-09 21:00:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:08,881 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 895 transitions. [2025-01-09 21:00:08,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:00:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 895 transitions. [2025-01-09 21:00:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 21:00:08,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:08,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:08,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:00:08,885 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:08,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:08,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1339815681, now seen corresponding path program 1 times [2025-01-09 21:00:08,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:08,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528112971] [2025-01-09 21:00:08,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:08,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:08,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:00:09,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:00:09,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:09,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:00:09,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:09,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528112971] [2025-01-09 21:00:09,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528112971] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:09,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953742809] [2025-01-09 21:00:09,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:09,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:09,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:09,244 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 21:00:09,248 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 21:00:09,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:00:09,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:00:09,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:09,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:09,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 21:00:09,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:09,543 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 21:00:09,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-01-09 21:00:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:00:10,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:00:10,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953742809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:10,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:00:10,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-09 21:00:10,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135588706] [2025-01-09 21:00:10,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:10,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:00:10,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:10,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:00:10,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:00:10,239 INFO L87 Difference]: Start difference. First operand 626 states and 895 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:11,642 INFO L93 Difference]: Finished difference Result 1497 states and 2151 transitions. [2025-01-09 21:00:11,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:00:11,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-09 21:00:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:11,647 INFO L225 Difference]: With dead ends: 1497 [2025-01-09 21:00:11,647 INFO L226 Difference]: Without dead ends: 909 [2025-01-09 21:00:11,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-01-09 21:00:11,650 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 554 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:11,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 3587 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 21:00:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-01-09 21:00:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 626. [2025-01-09 21:00:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 600 states have (on average 1.42) internal successors, (852), 616 states have internal predecessors, (852), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 21:00:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 894 transitions. [2025-01-09 21:00:11,680 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 894 transitions. Word has length 100 [2025-01-09 21:00:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:11,681 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 894 transitions. [2025-01-09 21:00:11,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 894 transitions. [2025-01-09 21:00:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 21:00:11,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:11,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:11,696 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 21:00:11,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:11,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:11,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:11,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1449226799, now seen corresponding path program 1 times [2025-01-09 21:00:11,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:11,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3495307] [2025-01-09 21:00:11,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:11,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:11,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:00:12,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:00:12,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:12,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:00:12,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:12,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3495307] [2025-01-09 21:00:12,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3495307] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:12,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690970099] [2025-01-09 21:00:12,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:12,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:12,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:12,178 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 21:00:12,179 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 21:00:12,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:00:12,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:00:12,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:12,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:12,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 21:00:12,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:12,722 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 21:00:12,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-01-09 21:00:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:00:13,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:00:13,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690970099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:13,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:00:13,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-01-09 21:00:13,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642573392] [2025-01-09 21:00:13,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:13,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 21:00:13,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:13,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 21:00:13,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-01-09 21:00:13,428 INFO L87 Difference]: Start difference. First operand 626 states and 894 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:14,514 INFO L93 Difference]: Finished difference Result 1497 states and 2150 transitions. [2025-01-09 21:00:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:00:14,515 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-01-09 21:00:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:14,519 INFO L225 Difference]: With dead ends: 1497 [2025-01-09 21:00:14,519 INFO L226 Difference]: Without dead ends: 914 [2025-01-09 21:00:14,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-01-09 21:00:14,521 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 603 mSDsluCounter, 2734 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 3241 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:14,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 3241 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 21:00:14,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-01-09 21:00:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 630. [2025-01-09 21:00:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 604 states have (on average 1.4188741721854305) internal successors, (857), 620 states have internal predecessors, (857), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 21:00:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 899 transitions. [2025-01-09 21:00:14,540 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 899 transitions. Word has length 101 [2025-01-09 21:00:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:14,540 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 899 transitions. [2025-01-09 21:00:14,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 899 transitions. [2025-01-09 21:00:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 21:00:14,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:14,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:14,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:00:14,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:14,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:14,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:14,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1248815187, now seen corresponding path program 1 times [2025-01-09 21:00:14,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:14,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239296373] [2025-01-09 21:00:14,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:14,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:14,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:00:14,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:00:14,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:14,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:00:14,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:14,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239296373] [2025-01-09 21:00:14,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239296373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:14,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:14,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:00:14,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089180330] [2025-01-09 21:00:14,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:14,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:00:14,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:14,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:00:14,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:00:14,999 INFO L87 Difference]: Start difference. First operand 630 states and 899 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:15,235 INFO L93 Difference]: Finished difference Result 1218 states and 1753 transitions. [2025-01-09 21:00:15,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:00:15,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-01-09 21:00:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:15,238 INFO L225 Difference]: With dead ends: 1218 [2025-01-09 21:00:15,238 INFO L226 Difference]: Without dead ends: 640 [2025-01-09 21:00:15,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:00:15,239 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 10 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:15,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2835 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:00:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-01-09 21:00:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 638. [2025-01-09 21:00:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 612 states have (on average 1.4166666666666667) internal successors, (867), 628 states have internal predecessors, (867), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 21:00:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 909 transitions. [2025-01-09 21:00:15,255 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 909 transitions. Word has length 102 [2025-01-09 21:00:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:15,255 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 909 transitions. [2025-01-09 21:00:15,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 909 transitions. [2025-01-09 21:00:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 21:00:15,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:15,256 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:15,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:00:15,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:15,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:15,256 INFO L85 PathProgramCache]: Analyzing trace with hash -228439078, now seen corresponding path program 1 times [2025-01-09 21:00:15,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:15,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4788997] [2025-01-09 21:00:15,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:15,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:15,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:00:15,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:00:15,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:15,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:00:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:15,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4788997] [2025-01-09 21:00:15,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4788997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:15,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:15,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:00:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524431564] [2025-01-09 21:00:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:15,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:00:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:15,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:00:15,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:00:15,511 INFO L87 Difference]: Start difference. First operand 638 states and 909 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:15,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:15,688 INFO L93 Difference]: Finished difference Result 1233 states and 1773 transitions. [2025-01-09 21:00:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:00:15,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-01-09 21:00:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:15,693 INFO L225 Difference]: With dead ends: 1233 [2025-01-09 21:00:15,694 INFO L226 Difference]: Without dead ends: 644 [2025-01-09 21:00:15,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:00:15,695 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 5 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:15,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1942 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:00:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-01-09 21:00:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2025-01-09 21:00:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 618 states have (on average 1.412621359223301) internal successors, (873), 634 states have internal predecessors, (873), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 21:00:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 915 transitions. [2025-01-09 21:00:15,711 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 915 transitions. Word has length 102 [2025-01-09 21:00:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:15,712 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 915 transitions. [2025-01-09 21:00:15,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 915 transitions. [2025-01-09 21:00:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 21:00:15,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:15,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:15,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:00:15,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:15,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:15,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1089808347, now seen corresponding path program 1 times [2025-01-09 21:00:15,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:15,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313406170] [2025-01-09 21:00:15,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:15,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:15,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:00:15,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:00:15,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:15,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:00:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:16,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313406170] [2025-01-09 21:00:16,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313406170] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:16,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36817050] [2025-01-09 21:00:16,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:16,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:16,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:16,006 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 21:00:16,007 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 21:00:16,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:00:16,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:00:16,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:16,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:16,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 21:00:16,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:00:16,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:00:16,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36817050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:16,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:00:16,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 21:00:16,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966970724] [2025-01-09 21:00:16,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:16,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:00:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:16,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:00:16,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:00:16,319 INFO L87 Difference]: Start difference. First operand 644 states and 915 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:16,550 INFO L93 Difference]: Finished difference Result 1249 states and 1791 transitions. [2025-01-09 21:00:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:00:16,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-01-09 21:00:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:16,553 INFO L225 Difference]: With dead ends: 1249 [2025-01-09 21:00:16,553 INFO L226 Difference]: Without dead ends: 650 [2025-01-09 21:00:16,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:00:16,554 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 33 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2864 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:16,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2864 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:00:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-01-09 21:00:16,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 644. [2025-01-09 21:00:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 618 states have (on average 1.4077669902912622) internal successors, (870), 634 states have internal predecessors, (870), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 21:00:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 912 transitions. [2025-01-09 21:00:16,576 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 912 transitions. Word has length 103 [2025-01-09 21:00:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:16,576 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 912 transitions. [2025-01-09 21:00:16,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 912 transitions. [2025-01-09 21:00:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 21:00:16,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:16,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:16,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 21:00:16,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:16,782 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:16,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:16,783 INFO L85 PathProgramCache]: Analyzing trace with hash 10807118, now seen corresponding path program 1 times [2025-01-09 21:00:16,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:16,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795440132] [2025-01-09 21:00:16,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:16,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:16,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:00:16,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:00:16,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:16,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:00:17,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:17,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795440132] [2025-01-09 21:00:17,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795440132] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:17,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650005526] [2025-01-09 21:00:17,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:17,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:17,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:17,083 INFO L229 MonitoredProcess]: Starting monitored process 5 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 21:00:17,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:00:17,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 21:00:17,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 21:00:17,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:17,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:17,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 21:00:17,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:00:17,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:00:17,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650005526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:17,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:00:17,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 21:00:17,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555564632] [2025-01-09 21:00:17,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:17,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:00:17,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:17,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:00:17,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:00:17,384 INFO L87 Difference]: Start difference. First operand 644 states and 912 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 21:00:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:17,411 INFO L93 Difference]: Finished difference Result 1197 states and 1710 transitions. [2025-01-09 21:00:17,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:00:17,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2025-01-09 21:00:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:17,414 INFO L225 Difference]: With dead ends: 1197 [2025-01-09 21:00:17,414 INFO L226 Difference]: Without dead ends: 647 [2025-01-09 21:00:17,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:00:17,415 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 0 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:17,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1622 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:00:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-01-09 21:00:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2025-01-09 21:00:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 620 states have (on average 1.4080645161290322) internal successors, (873), 637 states have internal predecessors, (873), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:00:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 916 transitions. [2025-01-09 21:00:17,434 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 916 transitions. Word has length 103 [2025-01-09 21:00:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:17,434 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 916 transitions. [2025-01-09 21:00:17,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 21:00:17,434 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 916 transitions. [2025-01-09 21:00:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 21:00:17,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:17,436 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] [2025-01-09 21:00:17,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:00:17,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 21:00:17,640 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:17,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash 189448812, now seen corresponding path program 1 times [2025-01-09 21:00:17,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:17,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567971696] [2025-01-09 21:00:17,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:17,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:17,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:00:17,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:00:17,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:17,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:00:17,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567971696] [2025-01-09 21:00:17,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567971696] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122497380] [2025-01-09 21:00:17,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:17,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:17,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:17,958 INFO L229 MonitoredProcess]: Starting monitored process 6 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 21:00:17,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:00:18,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:00:18,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:00:18,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:18,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:18,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:00:18,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 21:00:29,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:00:29,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122497380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:29,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:00:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-01-09 21:00:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056240865] [2025-01-09 21:00:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:29,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:00:29,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:29,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:00:29,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:00:29,769 INFO L87 Difference]: Start difference. First operand 647 states and 916 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:34,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:00:39,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:00:43,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:00:45,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:00:50,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:00:56,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:00:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:56,779 INFO L93 Difference]: Finished difference Result 1247 states and 1783 transitions. [2025-01-09 21:00:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:00:56,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-01-09 21:00:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:56,786 INFO L225 Difference]: With dead ends: 1247 [2025-01-09 21:00:56,786 INFO L226 Difference]: Without dead ends: 657 [2025-01-09 21:00:56,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:00:56,787 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 8 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:56,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2842 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 423 Invalid, 4 Unknown, 0 Unchecked, 27.0s Time] [2025-01-09 21:00:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-01-09 21:00:56,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 647. [2025-01-09 21:00:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 620 states have (on average 1.4080645161290322) internal successors, (873), 637 states have internal predecessors, (873), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:00:56,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 916 transitions. [2025-01-09 21:00:56,802 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 916 transitions. Word has length 105 [2025-01-09 21:00:56,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:56,802 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 916 transitions. [2025-01-09 21:00:56,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 916 transitions. [2025-01-09 21:00:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 21:00:56,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:56,804 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] [2025-01-09 21:00:56,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 21:00:57,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 21:00:57,004 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:57,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:57,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2028018204, now seen corresponding path program 1 times [2025-01-09 21:00:57,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:57,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175881796] [2025-01-09 21:00:57,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:57,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:57,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:00:57,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:00:57,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:57,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 21:00:57,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:57,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175881796] [2025-01-09 21:00:57,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175881796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:57,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:57,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:00:57,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78855710] [2025-01-09 21:00:57,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:57,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:00:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:57,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:00:57,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:00:57,327 INFO L87 Difference]: Start difference. First operand 647 states and 916 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:57,796 INFO L93 Difference]: Finished difference Result 1269 states and 1812 transitions. [2025-01-09 21:00:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:00:57,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-01-09 21:00:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:57,799 INFO L225 Difference]: With dead ends: 1269 [2025-01-09 21:00:57,799 INFO L226 Difference]: Without dead ends: 679 [2025-01-09 21:00:57,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:00:57,800 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 19 mSDsluCounter, 3756 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4288 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:57,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4288 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:00:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-01-09 21:00:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 667. [2025-01-09 21:00:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 640 states have (on average 1.4015625) internal successors, (897), 657 states have internal predecessors, (897), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:00:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 940 transitions. [2025-01-09 21:00:57,816 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 940 transitions. Word has length 107 [2025-01-09 21:00:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:57,816 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 940 transitions. [2025-01-09 21:00:57,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 940 transitions. [2025-01-09 21:00:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 21:00:57,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:57,818 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] [2025-01-09 21:00:57,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:00:57,818 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:57,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:57,819 INFO L85 PathProgramCache]: Analyzing trace with hash 146408448, now seen corresponding path program 1 times [2025-01-09 21:00:57,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:57,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659318237] [2025-01-09 21:00:57,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:57,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:00:57,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:00:57,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:57,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:00:58,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:58,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659318237] [2025-01-09 21:00:58,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659318237] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:58,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719486951] [2025-01-09 21:00:58,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:58,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:58,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:58,132 INFO L229 MonitoredProcess]: Starting monitored process 7 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 21:00:58,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 21:00:58,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:00:58,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:00:58,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:58,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:58,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 21:00:58,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 21:00:59,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:00:59,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719486951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:59,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:00:59,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-01-09 21:00:59,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462972045] [2025-01-09 21:00:59,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:59,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:00:59,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:59,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:00:59,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:00:59,349 INFO L87 Difference]: Start difference. First operand 667 states and 940 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:01:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:01:00,432 INFO L93 Difference]: Finished difference Result 1297 states and 1846 transitions. [2025-01-09 21:01:00,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:01:00,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-01-09 21:01:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:01:00,435 INFO L225 Difference]: With dead ends: 1297 [2025-01-09 21:01:00,435 INFO L226 Difference]: Without dead ends: 697 [2025-01-09 21:01:00,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:01:00,436 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 13 mSDsluCounter, 3761 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4293 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:01:00,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4293 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 21:01:00,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-01-09 21:01:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 691. [2025-01-09 21:01:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 664 states have (on average 1.3960843373493976) internal successors, (927), 681 states have internal predecessors, (927), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:01:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 970 transitions. [2025-01-09 21:01:00,452 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 970 transitions. Word has length 107 [2025-01-09 21:01:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:01:00,452 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 970 transitions. [2025-01-09 21:01:00,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:01:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 970 transitions. [2025-01-09 21:01:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 21:01:00,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:01:00,453 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] [2025-01-09 21:01:00,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 21:01:00,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 21:01:00,654 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:01:00,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:01:00,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1057091577, now seen corresponding path program 1 times [2025-01-09 21:01:00,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:01:00,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291477949] [2025-01-09 21:01:00,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:01:00,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:01:00,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:01:00,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:01:00,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:01:00,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:01:00,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:01:00,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291477949] [2025-01-09 21:01:00,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291477949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:01:00,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063519054] [2025-01-09 21:01:00,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:01:00,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:01:00,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:01:00,905 INFO L229 MonitoredProcess]: Starting monitored process 8 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 21:01:00,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 21:01:01,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:01:01,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:01:01,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:01:01,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:01,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 21:01:01,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:01:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 21:01:01,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:01:01,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063519054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:01:01,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:01:01,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-01-09 21:01:01,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284239461] [2025-01-09 21:01:01,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:01:01,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:01:01,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:01:01,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:01:01,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:01:01,374 INFO L87 Difference]: Start difference. First operand 691 states and 970 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:01:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:01:01,731 INFO L93 Difference]: Finished difference Result 1313 states and 1864 transitions. [2025-01-09 21:01:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:01:01,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-01-09 21:01:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:01:01,734 INFO L225 Difference]: With dead ends: 1313 [2025-01-09 21:01:01,734 INFO L226 Difference]: Without dead ends: 701 [2025-01-09 21:01:01,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:01:01,735 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 6 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:01:01,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2842 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:01:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-01-09 21:01:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 691. [2025-01-09 21:01:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 664 states have (on average 1.3960843373493976) internal successors, (927), 681 states have internal predecessors, (927), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:01:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 970 transitions. [2025-01-09 21:01:01,747 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 970 transitions. Word has length 107 [2025-01-09 21:01:01,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:01:01,747 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 970 transitions. [2025-01-09 21:01:01,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:01:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 970 transitions. [2025-01-09 21:01:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 21:01:01,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:01:01,748 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] [2025-01-09 21:01:01,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 21:01:01,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:01:01,952 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:01:01,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:01:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash -242777719, now seen corresponding path program 1 times [2025-01-09 21:01:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:01:01,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51098112] [2025-01-09 21:01:01,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:01:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:01:01,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:01:02,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:01:02,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:01:02,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:01:02,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:01:02,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51098112] [2025-01-09 21:01:02,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51098112] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:01:02,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042198046] [2025-01-09 21:01:02,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:01:02,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:01:02,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:01:02,148 INFO L229 MonitoredProcess]: Starting monitored process 9 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 21:01:02,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 21:01:02,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:01:02,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:01:02,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:01:02,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:02,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 21:01:02,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:01:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:01:02,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:01:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:01:02,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042198046] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:01:02,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:01:02,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:01:02,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994132452] [2025-01-09 21:01:02,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:01:02,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:01:02,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:01:02,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:01:02,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:01:02,858 INFO L87 Difference]: Start difference. First operand 691 states and 970 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 21:01:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:01:02,979 INFO L93 Difference]: Finished difference Result 1277 states and 1812 transitions. [2025-01-09 21:01:02,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:01:02,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 108 [2025-01-09 21:01:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:01:02,982 INFO L225 Difference]: With dead ends: 1277 [2025-01-09 21:01:02,982 INFO L226 Difference]: Without dead ends: 702 [2025-01-09 21:01:02,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:01:02,983 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 5 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:01:02,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1634 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:01:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-01-09 21:01:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 700. [2025-01-09 21:01:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 672 states have (on average 1.400297619047619) internal successors, (941), 689 states have internal predecessors, (941), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:01:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 984 transitions. [2025-01-09 21:01:03,020 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 984 transitions. Word has length 108 [2025-01-09 21:01:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:01:03,020 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 984 transitions. [2025-01-09 21:01:03,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 21:01:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 984 transitions. [2025-01-09 21:01:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 21:01:03,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:01:03,021 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2025-01-09 21:01:03,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 21:01:03,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 21:01:03,221 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:01:03,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:01:03,222 INFO L85 PathProgramCache]: Analyzing trace with hash -713866069, now seen corresponding path program 2 times [2025-01-09 21:01:03,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:01:03,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711881018] [2025-01-09 21:01:03,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:01:03,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:01:03,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-01-09 21:01:03,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 112 statements. [2025-01-09 21:01:03,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:01:03,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 21:01:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:01:03,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711881018] [2025-01-09 21:01:03,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711881018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:01:03,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:01:03,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:01:03,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496709616] [2025-01-09 21:01:03,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:01:03,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:01:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:01:03,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:01:03,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:01:03,514 INFO L87 Difference]: Start difference. First operand 700 states and 984 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:01:07,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 21:01:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:01:08,001 INFO L93 Difference]: Finished difference Result 1325 states and 1882 transitions. [2025-01-09 21:01:08,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:01:08,002 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 112 [2025-01-09 21:01:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:01:08,004 INFO L225 Difference]: With dead ends: 1325 [2025-01-09 21:01:08,004 INFO L226 Difference]: Without dead ends: 714 [2025-01-09 21:01:08,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:01:08,005 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 9 mSDsluCounter, 3713 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4236 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 21:01:08,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4236 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 695 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 21:01:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-01-09 21:01:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 700. [2025-01-09 21:01:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 672 states have (on average 1.400297619047619) internal successors, (941), 689 states have internal predecessors, (941), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:01:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 984 transitions. [2025-01-09 21:01:08,039 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 984 transitions. Word has length 112 [2025-01-09 21:01:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:01:08,039 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 984 transitions. [2025-01-09 21:01:08,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:01:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 984 transitions. [2025-01-09 21:01:08,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 21:01:08,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:01:08,040 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2025-01-09 21:01:08,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:01:08,040 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:01:08,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:01:08,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1965758137, now seen corresponding path program 1 times [2025-01-09 21:01:08,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:01:08,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071951650] [2025-01-09 21:01:08,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:01:08,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:01:08,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 21:01:08,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 21:01:08,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:01:08,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:01:08,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:01:08,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071951650] [2025-01-09 21:01:08,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071951650] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:01:08,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760080201] [2025-01-09 21:01:08,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:01:08,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:01:08,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:01:08,378 INFO L229 MonitoredProcess]: Starting monitored process 10 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 21:01:08,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 21:01:08,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 21:01:08,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 21:01:08,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:01:08,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:08,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 21:01:08,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:01:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:01:08,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:01:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 26 refuted. 1 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:01:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760080201] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:01:13,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:01:13,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2025-01-09 21:01:13,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099232239] [2025-01-09 21:01:13,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:01:13,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 21:01:13,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:01:13,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 21:01:13,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=271, Unknown=1, NotChecked=0, Total=380 [2025-01-09 21:01:13,117 INFO L87 Difference]: Start difference. First operand 700 states and 984 transitions. Second operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 21:01:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:01:13,797 INFO L93 Difference]: Finished difference Result 1303 states and 1851 transitions. [2025-01-09 21:01:13,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:01:13,798 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-01-09 21:01:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:01:13,800 INFO L225 Difference]: With dead ends: 1303 [2025-01-09 21:01:13,800 INFO L226 Difference]: Without dead ends: 713 [2025-01-09 21:01:13,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=256, Invalid=555, Unknown=1, NotChecked=0, Total=812 [2025-01-09 21:01:13,801 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 28 mSDsluCounter, 4231 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4764 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:01:13,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4764 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:01:13,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-01-09 21:01:13,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 709. [2025-01-09 21:01:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 681 states have (on average 1.395007342143906) internal successors, (950), 698 states have internal predecessors, (950), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:01:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 993 transitions. [2025-01-09 21:01:13,814 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 993 transitions. Word has length 112 [2025-01-09 21:01:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:01:13,814 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 993 transitions. [2025-01-09 21:01:13,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 21:01:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 993 transitions. [2025-01-09 21:01:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 21:01:13,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:01:13,815 INFO L218 NwaCegarLoop]: trace histogram [15, 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] [2025-01-09 21:01:13,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 21:01:14,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 21:01:14,016 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:01:14,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:01:14,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1735149483, now seen corresponding path program 2 times [2025-01-09 21:01:14,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:01:14,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797758989] [2025-01-09 21:01:14,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:01:14,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:01:14,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 121 statements into 2 equivalence classes. [2025-01-09 21:01:14,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 121 statements. [2025-01-09 21:01:14,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:01:14,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-01-09 21:01:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:01:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797758989] [2025-01-09 21:01:14,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797758989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:01:14,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:01:14,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:01:14,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351989366] [2025-01-09 21:01:14,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:01:14,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:01:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:01:14,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:01:14,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:01:14,470 INFO L87 Difference]: Start difference. First operand 709 states and 993 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:01:18,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 21:01:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:01:18,671 INFO L93 Difference]: Finished difference Result 1352 states and 1908 transitions. [2025-01-09 21:01:18,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:01:18,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 121 [2025-01-09 21:01:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:01:18,675 INFO L225 Difference]: With dead ends: 1352 [2025-01-09 21:01:18,675 INFO L226 Difference]: Without dead ends: 727 [2025-01-09 21:01:18,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:01:18,676 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 34 mSDsluCounter, 3670 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4200 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:01:18,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4200 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 21:01:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-01-09 21:01:18,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 711. [2025-01-09 21:01:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 683 states have (on average 1.390922401171303) internal successors, (950), 700 states have internal predecessors, (950), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:01:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 993 transitions. [2025-01-09 21:01:18,690 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 993 transitions. Word has length 121 [2025-01-09 21:01:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:01:18,690 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 993 transitions. [2025-01-09 21:01:18,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:01:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 993 transitions. [2025-01-09 21:01:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 21:01:18,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:01:18,691 INFO L218 NwaCegarLoop]: trace histogram [15, 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] [2025-01-09 21:01:18,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:01:18,691 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:01:18,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:01:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash 636670344, now seen corresponding path program 1 times [2025-01-09 21:01:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:01:18,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445913305] [2025-01-09 21:01:18,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:01:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:01:18,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:01:18,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:01:18,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:01:18,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 21:01:19,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:01:19,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445913305] [2025-01-09 21:01:19,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445913305] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:01:19,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496756849] [2025-01-09 21:01:19,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:01:19,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:01:19,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:01:19,272 INFO L229 MonitoredProcess]: Starting monitored process 11 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 21:01:19,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 21:01:19,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:01:19,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:01:19,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:01:19,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:19,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 21:01:19,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:01:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-01-09 21:01:20,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:01:20,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496756849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:01:20,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:01:20,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2025-01-09 21:01:20,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065690907] [2025-01-09 21:01:20,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:01:20,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:01:20,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:01:20,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:01:20,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-01-09 21:01:20,125 INFO L87 Difference]: Start difference. First operand 711 states and 993 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:01:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:01:20,601 INFO L93 Difference]: Finished difference Result 1376 states and 1941 transitions. [2025-01-09 21:01:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:01:20,601 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 121 [2025-01-09 21:01:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:01:20,603 INFO L225 Difference]: With dead ends: 1376 [2025-01-09 21:01:20,603 INFO L226 Difference]: Without dead ends: 745 [2025-01-09 21:01:20,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-01-09 21:01:20,606 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 12 mSDsluCounter, 3742 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4261 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 21:01:20,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4261 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 21:01:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-01-09 21:01:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 725. [2025-01-09 21:01:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 697 states have (on average 1.3859397417503587) internal successors, (966), 714 states have internal predecessors, (966), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:01:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1009 transitions. [2025-01-09 21:01:20,637 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1009 transitions. Word has length 121 [2025-01-09 21:01:20,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:01:20,638 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1009 transitions. [2025-01-09 21:01:20,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:01:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1009 transitions. [2025-01-09 21:01:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 21:01:20,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:01:20,643 INFO L218 NwaCegarLoop]: trace histogram [15, 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] [2025-01-09 21:01:20,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 21:01:20,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:01:20,845 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:01:20,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:01:20,850 INFO L85 PathProgramCache]: Analyzing trace with hash -101815041, now seen corresponding path program 1 times [2025-01-09 21:01:20,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:01:20,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995294459] [2025-01-09 21:01:20,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:01:20,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:01:20,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:01:20,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:01:20,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:01:20,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 21:01:21,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:01:21,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995294459] [2025-01-09 21:01:21,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995294459] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:01:21,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469945712] [2025-01-09 21:01:21,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:01:21,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:01:21,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:01:21,301 INFO L229 MonitoredProcess]: Starting monitored process 12 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 21:01:21,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 21:01:21,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:01:21,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:01:21,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:01:21,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:01:21,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 21:01:21,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:01:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 33 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 21:01:22,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:01:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 68 proven. 13 refuted. 2 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 21:01:30,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469945712] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:01:30,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:01:30,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 28 [2025-01-09 21:01:30,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379392132] [2025-01-09 21:01:30,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:01:30,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 21:01:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:01:30,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 21:01:30,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=602, Unknown=2, NotChecked=0, Total=756 [2025-01-09 21:01:30,404 INFO L87 Difference]: Start difference. First operand 725 states and 1009 transitions. Second operand has 28 states, 28 states have (on average 4.642857142857143) internal successors, (130), 28 states have internal predecessors, (130), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 21:01:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:01:31,153 INFO L93 Difference]: Finished difference Result 1340 states and 1887 transitions. [2025-01-09 21:01:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 21:01:31,153 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.642857142857143) internal successors, (130), 28 states have internal predecessors, (130), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-01-09 21:01:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:01:31,156 INFO L225 Difference]: With dead ends: 1340 [2025-01-09 21:01:31,156 INFO L226 Difference]: Without dead ends: 735 [2025-01-09 21:01:31,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=602, Invalid=2048, Unknown=2, NotChecked=0, Total=2652 [2025-01-09 21:01:31,158 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 29 mSDsluCounter, 7523 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 8065 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:01:31,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 8065 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:01:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-01-09 21:01:31,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 733. [2025-01-09 21:01:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 705 states have (on average 1.3900709219858156) internal successors, (980), 722 states have internal predecessors, (980), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:01:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1023 transitions. [2025-01-09 21:01:31,170 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1023 transitions. Word has length 121 [2025-01-09 21:01:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:01:31,171 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 1023 transitions. [2025-01-09 21:01:31,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.642857142857143) internal successors, (130), 28 states have internal predecessors, (130), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 21:01:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1023 transitions. [2025-01-09 21:01:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 21:01:31,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:01:31,172 INFO L218 NwaCegarLoop]: trace histogram [23, 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] [2025-01-09 21:01:31,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 21:01:31,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 21:01:31,372 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:01:31,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:01:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2135598049, now seen corresponding path program 2 times [2025-01-09 21:01:31,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:01:31,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415356879] [2025-01-09 21:01:31,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:01:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:01:31,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-01-09 21:01:31,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 129 statements. [2025-01-09 21:01:31,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:01:31,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat