./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_szymanski.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_szymanski.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 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:53:19,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:53:19,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:53:19,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:53:19,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:53:19,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:53:19,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:53:19,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:53:19,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:53:19,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:53:19,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:53:19,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:53:19,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:53:19,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:53:19,975 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:53:19,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:53:19,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:53:19,975 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:53:19,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:53:19,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:53:19,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:53:19,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:53:19,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:53:19,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:53:19,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:53:19,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:53:19,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:53:19,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:53:19,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:53:19,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:53:19,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:53:19,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:53:19,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:53:19,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:53:19,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:53:19,977 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:53:19,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:53:19,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:53:19,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:53:19,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:53:19,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:53:19,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:53:19,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:53:19,978 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 -> 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 [2025-02-05 16:53:20,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:53:20,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:53:20,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:53:20,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:53:20,250 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:53:20,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_szymanski.i [2025-02-05 16:53:21,523 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a2665819/fd8bd3a6ac3e44b08eaf6dbc9fa71ab1/FLAG808d40d0d [2025-02-05 16:53:21,874 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:53:21,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i [2025-02-05 16:53:21,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a2665819/fd8bd3a6ac3e44b08eaf6dbc9fa71ab1/FLAG808d40d0d [2025-02-05 16:53:21,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a2665819/fd8bd3a6ac3e44b08eaf6dbc9fa71ab1 [2025-02-05 16:53:21,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:53:21,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:53:21,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:53:21,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:53:21,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:53:21,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:53:21" (1/1) ... [2025-02-05 16:53:21,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549819a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:21, skipping insertion in model container [2025-02-05 16:53:21,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:53:21" (1/1) ... [2025-02-05 16:53:21,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:53:22,159 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/seq-pthread/cs_szymanski.i[23606,23619] [2025-02-05 16:53:22,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:53:22,245 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:53:22,267 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/seq-pthread/cs_szymanski.i[23606,23619] [2025-02-05 16:53:22,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:53:22,333 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:53:22,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22 WrapperNode [2025-02-05 16:53:22,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:53:22,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:53:22,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:53:22,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:53:22,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (1/1) ... [2025-02-05 16:53:22,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (1/1) ... [2025-02-05 16:53:22,391 INFO L138 Inliner]: procedures = 145, calls = 298, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 403 [2025-02-05 16:53:22,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:53:22,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:53:22,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:53:22,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:53:22,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (1/1) ... [2025-02-05 16:53:22,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (1/1) ... [2025-02-05 16:53:22,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (1/1) ... [2025-02-05 16:53:22,444 INFO L175 MemorySlicer]: Split 144 memory accesses to 16 slices as follows [2, 0, 8, 13, 8, 8, 5, 29, 21, 7, 7, 13, 7, 5, 5, 6]. 20 percent of accesses are in the largest equivalence class. The 40 initializations are split as follows [2, 0, 3, 0, 3, 3, 0, 9, 9, 3, 3, 0, 3, 0, 0, 2]. The 36 writes are split as follows [0, 0, 2, 1, 2, 2, 1, 11, 6, 2, 2, 1, 2, 1, 1, 2]. [2025-02-05 16:53:22,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (1/1) ... [2025-02-05 16:53:22,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (1/1) ... [2025-02-05 16:53:22,461 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (1/1) ... [2025-02-05 16:53:22,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (1/1) ... [2025-02-05 16:53:22,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (1/1) ... [2025-02-05 16:53:22,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (1/1) ... [2025-02-05 16:53:22,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:53:22,476 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:53:22,476 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:53:22,476 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:53:22,477 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (1/1) ... [2025-02-05 16:53:22,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:53:22,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:22,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:53:22,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:53:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:53:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:53:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:53:22,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:53:22,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:53:22,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:53:22,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:53:22,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:53:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:53:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:53:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:53:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:53:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:53:22,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:53:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:53:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-05 16:53:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:53:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:53:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:53:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:53:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:53:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:53:22,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:53:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:53:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:53:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:53:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:53:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:53:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:53:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:53:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:53:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-05 16:53:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:53:22,544 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:53:22,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-05 16:53:22,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-05 16:53:22,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-05 16:53:22,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-05 16:53:22,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-05 16:53:22,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-05 16:53:22,548 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:53:22,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-05 16:53:22,548 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:53:22,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:53:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:53:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:53:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:53:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:53:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:53:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:53:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:53:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:53:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 16:53:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:53:22,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:53:22,778 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:53:22,779 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:53:23,981 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-02-05 16:53:23,982 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:53:23,989 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:53:23,989 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:53:23,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:53:23 BoogieIcfgContainer [2025-02-05 16:53:23,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:53:23,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:53:23,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:53:23,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:53:23,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:53:21" (1/3) ... [2025-02-05 16:53:23,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212659fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:53:23, skipping insertion in model container [2025-02-05 16:53:23,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:22" (2/3) ... [2025-02-05 16:53:23,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212659fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:53:23, skipping insertion in model container [2025-02-05 16:53:23,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:53:23" (3/3) ... [2025-02-05 16:53:23,996 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_szymanski.i [2025-02-05 16:53:24,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:53:24,006 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_szymanski.i that has 6 procedures, 106 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 16:53:24,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:53:24,052 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;@3e3c2b8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:53:24,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:53:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 68 states have internal predecessors, (88), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 16:53:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 16:53:24,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:24,062 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:24,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:24,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1502909704, now seen corresponding path program 1 times [2025-02-05 16:53:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164416150] [2025-02-05 16:53:24,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:24,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 16:53:24,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 16:53:24,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:24,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-05 16:53:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164416150] [2025-02-05 16:53:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164416150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:24,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:53:24,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767829167] [2025-02-05 16:53:24,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:24,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:53:24,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:24,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:53:24,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:53:24,705 INFO L87 Difference]: Start difference. First operand has 106 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 68 states have internal predecessors, (88), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-05 16:53:28,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:28,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:28,786 INFO L93 Difference]: Finished difference Result 210 states and 332 transitions. [2025-02-05 16:53:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:53:28,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-02-05 16:53:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:28,802 INFO L225 Difference]: With dead ends: 210 [2025-02-05 16:53:28,803 INFO L226 Difference]: Without dead ends: 104 [2025-02-05 16:53:28,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:53:28,809 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:28,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 291 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-05 16:53:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-05 16:53:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-02-05 16:53:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 65 states have internal predecessors, (83), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 16:53:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 147 transitions. [2025-02-05 16:53:28,852 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 147 transitions. Word has length 119 [2025-02-05 16:53:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:28,853 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 147 transitions. [2025-02-05 16:53:28,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-05 16:53:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 147 transitions. [2025-02-05 16:53:28,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 16:53:28,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:28,860 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:28,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:53:28,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:28,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2026489512, now seen corresponding path program 1 times [2025-02-05 16:53:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107653641] [2025-02-05 16:53:28,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:28,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 16:53:28,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 16:53:28,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:28,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-05 16:53:29,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:29,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107653641] [2025-02-05 16:53:29,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107653641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:29,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:29,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:53:29,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396979711] [2025-02-05 16:53:29,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:29,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:53:29,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:29,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:53:29,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:53:29,161 INFO L87 Difference]: Start difference. First operand 103 states and 147 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-05 16:53:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:29,186 INFO L93 Difference]: Finished difference Result 204 states and 293 transitions. [2025-02-05 16:53:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:53:29,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2025-02-05 16:53:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:29,191 INFO L225 Difference]: With dead ends: 204 [2025-02-05 16:53:29,191 INFO L226 Difference]: Without dead ends: 104 [2025-02-05 16:53:29,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:53:29,193 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:29,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:53:29,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-05 16:53:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-05 16:53:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 16:53:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 148 transitions. [2025-02-05 16:53:29,201 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 148 transitions. Word has length 121 [2025-02-05 16:53:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:29,202 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 148 transitions. [2025-02-05 16:53:29,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-05 16:53:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 148 transitions. [2025-02-05 16:53:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 16:53:29,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:29,204 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:29,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:53:29,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:29,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:29,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1760753185, now seen corresponding path program 1 times [2025-02-05 16:53:29,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:29,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056089895] [2025-02-05 16:53:29,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:29,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:29,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 16:53:29,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 16:53:29,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:29,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-05 16:53:29,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:29,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056089895] [2025-02-05 16:53:29,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056089895] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:29,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940648293] [2025-02-05 16:53:29,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:29,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:29,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:29,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:53:29,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:53:29,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 16:53:29,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 16:53:29,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:29,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:29,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:53:29,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-05 16:53:29,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:53:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-05 16:53:29,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940648293] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:53:29,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:53:29,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 16:53:29,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672760431] [2025-02-05 16:53:29,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:53:29,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:53:29,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:29,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:53:29,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:53:29,959 INFO L87 Difference]: Start difference. First operand 104 states and 148 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 16:53:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:29,988 INFO L93 Difference]: Finished difference Result 207 states and 297 transitions. [2025-02-05 16:53:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:53:29,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 122 [2025-02-05 16:53:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:29,991 INFO L225 Difference]: With dead ends: 207 [2025-02-05 16:53:29,991 INFO L226 Difference]: Without dead ends: 106 [2025-02-05 16:53:29,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:53:29,992 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:29,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 429 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:53:29,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-05 16:53:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-05 16:53:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 16:53:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 150 transitions. [2025-02-05 16:53:30,005 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 150 transitions. Word has length 122 [2025-02-05 16:53:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:30,005 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 150 transitions. [2025-02-05 16:53:30,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-05 16:53:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 150 transitions. [2025-02-05 16:53:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 16:53:30,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:30,011 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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] [2025-02-05 16:53:30,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:53:30,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:30,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:30,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:30,213 INFO L85 PathProgramCache]: Analyzing trace with hash -609124609, now seen corresponding path program 2 times [2025-02-05 16:53:30,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:30,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586897029] [2025-02-05 16:53:30,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:53:30,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:30,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 124 statements into 2 equivalence classes. [2025-02-05 16:53:30,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 124 statements. [2025-02-05 16:53:30,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:53:30,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2025-02-05 16:53:30,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:30,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586897029] [2025-02-05 16:53:30,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586897029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:30,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:30,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:53:30,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393719706] [2025-02-05 16:53:30,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:30,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:53:30,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:30,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:53:30,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:53:30,528 INFO L87 Difference]: Start difference. First operand 106 states and 150 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-05 16:53:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:30,561 INFO L93 Difference]: Finished difference Result 202 states and 291 transitions. [2025-02-05 16:53:30,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:53:30,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2025-02-05 16:53:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:30,564 INFO L225 Difference]: With dead ends: 202 [2025-02-05 16:53:30,564 INFO L226 Difference]: Without dead ends: 160 [2025-02-05 16:53:30,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:53:30,565 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 95 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:30,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 454 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:53:30,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-05 16:53:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-05 16:53:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2025-02-05 16:53:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 229 transitions. [2025-02-05 16:53:30,579 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 229 transitions. Word has length 124 [2025-02-05 16:53:30,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:30,579 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 229 transitions. [2025-02-05 16:53:30,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-05 16:53:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 229 transitions. [2025-02-05 16:53:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 16:53:30,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:30,583 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:30,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:53:30,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:30,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:30,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1649874640, now seen corresponding path program 1 times [2025-02-05 16:53:30,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:30,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007944805] [2025-02-05 16:53:30,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:30,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:30,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 16:53:30,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 16:53:30,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:30,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2025-02-05 16:53:30,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:30,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007944805] [2025-02-05 16:53:30,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007944805] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:30,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978046968] [2025-02-05 16:53:30,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:30,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:30,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:30,870 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:53:30,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:53:31,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 16:53:31,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 16:53:31,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:31,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:31,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:53:31,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2025-02-05 16:53:31,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:53:31,521 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2025-02-05 16:53:31,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978046968] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:53:31,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:53:31,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 16:53:31,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610460538] [2025-02-05 16:53:31,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:53:31,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:53:31,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:31,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:53:31,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:53:31,523 INFO L87 Difference]: Start difference. First operand 160 states and 229 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 16:53:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:32,116 INFO L93 Difference]: Finished difference Result 322 states and 462 transitions. [2025-02-05 16:53:32,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:53:32,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 193 [2025-02-05 16:53:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:32,123 INFO L225 Difference]: With dead ends: 322 [2025-02-05 16:53:32,123 INFO L226 Difference]: Without dead ends: 170 [2025-02-05 16:53:32,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:53:32,124 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 2 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:32,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 284 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:53:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-05 16:53:32,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-05 16:53:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2025-02-05 16:53:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 241 transitions. [2025-02-05 16:53:32,136 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 241 transitions. Word has length 193 [2025-02-05 16:53:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:32,136 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 241 transitions. [2025-02-05 16:53:32,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-02-05 16:53:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 241 transitions. [2025-02-05 16:53:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 16:53:32,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:32,139 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:32,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:53:32,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:32,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:32,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:32,345 INFO L85 PathProgramCache]: Analyzing trace with hash 20728016, now seen corresponding path program 2 times [2025-02-05 16:53:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:32,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141740637] [2025-02-05 16:53:32,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:53:32,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:32,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 203 statements into 2 equivalence classes. [2025-02-05 16:53:32,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 203 statements. [2025-02-05 16:53:32,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:53:32,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-02-05 16:53:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141740637] [2025-02-05 16:53:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141740637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:32,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:32,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:53:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141626351] [2025-02-05 16:53:32,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:32,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:53:32,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:32,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:53:32,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:53:32,589 INFO L87 Difference]: Start difference. First operand 170 states and 241 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 16:53:33,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:37,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:37,948 INFO L93 Difference]: Finished difference Result 448 states and 643 transitions. [2025-02-05 16:53:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:53:37,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 203 [2025-02-05 16:53:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:37,953 INFO L225 Difference]: With dead ends: 448 [2025-02-05 16:53:37,954 INFO L226 Difference]: Without dead ends: 312 [2025-02-05 16:53:37,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:53:37,955 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 130 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:37,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 601 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-02-05 16:53:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-05 16:53:37,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2025-02-05 16:53:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 200 states have (on average 1.285) internal successors, (257), 200 states have internal predecessors, (257), 87 states have call successors, (87), 20 states have call predecessors, (87), 20 states have return successors, (102), 87 states have call predecessors, (102), 87 states have call successors, (102) [2025-02-05 16:53:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 446 transitions. [2025-02-05 16:53:37,990 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 446 transitions. Word has length 203 [2025-02-05 16:53:37,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:37,990 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 446 transitions. [2025-02-05 16:53:37,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 16:53:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 446 transitions. [2025-02-05 16:53:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 16:53:37,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:37,992 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:37,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:53:37,993 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:37,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:37,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1620946318, now seen corresponding path program 1 times [2025-02-05 16:53:37,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:37,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316443549] [2025-02-05 16:53:37,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:38,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 16:53:38,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 16:53:38,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:38,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-02-05 16:53:38,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:38,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316443549] [2025-02-05 16:53:38,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316443549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:38,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:38,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:53:38,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644122060] [2025-02-05 16:53:38,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:38,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:53:38,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:38,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:53:38,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:53:38,554 INFO L87 Difference]: Start difference. First operand 308 states and 446 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 16:53:42,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:44,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:44,569 INFO L93 Difference]: Finished difference Result 562 states and 801 transitions. [2025-02-05 16:53:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:53:44,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 203 [2025-02-05 16:53:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:44,573 INFO L225 Difference]: With dead ends: 562 [2025-02-05 16:53:44,573 INFO L226 Difference]: Without dead ends: 282 [2025-02-05 16:53:44,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:53:44,574 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 126 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:44,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 605 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2025-02-05 16:53:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-05 16:53:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 278. [2025-02-05 16:53:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 181 states have (on average 1.2430939226519337) internal successors, (225), 181 states have internal predecessors, (225), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (86), 78 states have call predecessors, (86), 78 states have call successors, (86) [2025-02-05 16:53:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 389 transitions. [2025-02-05 16:53:44,590 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 389 transitions. Word has length 203 [2025-02-05 16:53:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:44,590 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 389 transitions. [2025-02-05 16:53:44,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 16:53:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 389 transitions. [2025-02-05 16:53:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 16:53:44,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:44,597 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:44,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:53:44,597 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:44,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:44,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1484777579, now seen corresponding path program 1 times [2025-02-05 16:53:44,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:44,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798911872] [2025-02-05 16:53:44,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:44,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:44,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 16:53:44,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 16:53:44,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:44,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2025-02-05 16:53:45,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:45,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798911872] [2025-02-05 16:53:45,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798911872] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:45,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220762027] [2025-02-05 16:53:45,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:45,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:45,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:45,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:53:45,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:53:45,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 16:53:45,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 16:53:45,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:45,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:45,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 16:53:45,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 288 proven. 4 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2025-02-05 16:53:45,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:53:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2025-02-05 16:53:46,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220762027] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:53:46,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:53:46,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-05 16:53:46,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92018750] [2025-02-05 16:53:46,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:53:46,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:53:46,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:46,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:53:46,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:53:46,065 INFO L87 Difference]: Start difference. First operand 278 states and 389 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (54), 5 states have call predecessors, (54), 6 states have return successors, (55), 7 states have call predecessors, (55), 9 states have call successors, (55) [2025-02-05 16:53:50,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:50,692 INFO L93 Difference]: Finished difference Result 562 states and 800 transitions. [2025-02-05 16:53:50,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:53:50,692 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (54), 5 states have call predecessors, (54), 6 states have return successors, (55), 7 states have call predecessors, (55), 9 states have call successors, (55) Word has length 203 [2025-02-05 16:53:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:50,698 INFO L225 Difference]: With dead ends: 562 [2025-02-05 16:53:50,698 INFO L226 Difference]: Without dead ends: 308 [2025-02-05 16:53:50,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:53:50,699 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 194 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 126 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:50,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 437 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 305 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-02-05 16:53:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-05 16:53:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2025-02-05 16:53:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 203 states have (on average 1.2610837438423645) internal successors, (256), 205 states have internal predecessors, (256), 73 states have call successors, (73), 26 states have call predecessors, (73), 28 states have return successors, (93), 73 states have call predecessors, (93), 73 states have call successors, (93) [2025-02-05 16:53:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 422 transitions. [2025-02-05 16:53:50,730 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 422 transitions. Word has length 203 [2025-02-05 16:53:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:50,730 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 422 transitions. [2025-02-05 16:53:50,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (54), 5 states have call predecessors, (54), 6 states have return successors, (55), 7 states have call predecessors, (55), 9 states have call successors, (55) [2025-02-05 16:53:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 422 transitions. [2025-02-05 16:53:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 16:53:50,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:50,733 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:50,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 16:53:50,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:50,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:50,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:50,934 INFO L85 PathProgramCache]: Analyzing trace with hash -825795541, now seen corresponding path program 1 times [2025-02-05 16:53:50,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:50,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790860202] [2025-02-05 16:53:50,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:50,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:51,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 16:53:51,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 16:53:51,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:51,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2025-02-05 16:53:52,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:52,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790860202] [2025-02-05 16:53:52,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790860202] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:52,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665516781] [2025-02-05 16:53:52,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:52,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:52,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:52,698 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-02-05 16:53:52,699 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-02-05 16:53:53,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 16:53:53,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 16:53:53,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:53,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:53,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1705 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 16:53:53,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:53,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-05 16:53:55,255 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-05 16:53:55,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 15 [2025-02-05 16:53:56,424 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2025-02-05 16:53:56,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2025-02-05 16:54:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 333 proven. 4 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-02-05 16:54:19,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:54:19,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-02-05 16:54:19,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-02-05 16:54:19,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-05 16:54:19,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-02-05 16:54:19,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-05 16:54:19,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-02-05 16:54:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2025-02-05 16:54:19,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665516781] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:54:19,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:54:19,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 34 [2025-02-05 16:54:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052934448] [2025-02-05 16:54:19,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:54:19,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 16:54:19,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:54:19,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 16:54:19,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:54:19,919 INFO L87 Difference]: Start difference. First operand 305 states and 422 transitions. Second operand has 34 states, 32 states have (on average 3.875) internal successors, (124), 32 states have internal predecessors, (124), 16 states have call successors, (62), 10 states have call predecessors, (62), 13 states have return successors, (63), 15 states have call predecessors, (63), 16 states have call successors, (63) [2025-02-05 16:54:24,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:28,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:32,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 16:54:36,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:40,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:44,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:49,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:53,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:54:57,866 INFO L93 Difference]: Finished difference Result 615 states and 894 transitions. [2025-02-05 16:54:57,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 16:54:57,867 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 3.875) internal successors, (124), 32 states have internal predecessors, (124), 16 states have call successors, (62), 10 states have call predecessors, (62), 13 states have return successors, (63), 15 states have call predecessors, (63), 16 states have call successors, (63) Word has length 203 [2025-02-05 16:54:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:54:57,872 INFO L225 Difference]: With dead ends: 615 [2025-02-05 16:54:57,872 INFO L226 Difference]: Without dead ends: 368 [2025-02-05 16:54:57,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 386 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=589, Invalid=3193, Unknown=0, NotChecked=0, Total=3782 [2025-02-05 16:54:57,878 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 526 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 2740 mSolverCounterSat, 585 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 3333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 2740 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:54:57,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1554 Invalid, 3333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 2740 Invalid, 8 Unknown, 0 Unchecked, 36.7s Time] [2025-02-05 16:54:57,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-05 16:54:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 339. [2025-02-05 16:54:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 222 states have (on average 1.2522522522522523) internal successors, (278), 227 states have internal predecessors, (278), 83 states have call successors, (83), 26 states have call predecessors, (83), 33 states have return successors, (127), 85 states have call predecessors, (127), 83 states have call successors, (127) [2025-02-05 16:54:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 488 transitions. [2025-02-05 16:54:57,940 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 488 transitions. Word has length 203 [2025-02-05 16:54:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:54:57,940 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 488 transitions. [2025-02-05 16:54:57,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 3.875) internal successors, (124), 32 states have internal predecessors, (124), 16 states have call successors, (62), 10 states have call predecessors, (62), 13 states have return successors, (63), 15 states have call predecessors, (63), 16 states have call successors, (63) [2025-02-05 16:54:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 488 transitions. [2025-02-05 16:54:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-05 16:54:57,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:54:57,943 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:54:57,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 16:54:58,144 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,SelfDestructingSolverStorable8 [2025-02-05 16:54:58,144 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:54:58,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:54:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2094346636, now seen corresponding path program 1 times [2025-02-05 16:54:58,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:54:58,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238825096] [2025-02-05 16:54:58,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:54:58,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:54:58,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 16:54:58,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 16:54:58,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:54:58,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat