./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:38:51,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:38:51,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:38:51,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:38:51,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:38:51,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:38:51,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:38:51,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:38:51,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:38:51,682 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:38:51,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:38:51,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:38:51,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:38:51,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:38:51,684 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:38:51,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:38:51,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:38:51,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:38:51,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:38:51,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:38:51,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:38:51,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:38:51,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:38:51,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:38:51,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:38:51,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:38:51,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:38:51,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:38:51,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:38:51,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:38:51,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:38:51,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:38:51,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:38:51,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:38:51,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:38:51,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:38:51,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:38:51,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:38:51,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:38:51,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:38:51,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:38:51,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:38:51,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:38:51,687 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc [2025-02-06 08:38:51,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:38:51,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:38:51,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:38:51,880 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:38:51,880 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:38:51,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2025-02-06 08:38:52,996 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b4b1f375/1c7babde5829452181b3ea1cbb9eefc1/FLAG4ff7d9b8b [2025-02-06 08:38:53,464 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:38:53,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2025-02-06 08:38:53,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b4b1f375/1c7babde5829452181b3ea1cbb9eefc1/FLAG4ff7d9b8b [2025-02-06 08:38:53,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b4b1f375/1c7babde5829452181b3ea1cbb9eefc1 [2025-02-06 08:38:53,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:38:53,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:38:53,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:38:53,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:38:53,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:38:53,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:38:53" (1/1) ... [2025-02-06 08:38:53,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a07662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:53, skipping insertion in model container [2025-02-06 08:38:53,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:38:53" (1/1) ... [2025-02-06 08:38:53,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:38:53,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i[33021,33034] [2025-02-06 08:38:53,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i[84583,84596] [2025-02-06 08:38:53,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:38:54,002 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:38:54,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i[33021,33034] [2025-02-06 08:38:54,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_FNV_test9-2.i[84583,84596] [2025-02-06 08:38:54,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:38:54,154 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:38:54,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54 WrapperNode [2025-02-06 08:38:54,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:38:54,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:38:54,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:38:54,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:38:54,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (1/1) ... [2025-02-06 08:38:54,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (1/1) ... [2025-02-06 08:38:54,291 INFO L138 Inliner]: procedures = 177, calls = 773, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3403 [2025-02-06 08:38:54,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:38:54,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:38:54,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:38:54,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:38:54,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (1/1) ... [2025-02-06 08:38:54,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (1/1) ... [2025-02-06 08:38:54,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (1/1) ... [2025-02-06 08:38:54,381 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-02-06 08:38:54,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (1/1) ... [2025-02-06 08:38:54,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (1/1) ... [2025-02-06 08:38:54,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (1/1) ... [2025-02-06 08:38:54,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (1/1) ... [2025-02-06 08:38:54,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (1/1) ... [2025-02-06 08:38:54,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (1/1) ... [2025-02-06 08:38:54,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:38:54,464 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:38:54,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:38:54,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:38:54,465 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (1/1) ... [2025-02-06 08:38:54,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:38:54,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:38:54,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:38:54,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:38:54,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:38:54,511 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:38:54,511 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:38:54,511 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:38:54,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:38:54,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:38:54,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:38:54,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:38:54,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:38:54,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:38:54,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:38:54,679 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:38:54,680 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:38:56,623 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:38:56,828 INFO L? ?]: Removed 823 outVars from TransFormulas that were not future-live. [2025-02-06 08:38:56,829 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:38:56,903 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:38:56,906 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:38:56,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:38:56 BoogieIcfgContainer [2025-02-06 08:38:56,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:38:56,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:38:56,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:38:56,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:38:56,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:38:53" (1/3) ... [2025-02-06 08:38:56,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d511624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:38:56, skipping insertion in model container [2025-02-06 08:38:56,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:38:54" (2/3) ... [2025-02-06 08:38:56,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d511624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:38:56, skipping insertion in model container [2025-02-06 08:38:56,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:38:56" (3/3) ... [2025-02-06 08:38:56,914 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test9-2.i [2025-02-06 08:38:56,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:38:56,924 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test9-2.i that has 5 procedures, 1409 locations, 1 initial locations, 38 loop locations, and 2 error locations. [2025-02-06 08:38:56,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:38:57,003 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;@6685677a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:38:57,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 08:38:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 1401 states, 893 states have (on average 1.8297872340425532) internal successors, (1634), 1395 states have internal predecessors, (1634), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-02-06 08:38:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 08:38:57,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:38:57,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:38:57,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:38:57,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:38:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash -904108323, now seen corresponding path program 1 times [2025-02-06 08:38:57,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:38:57,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172224033] [2025-02-06 08:38:57,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:38:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:38:57,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 08:38:57,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 08:38:57,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:38:57,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:38:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:38:57,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:38:57,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172224033] [2025-02-06 08:38:57,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172224033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:38:57,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:38:57,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:38:57,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913735298] [2025-02-06 08:38:57,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:38:57,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:38:57,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:38:57,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:38:57,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:38:57,159 INFO L87 Difference]: Start difference. First operand has 1401 states, 893 states have (on average 1.8297872340425532) internal successors, (1634), 1395 states have internal predecessors, (1634), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:38:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:38:57,419 INFO L93 Difference]: Finished difference Result 2800 states and 5778 transitions. [2025-02-06 08:38:57,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:38:57,421 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-02-06 08:38:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:38:57,439 INFO L225 Difference]: With dead ends: 2800 [2025-02-06 08:38:57,439 INFO L226 Difference]: Without dead ends: 1364 [2025-02-06 08:38:57,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:38:57,449 INFO L435 NwaCegarLoop]: 2534 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:38:57,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2534 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:38:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-02-06 08:38:57,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2025-02-06 08:38:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 857 states have (on average 1.7736289381563595) internal successors, (1520), 1358 states have internal predecessors, (1520), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-02-06 08:38:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2526 transitions. [2025-02-06 08:38:57,735 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2526 transitions. Word has length 9 [2025-02-06 08:38:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:38:57,736 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2526 transitions. [2025-02-06 08:38:57,736 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-02-06 08:38:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2526 transitions. [2025-02-06 08:38:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 08:38:57,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:38:57,741 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-02-06 08:38:57,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:38:57,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:38:57,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:38:57,742 INFO L85 PathProgramCache]: Analyzing trace with hash -603747245, now seen corresponding path program 1 times [2025-02-06 08:38:57,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:38:57,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821376413] [2025-02-06 08:38:57,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:38:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:38:57,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 08:38:57,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 08:38:57,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:38:57,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:38:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:38:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:38:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821376413] [2025-02-06 08:38:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821376413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:38:58,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:38:58,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:38:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923936138] [2025-02-06 08:38:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:38:58,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:38:58,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:38:58,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:38:58,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:38:58,085 INFO L87 Difference]: Start difference. First operand 1364 states and 2526 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-02-06 08:38:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:38:58,915 INFO L93 Difference]: Finished difference Result 3880 states and 7279 transitions. [2025-02-06 08:38:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:38:58,917 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-02-06 08:38:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:38:58,938 INFO L225 Difference]: With dead ends: 3880 [2025-02-06 08:38:58,938 INFO L226 Difference]: Without dead ends: 2715 [2025-02-06 08:38:58,948 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-02-06 08:38:58,948 INFO L435 NwaCegarLoop]: 2759 mSDtfsCounter, 1505 mSDsluCounter, 4719 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 7478 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:38:58,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 7478 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:38:58,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2025-02-06 08:38:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 1366. [2025-02-06 08:38:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 859 states have (on average 1.7718277066356227) internal successors, (1522), 1360 states have internal predecessors, (1522), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-02-06 08:38:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2528 transitions. [2025-02-06 08:38:59,197 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2528 transitions. Word has length 63 [2025-02-06 08:38:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:38:59,198 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 2528 transitions. [2025-02-06 08:38:59,199 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-02-06 08:38:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2528 transitions. [2025-02-06 08:38:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 08:38:59,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:38:59,207 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:38:59,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:38:59,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:38:59,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:38:59,208 INFO L85 PathProgramCache]: Analyzing trace with hash 174221936, now seen corresponding path program 1 times [2025-02-06 08:38:59,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:38:59,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126808140] [2025-02-06 08:38:59,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:38:59,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:38:59,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 08:38:59,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 08:38:59,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:38:59,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:38:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:38:59,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:38:59,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126808140] [2025-02-06 08:38:59,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126808140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:38:59,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:38:59,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:38:59,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060140290] [2025-02-06 08:38:59,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:38:59,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:38:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:38:59,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:38:59,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:38:59,553 INFO L87 Difference]: Start difference. First operand 1366 states and 2528 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:38:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:38:59,737 INFO L93 Difference]: Finished difference Result 2686 states and 4986 transitions. [2025-02-06 08:38:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:38:59,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 138 [2025-02-06 08:38:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:38:59,749 INFO L225 Difference]: With dead ends: 2686 [2025-02-06 08:38:59,749 INFO L226 Difference]: Without dead ends: 1324 [2025-02-06 08:38:59,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:38:59,756 INFO L435 NwaCegarLoop]: 2393 mSDtfsCounter, 30 mSDsluCounter, 4767 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7160 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:38:59,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7160 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:38:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2025-02-06 08:38:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2025-02-06 08:38:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 817 states have (on average 1.7686658506731947) internal successors, (1445), 1318 states have internal predecessors, (1445), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-02-06 08:38:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2451 transitions. [2025-02-06 08:38:59,894 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2451 transitions. Word has length 138 [2025-02-06 08:38:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:38:59,894 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 2451 transitions. [2025-02-06 08:38:59,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:38:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2451 transitions. [2025-02-06 08:38:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 08:38:59,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:38:59,899 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:38:59,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:38:59,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:38:59,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:38:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1776411721, now seen corresponding path program 1 times [2025-02-06 08:38:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:38:59,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270291739] [2025-02-06 08:38:59,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:38:59,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:38:59,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 08:38:59,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 08:38:59,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:38:59,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:39:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:39:00,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:39:00,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270291739] [2025-02-06 08:39:00,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270291739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:39:00,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:39:00,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:39:00,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564753500] [2025-02-06 08:39:00,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:39:00,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:39:00,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:39:00,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:39:00,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:39:00,051 INFO L87 Difference]: Start difference. First operand 1324 states and 2451 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:39:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:39:00,286 INFO L93 Difference]: Finished difference Result 3867 states and 7220 transitions. [2025-02-06 08:39:00,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:39:00,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 138 [2025-02-06 08:39:00,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:39:00,304 INFO L225 Difference]: With dead ends: 3867 [2025-02-06 08:39:00,304 INFO L226 Difference]: Without dead ends: 2547 [2025-02-06 08:39:00,309 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-02-06 08:39:00,310 INFO L435 NwaCegarLoop]: 2839 mSDtfsCounter, 1260 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 5236 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:39:00,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 5236 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:39:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2025-02-06 08:39:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2545. [2025-02-06 08:39:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 1538 states have (on average 1.7971391417425226) internal successors, (2764), 2539 states have internal predecessors, (2764), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-02-06 08:39:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4770 transitions. [2025-02-06 08:39:00,535 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4770 transitions. Word has length 138 [2025-02-06 08:39:00,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:39:00,536 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4770 transitions. [2025-02-06 08:39:00,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:39:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4770 transitions. [2025-02-06 08:39:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:39:00,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:39:00,538 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:39:00,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:39:00,538 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:39:00,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:39:00,539 INFO L85 PathProgramCache]: Analyzing trace with hash 856799395, now seen corresponding path program 1 times [2025-02-06 08:39:00,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:39:00,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018957623] [2025-02-06 08:39:00,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:39:00,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:39:00,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:39:00,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:39:00,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:39:00,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:39:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:39:00,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:39:00,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018957623] [2025-02-06 08:39:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018957623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:39:00,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:39:00,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:39:00,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51013050] [2025-02-06 08:39:00,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:39:00,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:39:00,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:39:00,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:39:00,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:39:00,712 INFO L87 Difference]: Start difference. First operand 2545 states and 4770 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:39:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:39:00,870 INFO L93 Difference]: Finished difference Result 4884 states and 9270 transitions. [2025-02-06 08:39:00,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:39:00,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-02-06 08:39:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:39:00,887 INFO L225 Difference]: With dead ends: 4884 [2025-02-06 08:39:00,887 INFO L226 Difference]: Without dead ends: 2585 [2025-02-06 08:39:00,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:39:00,893 INFO L435 NwaCegarLoop]: 2391 mSDtfsCounter, 8 mSDsluCounter, 2376 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:39:00,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4767 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:39:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2025-02-06 08:39:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2585. [2025-02-06 08:39:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 1578 states have (on average 1.7769328263624842) internal successors, (2804), 2579 states have internal predecessors, (2804), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-02-06 08:39:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 4810 transitions. [2025-02-06 08:39:01,107 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 4810 transitions. Word has length 153 [2025-02-06 08:39:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:39:01,108 INFO L471 AbstractCegarLoop]: Abstraction has 2585 states and 4810 transitions. [2025-02-06 08:39:01,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:39:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 4810 transitions. [2025-02-06 08:39:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:39:01,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:39:01,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:39:01,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:39:01,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:39:01,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:39:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1428064060, now seen corresponding path program 1 times [2025-02-06 08:39:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:39:01,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242707557] [2025-02-06 08:39:01,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:39:01,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:39:01,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:39:01,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:39:01,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:39:01,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:39:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:39:01,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:39:01,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242707557] [2025-02-06 08:39:01,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242707557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:39:01,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:39:01,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:39:01,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230173069] [2025-02-06 08:39:01,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:39:01,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:39:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:39:01,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:39:01,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:39:01,303 INFO L87 Difference]: Start difference. First operand 2585 states and 4810 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:39:01,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:39:01,518 INFO L93 Difference]: Finished difference Result 4800 states and 9112 transitions. [2025-02-06 08:39:01,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:39:01,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-02-06 08:39:01,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:39:01,538 INFO L225 Difference]: With dead ends: 4800 [2025-02-06 08:39:01,539 INFO L226 Difference]: Without dead ends: 2461 [2025-02-06 08:39:01,546 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-02-06 08:39:01,547 INFO L435 NwaCegarLoop]: 2316 mSDtfsCounter, 32 mSDsluCounter, 4618 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6934 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:39:01,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6934 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:39:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2025-02-06 08:39:01,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2461. [2025-02-06 08:39:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 1454 states have (on average 1.7909215955983493) internal successors, (2604), 2455 states have internal predecessors, (2604), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-02-06 08:39:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 4610 transitions. [2025-02-06 08:39:01,815 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 4610 transitions. Word has length 153 [2025-02-06 08:39:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:39:01,816 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 4610 transitions. [2025-02-06 08:39:01,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:39:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 4610 transitions. [2025-02-06 08:39:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:39:01,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:39:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:39:01,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:39:01,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:39:01,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:39:01,819 INFO L85 PathProgramCache]: Analyzing trace with hash -552241123, now seen corresponding path program 1 times [2025-02-06 08:39:01,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:39:01,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105406529] [2025-02-06 08:39:01,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:39:01,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:39:01,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:39:01,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:39:01,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:39:01,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:39:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:39:02,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:39:02,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105406529] [2025-02-06 08:39:02,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105406529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:39:02,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:39:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:39:02,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116116367] [2025-02-06 08:39:02,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:39:02,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:39:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:39:02,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:39:02,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:39:02,048 INFO L87 Difference]: Start difference. First operand 2461 states and 4610 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:39:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:39:03,080 INFO L93 Difference]: Finished difference Result 3739 states and 6977 transitions. [2025-02-06 08:39:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:39:03,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-02-06 08:39:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:39:03,091 INFO L225 Difference]: With dead ends: 3739 [2025-02-06 08:39:03,091 INFO L226 Difference]: Without dead ends: 1368 [2025-02-06 08:39:03,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:39:03,098 INFO L435 NwaCegarLoop]: 2398 mSDtfsCounter, 2543 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1003 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2543 SdHoareTripleChecker+Valid, 3528 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:39:03,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2543 Valid, 3528 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:39:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2025-02-06 08:39:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1368. [2025-02-06 08:39:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 861 states have (on average 1.718931475029036) internal successors, (1480), 1362 states have internal predecessors, (1480), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-02-06 08:39:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2486 transitions. [2025-02-06 08:39:03,208 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2486 transitions. Word has length 153 [2025-02-06 08:39:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:39:03,208 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 2486 transitions. [2025-02-06 08:39:03,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:39:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2486 transitions. [2025-02-06 08:39:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 08:39:03,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:39:03,210 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:39:03,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:39:03,210 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:39:03,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:39:03,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1275535695, now seen corresponding path program 1 times [2025-02-06 08:39:03,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:39:03,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146625083] [2025-02-06 08:39:03,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:39:03,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:39:03,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:39:03,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:39:03,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:39:03,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:39:03,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:39:03,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:39:03,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146625083] [2025-02-06 08:39:03,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146625083] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:39:03,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889916561] [2025-02-06 08:39:03,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:39:03,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:39:03,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:39:03,772 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:39:03,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:39:03,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:39:04,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:39:04,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:39:04,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:39:04,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 08:39:04,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:39:04,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:39:04,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 08:39:04,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:39:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:39:04,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:39:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:39:04,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889916561] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:39:04,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:39:04,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-06 08:39:04,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196219789] [2025-02-06 08:39:04,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:39:04,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:39:04,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:39:04,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:39:04,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:39:04,403 INFO L87 Difference]: Start difference. First operand 1368 states and 2486 transitions. Second operand has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:39:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:39:08,952 INFO L93 Difference]: Finished difference Result 5211 states and 9603 transitions. [2025-02-06 08:39:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:39:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 163 [2025-02-06 08:39:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:39:08,973 INFO L225 Difference]: With dead ends: 5211 [2025-02-06 08:39:08,973 INFO L226 Difference]: Without dead ends: 4088 [2025-02-06 08:39:08,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 319 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-02-06 08:39:08,977 INFO L435 NwaCegarLoop]: 1861 mSDtfsCounter, 7224 mSDsluCounter, 11495 mSDsCounter, 0 mSdLazyCounter, 4804 mSolverCounterSat, 1509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8228 SdHoareTripleChecker+Valid, 13356 SdHoareTripleChecker+Invalid, 6313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1509 IncrementalHoareTripleChecker+Valid, 4804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:39:08,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8228 Valid, 13356 Invalid, 6313 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1509 Valid, 4804 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 08:39:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2025-02-06 08:39:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 1710. [2025-02-06 08:39:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1199 states have (on average 1.6113427856547122) internal successors, (1932), 1700 states have internal predecessors, (1932), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2025-02-06 08:39:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2944 transitions. [2025-02-06 08:39:09,322 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2944 transitions. Word has length 163 [2025-02-06 08:39:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:39:09,322 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 2944 transitions. [2025-02-06 08:39:09,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.272727272727273) internal successors, (322), 11 states have internal predecessors, (322), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:39:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2944 transitions. [2025-02-06 08:39:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-06 08:39:09,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:39:09,328 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:39:09,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:39:09,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:39:09,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:39:09,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:39:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash -893393691, now seen corresponding path program 1 times [2025-02-06 08:39:09,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:39:09,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921400532] [2025-02-06 08:39:09,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:39:09,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:39:09,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 08:39:09,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 08:39:09,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:39:09,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:39:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:39:11,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:39:11,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921400532] [2025-02-06 08:39:11,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921400532] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:39:11,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786706760] [2025-02-06 08:39:11,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:39:11,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:39:11,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:39:11,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:39:11,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:39:12,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 08:39:12,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 08:39:12,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:39:12,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:39:12,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 08:39:12,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:39:12,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:39:12,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 08:39:12,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:39:12,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:39:13,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:39:13,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:39:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:39:13,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:39:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:39:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786706760] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:39:13,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:39:13,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-02-06 08:39:13,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056404081] [2025-02-06 08:39:13,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:39:13,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 08:39:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:39:13,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 08:39:13,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-02-06 08:39:13,628 INFO L87 Difference]: Start difference. First operand 1710 states and 2944 transitions. Second operand has 20 states, 20 states have (on average 38.9) internal successors, (778), 20 states have internal predecessors, (778), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:39:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:39:22,699 INFO L93 Difference]: Finished difference Result 10527 states and 19360 transitions. [2025-02-06 08:39:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 08:39:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.9) internal successors, (778), 20 states have internal predecessors, (778), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 388 [2025-02-06 08:39:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:39:22,745 INFO L225 Difference]: With dead ends: 10527 [2025-02-06 08:39:22,745 INFO L226 Difference]: Without dead ends: 9404 [2025-02-06 08:39:22,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 795 GetRequests, 768 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-02-06 08:39:22,752 INFO L435 NwaCegarLoop]: 1861 mSDtfsCounter, 21468 mSDsluCounter, 14056 mSDsCounter, 0 mSdLazyCounter, 8545 mSolverCounterSat, 3926 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24478 SdHoareTripleChecker+Valid, 15917 SdHoareTripleChecker+Invalid, 12471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3926 IncrementalHoareTripleChecker+Valid, 8545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:39:22,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24478 Valid, 15917 Invalid, 12471 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3926 Valid, 8545 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2025-02-06 08:39:22,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9404 states. [2025-02-06 08:39:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9404 to 2562. [2025-02-06 08:39:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2045 states have (on average 1.4992665036674817) internal successors, (3066), 2546 states have internal predecessors, (3066), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-02-06 08:39:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 4090 transitions. [2025-02-06 08:39:23,545 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 4090 transitions. Word has length 388 [2025-02-06 08:39:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:39:23,545 INFO L471 AbstractCegarLoop]: Abstraction has 2562 states and 4090 transitions. [2025-02-06 08:39:23,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.9) internal successors, (778), 20 states have internal predecessors, (778), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:39:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 4090 transitions. [2025-02-06 08:39:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-06 08:39:23,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:39:23,557 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:39:23,569 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-02-06 08:39:23,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:39:23,761 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:39:23,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:39:23,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2045648347, now seen corresponding path program 2 times [2025-02-06 08:39:23,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:39:23,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690373460] [2025-02-06 08:39:23,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:39:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:39:23,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 838 statements into 2 equivalence classes. [2025-02-06 08:39:24,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 838 statements. [2025-02-06 08:39:24,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:39:24,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:39:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 08:39:24,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:39:24,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690373460] [2025-02-06 08:39:24,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690373460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:39:24,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:39:24,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:39:24,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270247716] [2025-02-06 08:39:24,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:39:24,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:39:24,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:39:24,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:39:24,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:39:24,173 INFO L87 Difference]: Start difference. First operand 2562 states and 4090 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:39:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:39:24,589 INFO L93 Difference]: Finished difference Result 3689 states and 6255 transitions. [2025-02-06 08:39:24,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:39:24,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 838 [2025-02-06 08:39:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:39:24,602 INFO L225 Difference]: With dead ends: 3689 [2025-02-06 08:39:24,602 INFO L226 Difference]: Without dead ends: 2567 [2025-02-06 08:39:24,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:39:24,608 INFO L435 NwaCegarLoop]: 2323 mSDtfsCounter, 14 mSDsluCounter, 9028 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11351 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:39:24,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11351 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:39:24,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2025-02-06 08:39:24,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2564. [2025-02-06 08:39:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2047 states have (on average 1.4987787005373718) internal successors, (3068), 2548 states have internal predecessors, (3068), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-02-06 08:39:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 4092 transitions. [2025-02-06 08:39:24,870 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 4092 transitions. Word has length 838 [2025-02-06 08:39:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:39:24,871 INFO L471 AbstractCegarLoop]: Abstraction has 2564 states and 4092 transitions. [2025-02-06 08:39:24,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:39:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 4092 transitions. [2025-02-06 08:39:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-02-06 08:39:24,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:39:24,890 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:39:24,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:39:24,890 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:39:24,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:39:24,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1871294308, now seen corresponding path program 1 times [2025-02-06 08:39:24,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:39:24,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951675897] [2025-02-06 08:39:24,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:39:24,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:39:25,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-02-06 08:39:25,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-02-06 08:39:25,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:39:25,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:39:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 08:39:26,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:39:26,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951675897] [2025-02-06 08:39:26,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951675897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:39:26,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:39:26,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:39:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749424982] [2025-02-06 08:39:26,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:39:26,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:39:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:39:26,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:39:26,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:39:26,297 INFO L87 Difference]: Start difference. First operand 2564 states and 4092 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:39:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:39:26,605 INFO L93 Difference]: Finished difference Result 3693 states and 6259 transitions. [2025-02-06 08:39:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:39:26,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 839 [2025-02-06 08:39:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:39:26,615 INFO L225 Difference]: With dead ends: 3693 [2025-02-06 08:39:26,616 INFO L226 Difference]: Without dead ends: 2569 [2025-02-06 08:39:26,619 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-02-06 08:39:26,620 INFO L435 NwaCegarLoop]: 2318 mSDtfsCounter, 15 mSDsluCounter, 11304 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 13622 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:39:26,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 13622 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:39:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2025-02-06 08:39:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2568. [2025-02-06 08:39:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 2051 states have (on average 1.4982935153583619) internal successors, (3073), 2552 states have internal predecessors, (3073), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-02-06 08:39:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 4097 transitions. [2025-02-06 08:39:26,819 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 4097 transitions. Word has length 839 [2025-02-06 08:39:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:39:26,820 INFO L471 AbstractCegarLoop]: Abstraction has 2568 states and 4097 transitions. [2025-02-06 08:39:26,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:39:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 4097 transitions. [2025-02-06 08:39:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-02-06 08:39:26,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:39:26,837 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:39:26,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:39:26,837 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:39:26,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:39:26,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1324876515, now seen corresponding path program 1 times [2025-02-06 08:39:26,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:39:26,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785437772] [2025-02-06 08:39:26,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:39:26,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:39:27,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-02-06 08:39:27,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-02-06 08:39:27,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:39:27,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:39:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:39:35,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:39:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785437772] [2025-02-06 08:39:35,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785437772] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:39:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700456157] [2025-02-06 08:39:35,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:39:35,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:39:35,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:39:35,900 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-02-06 08:39:35,901 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-02-06 08:39:36,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-02-06 08:39:36,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-02-06 08:39:36,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:39:36,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:39:36,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 4161 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 08:39:36,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:39:36,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 08:39:37,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 08:39:37,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:39:37,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:39:37,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:39:37,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:39:37,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:39:37,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:39:37,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:39:37,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:39:37,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 08:39:37,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 08:39:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:39:37,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:39:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:39:38,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700456157] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:39:38,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:39:38,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 38 [2025-02-06 08:39:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809364717] [2025-02-06 08:39:38,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:39:38,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 08:39:38,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:39:38,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 08:39:38,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=836, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 08:39:38,898 INFO L87 Difference]: Start difference. First operand 2568 states and 4097 transitions. Second operand has 38 states, 38 states have (on average 44.5) internal successors, (1691), 38 states have internal predecessors, (1691), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:40:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:40:00,455 INFO L93 Difference]: Finished difference Result 19011 states and 34668 transitions. [2025-02-06 08:40:00,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-06 08:40:00,457 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 44.5) internal successors, (1691), 38 states have internal predecessors, (1691), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 839 [2025-02-06 08:40:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:40:00,504 INFO L225 Difference]: With dead ends: 19011 [2025-02-06 08:40:00,504 INFO L226 Difference]: Without dead ends: 17882 [2025-02-06 08:40:00,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1717 GetRequests, 1666 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 08:40:00,512 INFO L435 NwaCegarLoop]: 1861 mSDtfsCounter, 41445 mSDsluCounter, 31195 mSDsCounter, 0 mSdLazyCounter, 20623 mSolverCounterSat, 4571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47467 SdHoareTripleChecker+Valid, 33056 SdHoareTripleChecker+Invalid, 25194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4571 IncrementalHoareTripleChecker+Valid, 20623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:40:00,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47467 Valid, 33056 Invalid, 25194 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4571 Valid, 20623 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time] [2025-02-06 08:40:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17882 states. [2025-02-06 08:40:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17882 to 4272. [2025-02-06 08:40:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4272 states, 3743 states have (on average 1.4269302698370292) internal successors, (5341), 4244 states have internal predecessors, (5341), 524 states have call successors, (524), 3 states have call predecessors, (524), 3 states have return successors, (524), 25 states have call predecessors, (524), 524 states have call successors, (524) [2025-02-06 08:40:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 6389 transitions. [2025-02-06 08:40:01,770 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 6389 transitions. Word has length 839 [2025-02-06 08:40:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:40:01,771 INFO L471 AbstractCegarLoop]: Abstraction has 4272 states and 6389 transitions. [2025-02-06 08:40:01,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 44.5) internal successors, (1691), 38 states have internal predecessors, (1691), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:40:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 6389 transitions. [2025-02-06 08:40:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1740 [2025-02-06 08:40:01,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:40:01,788 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:40:01,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 08:40:01,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:40:01,994 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:40:01,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:40:01,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1184742755, now seen corresponding path program 2 times [2025-02-06 08:40:01,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:40:01,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684555520] [2025-02-06 08:40:01,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:40:01,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:40:02,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1739 statements into 2 equivalence classes. [2025-02-06 08:40:02,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 74 of 1739 statements. [2025-02-06 08:40:02,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:40:02,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:40:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-06 08:40:02,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:40:02,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684555520] [2025-02-06 08:40:02,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684555520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:40:02,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:40:02,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:40:02,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41502780] [2025-02-06 08:40:02,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:40:02,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:40:02,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:40:02,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:40:02,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:40:02,561 INFO L87 Difference]: Start difference. First operand 4272 states and 6389 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:40:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:40:02,755 INFO L93 Difference]: Finished difference Result 5400 states and 8553 transitions. [2025-02-06 08:40:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:40:02,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 1739 [2025-02-06 08:40:02,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:40:02,767 INFO L225 Difference]: With dead ends: 5400 [2025-02-06 08:40:02,767 INFO L226 Difference]: Without dead ends: 4272 [2025-02-06 08:40:02,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:40:02,770 INFO L435 NwaCegarLoop]: 2327 mSDtfsCounter, 17 mSDsluCounter, 4539 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6866 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:40:02,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6866 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:40:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2025-02-06 08:40:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 4272. [2025-02-06 08:40:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4272 states, 3743 states have (on average 1.4266631044616618) internal successors, (5340), 4244 states have internal predecessors, (5340), 524 states have call successors, (524), 3 states have call predecessors, (524), 3 states have return successors, (524), 25 states have call predecessors, (524), 524 states have call successors, (524) [2025-02-06 08:40:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 6388 transitions. [2025-02-06 08:40:02,953 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 6388 transitions. Word has length 1739 [2025-02-06 08:40:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:40:02,954 INFO L471 AbstractCegarLoop]: Abstraction has 4272 states and 6388 transitions. [2025-02-06 08:40:02,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:40:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 6388 transitions. [2025-02-06 08:40:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2025-02-06 08:40:02,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:40:02,969 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:40:02,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:40:02,970 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:40:02,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:40:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash 150769352, now seen corresponding path program 1 times [2025-02-06 08:40:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:40:02,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580732183] [2025-02-06 08:40:02,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:40:02,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:40:03,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1740 statements into 1 equivalence classes. [2025-02-06 08:40:03,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1740 of 1740 statements. [2025-02-06 08:40:03,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:40:03,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat