./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.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 adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:58:53,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:58:53,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:58:53,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:58:53,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:58:53,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:58:53,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:58:53,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:58:53,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:58:53,396 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:58:53,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:58:53,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:58:53,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:58:53,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:58:53,397 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:58:53,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:58:53,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:58:53,397 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:58:53,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:58:53,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:58:53,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:58:53,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:58:53,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:58:53,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:58:53,398 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:58:53,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:58:53,398 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:58:53,398 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:58:53,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:58:53,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:58:53,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:58:53,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:58:53,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:58:53,399 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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2025-01-09 20:58:53,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:58:53,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:58:53,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:58:53,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:58:53,630 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:58:53,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2025-01-09 20:58:54,774 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16e10626a/989e93432f1a4059b14d5ceccd125763/FLAGea3c02bfe [2025-01-09 20:58:55,064 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:58:55,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2025-01-09 20:58:55,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16e10626a/989e93432f1a4059b14d5ceccd125763/FLAGea3c02bfe [2025-01-09 20:58:55,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16e10626a/989e93432f1a4059b14d5ceccd125763 [2025-01-09 20:58:55,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:58:55,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:58:55,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:58:55,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:58:55,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:58:55,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:55,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b447e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55, skipping insertion in model container [2025-01-09 20:58:55,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:55,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:58:55,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i[33021,33034] [2025-01-09 20:58:55,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i[49681,49694] [2025-01-09 20:58:55,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:58:55,583 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:58:55,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i[33021,33034] [2025-01-09 20:58:55,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i[49681,49694] [2025-01-09 20:58:55,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:58:55,700 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:58:55,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55 WrapperNode [2025-01-09 20:58:55,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:58:55,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:58:55,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:58:55,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:58:55,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:55,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:55,790 INFO L138 Inliner]: procedures = 177, calls = 373, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1974 [2025-01-09 20:58:55,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:58:55,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:58:55,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:58:55,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:58:55,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:55,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:55,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:55,900 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2025-01-09 20:58:55,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:55,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:55,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:55,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:55,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:55,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:56,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:56,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:58:56,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:58:56,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:58:56,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:58:56,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (1/1) ... [2025-01-09 20:58:56,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:58:56,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:58:56,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:58:56,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:58:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:58:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:58:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:58:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:58:56,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:58:56,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:58:56,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:58:56,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:58:56,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:58:56,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:58:56,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:58:56,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:58:56,071 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:58:56,071 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:58:56,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:58:56,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:58:56,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:58:56,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:58:56,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:58:56,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:58:56,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:58:56,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:58:56,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:58:56,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:58:56,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:58:56,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:58:56,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:58:56,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:58:56,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:58:56,262 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:58:56,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:58:57,893 INFO L? ?]: Removed 482 outVars from TransFormulas that were not future-live. [2025-01-09 20:58:57,894 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:58:57,914 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:58:57,915 INFO L312 CfgBuilder]: Removed 39 assume(true) statements. [2025-01-09 20:58:57,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:58:57 BoogieIcfgContainer [2025-01-09 20:58:57,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:58:57,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:58:57,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:58:57,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:58:57,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:58:55" (1/3) ... [2025-01-09 20:58:57,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3dd0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:58:57, skipping insertion in model container [2025-01-09 20:58:57,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:55" (2/3) ... [2025-01-09 20:58:57,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3dd0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:58:57, skipping insertion in model container [2025-01-09 20:58:57,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:58:57" (3/3) ... [2025-01-09 20:58:57,922 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2025-01-09 20:58:57,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:58:57,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test5-1.i that has 5 procedures, 572 locations, 1 initial locations, 49 loop locations, and 2 error locations. [2025-01-09 20:58:57,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:58:57,990 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;@252fa934, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:58:57,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 20:58:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 564 states, 548 states have (on average 1.614963503649635) internal successors, (885), 555 states have internal predecessors, (885), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:58:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 20:58:58,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:58,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:58,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:58,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:58,007 INFO L85 PathProgramCache]: Analyzing trace with hash -557051575, now seen corresponding path program 1 times [2025-01-09 20:58:58,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:58,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117522280] [2025-01-09 20:58:58,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:58,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:58,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 20:58:58,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 20:58:58,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:58,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:58:58,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:58,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117522280] [2025-01-09 20:58:58,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117522280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:58,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:58,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:58:58,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939204333] [2025-01-09 20:58:58,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:58,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:58:58,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:58,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:58:58,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:58:58,162 INFO L87 Difference]: Start difference. First operand has 564 states, 548 states have (on average 1.614963503649635) internal successors, (885), 555 states have internal predecessors, (885), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:58,205 INFO L93 Difference]: Finished difference Result 1126 states and 1817 transitions. [2025-01-09 20:58:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:58:58,207 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-01-09 20:58:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:58,214 INFO L225 Difference]: With dead ends: 1126 [2025-01-09 20:58:58,215 INFO L226 Difference]: Without dead ends: 561 [2025-01-09 20:58:58,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:58:58,220 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:58,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:58:58,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-01-09 20:58:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-01-09 20:58:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 546 states have (on average 1.4615384615384615) internal successors, (798), 552 states have internal predecessors, (798), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:58:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 820 transitions. [2025-01-09 20:58:58,280 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 820 transitions. Word has length 7 [2025-01-09 20:58:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:58,281 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 820 transitions. [2025-01-09 20:58:58,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 820 transitions. [2025-01-09 20:58:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 20:58:58,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:58,283 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] [2025-01-09 20:58:58,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:58:58,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:58,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1284923811, now seen corresponding path program 1 times [2025-01-09 20:58:58,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:58,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736820686] [2025-01-09 20:58:58,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:58,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:58,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 20:58:58,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 20:58:58,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:58,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:58,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:58:58,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:58,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736820686] [2025-01-09 20:58:58,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736820686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:58,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:58,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:58:58,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778037596] [2025-01-09 20:58:58,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:58,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:58:58,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:58,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:58:58,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:58:58,464 INFO L87 Difference]: Start difference. First operand 561 states and 820 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:58,542 INFO L93 Difference]: Finished difference Result 1283 states and 1886 transitions. [2025-01-09 20:58:58,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:58:58,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2025-01-09 20:58:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:58,548 INFO L225 Difference]: With dead ends: 1283 [2025-01-09 20:58:58,548 INFO L226 Difference]: Without dead ends: 1110 [2025-01-09 20:58:58,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:58:58,550 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 784 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:58,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1678 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:58:58,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-01-09 20:58:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 562. [2025-01-09 20:58:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 547 states have (on average 1.4606946983546618) internal successors, (799), 553 states have internal predecessors, (799), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:58:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 821 transitions. [2025-01-09 20:58:58,594 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 821 transitions. Word has length 60 [2025-01-09 20:58:58,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:58,594 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 821 transitions. [2025-01-09 20:58:58,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 821 transitions. [2025-01-09 20:58:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 20:58:58,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:58,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:58,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:58:58,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:58,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1309299646, now seen corresponding path program 1 times [2025-01-09 20:58:58,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:58,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468766396] [2025-01-09 20:58:58,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:58,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:58,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 20:58:58,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 20:58:58,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:58,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:58:59,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:59,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468766396] [2025-01-09 20:58:59,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468766396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:59,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:59,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:58:59,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300804367] [2025-01-09 20:58:59,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:59,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:58:59,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:59,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:58:59,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:58:59,126 INFO L87 Difference]: Start difference. First operand 562 states and 821 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:59,241 INFO L93 Difference]: Finished difference Result 1124 states and 1642 transitions. [2025-01-09 20:58:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:58:59,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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 204 [2025-01-09 20:58:59,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:59,245 INFO L225 Difference]: With dead ends: 1124 [2025-01-09 20:58:59,245 INFO L226 Difference]: Without dead ends: 565 [2025-01-09 20:58:59,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:58:59,246 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 105 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:59,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2286 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:58:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-01-09 20:58:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 562. [2025-01-09 20:58:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 547 states have (on average 1.4478976234003655) internal successors, (792), 553 states have internal predecessors, (792), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:58:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2025-01-09 20:58:59,264 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 204 [2025-01-09 20:58:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:59,265 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2025-01-09 20:58:59,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2025-01-09 20:58:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 20:58:59,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:59,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:59,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:58:59,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:59,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1509611978, now seen corresponding path program 1 times [2025-01-09 20:58:59,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:59,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138267807] [2025-01-09 20:58:59,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:59,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:59,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 20:58:59,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 20:58:59,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:59,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:58:59,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:59,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138267807] [2025-01-09 20:58:59,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138267807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:59,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:59,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:58:59,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786450458] [2025-01-09 20:58:59,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:59,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:58:59,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:59,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:58:59,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:58:59,562 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:59,608 INFO L93 Difference]: Finished difference Result 1127 states and 1634 transitions. [2025-01-09 20:58:59,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:58:59,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 204 [2025-01-09 20:58:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:59,611 INFO L225 Difference]: With dead ends: 1127 [2025-01-09 20:58:59,611 INFO L226 Difference]: Without dead ends: 568 [2025-01-09 20:58:59,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:58:59,612 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 1 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:59,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1592 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:58:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-09 20:58:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2025-01-09 20:58:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 553 states have (on average 1.4430379746835442) internal successors, (798), 559 states have internal predecessors, (798), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:58:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 820 transitions. [2025-01-09 20:58:59,628 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 820 transitions. Word has length 204 [2025-01-09 20:58:59,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:59,628 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 820 transitions. [2025-01-09 20:58:59,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 820 transitions. [2025-01-09 20:58:59,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 20:58:59,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:59,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:59,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:58:59,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:59,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1490070856, now seen corresponding path program 1 times [2025-01-09 20:58:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:59,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497868015] [2025-01-09 20:58:59,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:59,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:59,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 20:58:59,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 20:58:59,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:58:59,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:58:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:58:59,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:58:59,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497868015] [2025-01-09 20:58:59,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497868015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:58:59,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:58:59,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:58:59,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166566743] [2025-01-09 20:58:59,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:58:59,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:58:59,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:58:59,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:58:59,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:58:59,826 INFO L87 Difference]: Start difference. First operand 568 states and 820 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:58:59,879 INFO L93 Difference]: Finished difference Result 1267 states and 1831 transitions. [2025-01-09 20:58:59,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:58:59,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 204 [2025-01-09 20:58:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:58:59,886 INFO L225 Difference]: With dead ends: 1267 [2025-01-09 20:58:59,886 INFO L226 Difference]: Without dead ends: 702 [2025-01-09 20:58:59,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:58:59,889 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 134 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:58:59,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1617 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:58:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-01-09 20:58:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-01-09 20:58:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 687 states have (on average 1.4425036390101893) internal successors, (991), 693 states have internal predecessors, (991), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:58:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1013 transitions. [2025-01-09 20:58:59,909 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1013 transitions. Word has length 204 [2025-01-09 20:58:59,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:58:59,910 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1013 transitions. [2025-01-09 20:58:59,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:58:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1013 transitions. [2025-01-09 20:58:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 20:58:59,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:58:59,913 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:58:59,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:58:59,913 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:58:59,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:58:59,914 INFO L85 PathProgramCache]: Analyzing trace with hash 233025758, now seen corresponding path program 1 times [2025-01-09 20:58:59,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:58:59,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010394110] [2025-01-09 20:58:59,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:58:59,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:58:59,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 20:59:00,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 20:59:00,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:00,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:59:00,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:00,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010394110] [2025-01-09 20:59:00,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010394110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:00,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:00,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:59:00,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919417683] [2025-01-09 20:59:00,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:00,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:59:00,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:00,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:59:00,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:59:00,341 INFO L87 Difference]: Start difference. First operand 702 states and 1013 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:00,416 INFO L93 Difference]: Finished difference Result 1225 states and 1764 transitions. [2025-01-09 20:59:00,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:59:00,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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 219 [2025-01-09 20:59:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:00,421 INFO L225 Difference]: With dead ends: 1225 [2025-01-09 20:59:00,421 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 20:59:00,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:59:00,423 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 33 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:00,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2115 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:59:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 20:59:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-01-09 20:59:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 645 states have (on average 1.4170542635658914) internal successors, (914), 651 states have internal predecessors, (914), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:59:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 936 transitions. [2025-01-09 20:59:00,444 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 936 transitions. Word has length 219 [2025-01-09 20:59:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:00,444 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 936 transitions. [2025-01-09 20:59:00,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 936 transitions. [2025-01-09 20:59:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 20:59:00,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:00,449 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:00,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:59:00,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:00,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1941717140, now seen corresponding path program 1 times [2025-01-09 20:59:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:00,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164266437] [2025-01-09 20:59:00,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:00,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:00,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 20:59:00,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 20:59:00,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:00,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:59:00,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:00,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164266437] [2025-01-09 20:59:00,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164266437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:00,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:00,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:59:00,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604831360] [2025-01-09 20:59:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:00,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:59:00,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:00,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:59:00,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:59:00,718 INFO L87 Difference]: Start difference. First operand 660 states and 936 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:00,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:00,764 INFO L93 Difference]: Finished difference Result 1183 states and 1676 transitions. [2025-01-09 20:59:00,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:59:00,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 219 [2025-01-09 20:59:00,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:00,768 INFO L225 Difference]: With dead ends: 1183 [2025-01-09 20:59:00,768 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 20:59:00,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:59:00,770 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 1 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:00,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1426 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:59:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 20:59:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-01-09 20:59:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 645 states have (on average 1.4124031007751938) internal successors, (911), 651 states have internal predecessors, (911), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 20:59:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 933 transitions. [2025-01-09 20:59:00,786 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 933 transitions. Word has length 219 [2025-01-09 20:59:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:00,787 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 933 transitions. [2025-01-09 20:59:00,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 933 transitions. [2025-01-09 20:59:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 20:59:00,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:00,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:00,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:59:00,790 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:00,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:00,790 INFO L85 PathProgramCache]: Analyzing trace with hash 81701864, now seen corresponding path program 1 times [2025-01-09 20:59:00,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:00,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285299097] [2025-01-09 20:59:00,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:00,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:00,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 20:59:00,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 20:59:00,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:00,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:59:01,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:01,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285299097] [2025-01-09 20:59:01,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285299097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:01,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:01,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:59:01,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309331374] [2025-01-09 20:59:01,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:01,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:59:01,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:01,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:59:01,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:59:01,144 INFO L87 Difference]: Start difference. First operand 660 states and 933 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:01,220 INFO L93 Difference]: Finished difference Result 1474 states and 2087 transitions. [2025-01-09 20:59:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:59:01,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 219 [2025-01-09 20:59:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:01,225 INFO L225 Difference]: With dead ends: 1474 [2025-01-09 20:59:01,225 INFO L226 Difference]: Without dead ends: 951 [2025-01-09 20:59:01,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:59:01,227 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 454 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:01,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1638 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:59:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-01-09 20:59:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 949. [2025-01-09 20:59:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 926 states have (on average 1.4136069114470842) internal successors, (1309), 937 states have internal predecessors, (1309), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:59:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1347 transitions. [2025-01-09 20:59:01,247 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1347 transitions. Word has length 219 [2025-01-09 20:59:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:01,247 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1347 transitions. [2025-01-09 20:59:01,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1347 transitions. [2025-01-09 20:59:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:59:01,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:01,250 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:01,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:59:01,250 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:01,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:01,250 INFO L85 PathProgramCache]: Analyzing trace with hash 934357344, now seen corresponding path program 1 times [2025-01-09 20:59:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:01,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425528846] [2025-01-09 20:59:01,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:01,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:59:01,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:59:01,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:01,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:59:01,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:01,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425528846] [2025-01-09 20:59:01,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425528846] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:59:01,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932070041] [2025-01-09 20:59:01,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:01,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:01,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:59:01,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:59:01,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:59:01,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:59:01,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:59:01,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:01,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:01,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:59:01,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:59:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 20:59:02,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:59:02,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932070041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:02,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:59:02,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 20:59:02,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595163278] [2025-01-09 20:59:02,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:02,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:59:02,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:02,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:59:02,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:59:02,025 INFO L87 Difference]: Start difference. First operand 949 states and 1347 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:59:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:02,096 INFO L93 Difference]: Finished difference Result 1306 states and 1885 transitions. [2025-01-09 20:59:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:59:02,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-01-09 20:59:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:02,102 INFO L225 Difference]: With dead ends: 1306 [2025-01-09 20:59:02,102 INFO L226 Difference]: Without dead ends: 989 [2025-01-09 20:59:02,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:59:02,103 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 8 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:02,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1405 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:59:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-01-09 20:59:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2025-01-09 20:59:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 966 states have (on average 1.39648033126294) internal successors, (1349), 977 states have internal predecessors, (1349), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:59:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1387 transitions. [2025-01-09 20:59:02,122 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1387 transitions. Word has length 234 [2025-01-09 20:59:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:02,122 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1387 transitions. [2025-01-09 20:59:02,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:59:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1387 transitions. [2025-01-09 20:59:02,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:59:02,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:02,125 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:02,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 20:59:02,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:02,325 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:02,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:02,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1963716642, now seen corresponding path program 1 times [2025-01-09 20:59:02,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:02,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029710303] [2025-01-09 20:59:02,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:02,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:02,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:59:02,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:59:02,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:02,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:59:02,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:02,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029710303] [2025-01-09 20:59:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029710303] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:59:02,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775612253] [2025-01-09 20:59:02,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:02,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:02,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:59:02,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:59:02,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:59:02,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:59:03,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:59:03,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:03,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:03,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:59:03,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:59:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 20:59:03,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:59:03,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775612253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:03,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:59:03,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 20:59:03,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875799071] [2025-01-09 20:59:03,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:03,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:59:03,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:03,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:59:03,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:59:03,062 INFO L87 Difference]: Start difference. First operand 989 states and 1387 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:59:03,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:03,131 INFO L93 Difference]: Finished difference Result 1318 states and 1877 transitions. [2025-01-09 20:59:03,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:59:03,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-01-09 20:59:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:03,135 INFO L225 Difference]: With dead ends: 1318 [2025-01-09 20:59:03,136 INFO L226 Difference]: Without dead ends: 961 [2025-01-09 20:59:03,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:03,137 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 106 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:03,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 2016 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:59:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-01-09 20:59:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2025-01-09 20:59:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 938 states have (on average 1.3933901918976546) internal successors, (1307), 949 states have internal predecessors, (1307), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:59:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1345 transitions. [2025-01-09 20:59:03,157 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1345 transitions. Word has length 234 [2025-01-09 20:59:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:03,158 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1345 transitions. [2025-01-09 20:59:03,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:59:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1345 transitions. [2025-01-09 20:59:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:59:03,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:03,160 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:03,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 20:59:03,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:03,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:03,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:03,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1608964078, now seen corresponding path program 1 times [2025-01-09 20:59:03,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:03,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085942360] [2025-01-09 20:59:03,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:03,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:03,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:59:03,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:59:03,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:03,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:59:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:03,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085942360] [2025-01-09 20:59:03,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085942360] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:59:03,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397379202] [2025-01-09 20:59:03,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:03,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:03,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:59:03,638 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:59:03,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 20:59:03,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:59:04,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:59:04,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:04,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:04,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 20:59:04,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:59:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 20:59:04,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:59:04,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397379202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:04,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:59:04,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 20:59:04,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885957863] [2025-01-09 20:59:04,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:04,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:59:04,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:04,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:59:04,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:59:04,104 INFO L87 Difference]: Start difference. First operand 961 states and 1345 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:59:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:04,161 INFO L93 Difference]: Finished difference Result 1182 states and 1653 transitions. [2025-01-09 20:59:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:59:04,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 234 [2025-01-09 20:59:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:04,165 INFO L225 Difference]: With dead ends: 1182 [2025-01-09 20:59:04,165 INFO L226 Difference]: Without dead ends: 853 [2025-01-09 20:59:04,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:04,167 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 9 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:04,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1865 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:59:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-01-09 20:59:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2025-01-09 20:59:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 830 states have (on average 1.3674698795180722) internal successors, (1135), 841 states have internal predecessors, (1135), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 20:59:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1173 transitions. [2025-01-09 20:59:04,190 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1173 transitions. Word has length 234 [2025-01-09 20:59:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:04,190 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1173 transitions. [2025-01-09 20:59:04,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 20:59:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1173 transitions. [2025-01-09 20:59:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 20:59:04,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:04,193 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:04,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 20:59:04,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:04,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:04,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash -579604780, now seen corresponding path program 1 times [2025-01-09 20:59:04,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:04,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307048947] [2025-01-09 20:59:04,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:04,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:59:04,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:59:04,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:04,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:59:04,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:04,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307048947] [2025-01-09 20:59:04,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307048947] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:59:04,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73746996] [2025-01-09 20:59:04,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:04,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:04,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:59:04,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:59:04,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 20:59:04,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 20:59:05,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 20:59:05,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:05,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:05,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 20:59:05,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:59:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:59:05,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:59:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:59:05,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73746996] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:59:05,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:59:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 20:59:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546602349] [2025-01-09 20:59:05,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:59:05,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:59:05,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:05,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:59:05,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:05,507 INFO L87 Difference]: Start difference. First operand 853 states and 1173 transitions. Second operand has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:59:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:05,640 INFO L93 Difference]: Finished difference Result 2180 states and 3005 transitions. [2025-01-09 20:59:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:59:05,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 234 [2025-01-09 20:59:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:05,647 INFO L225 Difference]: With dead ends: 2180 [2025-01-09 20:59:05,647 INFO L226 Difference]: Without dead ends: 1959 [2025-01-09 20:59:05,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:05,649 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 2625 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2656 SdHoareTripleChecker+Valid, 3079 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:05,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2656 Valid, 3079 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:59:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2025-01-09 20:59:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1608. [2025-01-09 20:59:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1570 states have (on average 1.3617834394904458) internal successors, (2138), 1581 states have internal predecessors, (2138), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 26 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 20:59:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2206 transitions. [2025-01-09 20:59:05,692 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2206 transitions. Word has length 234 [2025-01-09 20:59:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:05,692 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2206 transitions. [2025-01-09 20:59:05,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.42857142857143) internal successors, (528), 7 states have internal predecessors, (528), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 20:59:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2206 transitions. [2025-01-09 20:59:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-01-09 20:59:05,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:05,702 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:05,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 20:59:05,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 20:59:05,906 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:05,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1075608289, now seen corresponding path program 1 times [2025-01-09 20:59:05,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:05,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315613994] [2025-01-09 20:59:05,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:05,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:06,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-01-09 20:59:06,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-01-09 20:59:06,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:06,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 4 proven. 526 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 20:59:06,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315613994] [2025-01-09 20:59:06,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315613994] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:59:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050151903] [2025-01-09 20:59:06,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:06,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:06,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:59:06,972 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:59:06,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 20:59:07,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-01-09 20:59:07,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-01-09 20:59:07,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:07,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:07,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 3255 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 20:59:07,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:59:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:59:08,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:59:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 20:59:09,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050151903] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:59:09,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:59:09,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-01-09 20:59:09,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943375230] [2025-01-09 20:59:09,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:59:09,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 20:59:09,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:09,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 20:59:09,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-01-09 20:59:09,068 INFO L87 Difference]: Start difference. First operand 1608 states and 2206 transitions. Second operand has 16 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 20:59:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:17,353 INFO L93 Difference]: Finished difference Result 14778 states and 20405 transitions. [2025-01-09 20:59:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 20:59:17,354 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 666 [2025-01-09 20:59:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:17,406 INFO L225 Difference]: With dead ends: 14778 [2025-01-09 20:59:17,407 INFO L226 Difference]: Without dead ends: 13798 [2025-01-09 20:59:17,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1390 GetRequests, 1322 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1240, Invalid=3590, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 20:59:17,415 INFO L435 NwaCegarLoop]: 1426 mSDtfsCounter, 29716 mSDsluCounter, 13226 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29716 SdHoareTripleChecker+Valid, 14652 SdHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:17,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29716 Valid, 14652 Invalid, 2809 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [323 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-01-09 20:59:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13798 states. [2025-01-09 20:59:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13798 to 9335. [2025-01-09 20:59:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9335 states, 9205 states have (on average 1.367191743617599) internal successors, (12585), 9221 states have internal predecessors, (12585), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 20:59:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9335 states to 9335 states and 12837 transitions. [2025-01-09 20:59:17,691 INFO L78 Accepts]: Start accepts. Automaton has 9335 states and 12837 transitions. Word has length 666 [2025-01-09 20:59:17,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:17,692 INFO L471 AbstractCegarLoop]: Abstraction has 9335 states and 12837 transitions. [2025-01-09 20:59:17,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 102.6875) internal successors, (1643), 16 states have internal predecessors, (1643), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 20:59:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 9335 states and 12837 transitions. [2025-01-09 20:59:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1541 [2025-01-09 20:59:17,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:17,751 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:17,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 20:59:17,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 20:59:17,952 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:17,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash 610687114, now seen corresponding path program 1 times [2025-01-09 20:59:17,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:17,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127648044] [2025-01-09 20:59:17,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:18,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1540 statements into 1 equivalence classes.