./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_dekker.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_dekker.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 14b6c4171d4b04e355b9ddd303f20c8b3e4e81d04535a1ef986d499534108e49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:51:30,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:51:30,854 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:51:30,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:51:30,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:51:30,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:51:30,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:51:30,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:51:30,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:51:30,873 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:51:30,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:51:30,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:51:30,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:51:30,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:51:30,873 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:51:30,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:51:30,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:51:30,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:51:30,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:51:30,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:51:30,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:51:30,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:51:30,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:51:30,875 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 -> 14b6c4171d4b04e355b9ddd303f20c8b3e4e81d04535a1ef986d499534108e49 [2025-02-05 16:51:31,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:51:31,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:51:31,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:51:31,106 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:51:31,107 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:51:31,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_dekker.i [2025-02-05 16:51:32,217 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba0f406db/9cad6bbca1c945e4a3272db3e491e981/FLAG43b52c05e [2025-02-05 16:51:32,549 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:51:32,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_dekker.i [2025-02-05 16:51:32,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba0f406db/9cad6bbca1c945e4a3272db3e491e981/FLAG43b52c05e [2025-02-05 16:51:32,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba0f406db/9cad6bbca1c945e4a3272db3e491e981 [2025-02-05 16:51:32,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:51:32,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:51:32,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:51:32,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:51:32,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:51:32,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:51:32" (1/1) ... [2025-02-05 16:51:32,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c50513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:32, skipping insertion in model container [2025-02-05 16:51:32,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:51:32" (1/1) ... [2025-02-05 16:51:32,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:51:33,060 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_dekker.i[23603,23616] [2025-02-05 16:51:33,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:51:33,156 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:51:33,176 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_dekker.i[23603,23616] [2025-02-05 16:51:33,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:51:33,248 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:51:33,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:33 WrapperNode [2025-02-05 16:51:33,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:51:33,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:51:33,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:51:33,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:51:33,254 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:51:33" (1/1) ... [2025-02-05 16:51:33,268 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:51:33" (1/1) ... [2025-02-05 16:51:33,297 INFO L138 Inliner]: procedures = 145, calls = 309, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 457 [2025-02-05 16:51:33,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:51:33,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:51:33,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:51:33,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:51:33,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:33" (1/1) ... [2025-02-05 16:51:33,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:33" (1/1) ... [2025-02-05 16:51:33,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:33" (1/1) ... [2025-02-05 16:51:33,345 INFO L175 MemorySlicer]: Split 158 memory accesses to 18 slices as follows [2, 8, 8, 8, 29, 21, 5, 7, 7, 9, 7, 13, 5, 13, 5, 0, 6, 5]. 18 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 3, 3, 3, 9, 9, 0, 3, 3, 3, 3, 0, 0, 0, 0, 0, 2, 0]. The 39 writes are split as follows [0, 2, 2, 2, 11, 6, 1, 2, 2, 2, 2, 1, 1, 1, 1, 0, 2, 1]. [2025-02-05 16:51:33,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:33" (1/1) ... [2025-02-05 16:51:33,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:33" (1/1) ... [2025-02-05 16:51:33,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:33" (1/1) ... [2025-02-05 16:51:33,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:33" (1/1) ... [2025-02-05 16:51:33,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:33" (1/1) ... [2025-02-05 16:51:33,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:33" (1/1) ... [2025-02-05 16:51:33,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:51:33,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:51:33,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:51:33,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:51:33,382 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:33" (1/1) ... [2025-02-05 16:51:33,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:51:33,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:51:33,415 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:51:33,426 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:51:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:51:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:51:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:51:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:51:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:51:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:51:33,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:51:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:51:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:51:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:51:33,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:51:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:51:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:51:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:51:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:51:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-05 16:51:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-05 16:51:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-05 16:51:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:51:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:51:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:51:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:51:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:51:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:51:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:51:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:51:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:51:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:51:33,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-05 16:51:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-05 16:51:33,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-05 16:51:33,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:51:33,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 16:51:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 16:51:33,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 16:51:33,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-05 16:51:33,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-05 16:51:33,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-05 16:51:33,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-05 16:51:33,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-05 16:51:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:51:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 16:51:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 16:51:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 16:51:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:51:33,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:51:33,656 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:51:33,658 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:51:35,315 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-02-05 16:51:35,316 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:51:35,325 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:51:35,327 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:51:35,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:51:35 BoogieIcfgContainer [2025-02-05 16:51:35,328 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:51:35,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:51:35,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:51:35,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:51:35,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:51:32" (1/3) ... [2025-02-05 16:51:35,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7017e25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:51:35, skipping insertion in model container [2025-02-05 16:51:35,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:33" (2/3) ... [2025-02-05 16:51:35,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7017e25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:51:35, skipping insertion in model container [2025-02-05 16:51:35,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:51:35" (3/3) ... [2025-02-05 16:51:35,336 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_dekker.i [2025-02-05 16:51:35,350 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:51:35,351 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_dekker.i that has 6 procedures, 116 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 16:51:35,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:51:35,403 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;@57b61684, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:51:35,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:51:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 16:51:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 16:51:35,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:35,422 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:35,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:35,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 499045430, now seen corresponding path program 1 times [2025-02-05 16:51:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:35,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158612596] [2025-02-05 16:51:35,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:35,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:35,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:51:35,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:51:35,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:35,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 16:51:36,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:36,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158612596] [2025-02-05 16:51:36,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158612596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:36,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:36,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:51:36,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542212226] [2025-02-05 16:51:36,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:36,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:51:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:36,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:51:36,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:51:36,105 INFO L87 Difference]: Start difference. First operand has 116 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:51:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:36,999 INFO L93 Difference]: Finished difference Result 230 states and 367 transitions. [2025-02-05 16:51:37,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:51:37,002 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-02-05 16:51:37,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:37,008 INFO L225 Difference]: With dead ends: 230 [2025-02-05 16:51:37,010 INFO L226 Difference]: Without dead ends: 114 [2025-02-05 16:51:37,014 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:51:37,017 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 2 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:37,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 323 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:51:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-05 16:51:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-02-05 16:51:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 16:51:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2025-02-05 16:51:37,067 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 131 [2025-02-05 16:51:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:37,067 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2025-02-05 16:51:37,067 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:51:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2025-02-05 16:51:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 16:51:37,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:37,074 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:37,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:51:37,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:37,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash 552625124, now seen corresponding path program 1 times [2025-02-05 16:51:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:37,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854957363] [2025-02-05 16:51:37,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:37,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 16:51:37,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 16:51:37,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:37,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 16:51:37,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:37,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854957363] [2025-02-05 16:51:37,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854957363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:37,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:37,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:51:37,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390523193] [2025-02-05 16:51:37,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:37,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:51:37,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:37,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:51:37,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:51:37,391 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:51:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:37,422 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2025-02-05 16:51:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:51:37,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2025-02-05 16:51:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:37,424 INFO L225 Difference]: With dead ends: 224 [2025-02-05 16:51:37,424 INFO L226 Difference]: Without dead ends: 114 [2025-02-05 16:51:37,425 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:51:37,426 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 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:51:37,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:51:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-05 16:51:37,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-05 16:51:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 16:51:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-02-05 16:51:37,438 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 133 [2025-02-05 16:51:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:37,439 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-02-05 16:51:37,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:51:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-02-05 16:51:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:51:37,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:37,441 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:37,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:51:37,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:37,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:37,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2018252427, now seen corresponding path program 1 times [2025-02-05 16:51:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:37,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131043461] [2025-02-05 16:51:37,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:37,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:37,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:51:37,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:51:37,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:37,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 16:51:37,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:37,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131043461] [2025-02-05 16:51:37,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131043461] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:51:37,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171059919] [2025-02-05 16:51:37,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:37,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:51:37,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:51:37,747 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:51:37,749 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:51:38,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:51:38,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:51:38,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:38,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:38,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:51:38,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:51:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 16:51:38,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:51:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 16:51:38,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171059919] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:51:38,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:51:38,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 16:51:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845868923] [2025-02-05 16:51:38,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:51:38,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:51:38,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:38,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:51:38,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:51:38,348 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-05 16:51:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:38,391 INFO L93 Difference]: Finished difference Result 227 states and 329 transitions. [2025-02-05 16:51:38,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:51:38,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 134 [2025-02-05 16:51:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:38,394 INFO L225 Difference]: With dead ends: 227 [2025-02-05 16:51:38,394 INFO L226 Difference]: Without dead ends: 116 [2025-02-05 16:51:38,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 265 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:51:38,395 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:38,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 477 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:51:38,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-05 16:51:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-05 16:51:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 16:51:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-02-05 16:51:38,405 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 134 [2025-02-05 16:51:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:38,405 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-02-05 16:51:38,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-05 16:51:38,406 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-02-05 16:51:38,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 16:51:38,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:38,407 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:38,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:51:38,608 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:51:38,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:38,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:38,610 INFO L85 PathProgramCache]: Analyzing trace with hash -73376341, now seen corresponding path program 2 times [2025-02-05 16:51:38,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:38,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613337888] [2025-02-05 16:51:38,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:51:38,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:38,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-02-05 16:51:38,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 136 statements. [2025-02-05 16:51:38,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:51:38,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2025-02-05 16:51:38,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:38,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613337888] [2025-02-05 16:51:38,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613337888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:38,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:38,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:51:38,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052673933] [2025-02-05 16:51:38,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:38,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:51:38,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:38,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:51:38,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:51:38,878 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:51:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:38,922 INFO L93 Difference]: Finished difference Result 222 states and 323 transitions. [2025-02-05 16:51:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:51:38,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2025-02-05 16:51:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:38,928 INFO L225 Difference]: With dead ends: 222 [2025-02-05 16:51:38,929 INFO L226 Difference]: Without dead ends: 176 [2025-02-05 16:51:38,929 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:51:38,930 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 107 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 502 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:51:38,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 502 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:51:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-05 16:51:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-02-05 16:51:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 116 states have internal predecessors, (153), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-02-05 16:51:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2025-02-05 16:51:38,948 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 136 [2025-02-05 16:51:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:38,951 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2025-02-05 16:51:38,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:51:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2025-02-05 16:51:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 16:51:38,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:38,954 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:38,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:51:38,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:38,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:38,955 INFO L85 PathProgramCache]: Analyzing trace with hash 164353855, now seen corresponding path program 1 times [2025-02-05 16:51:38,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:38,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532571210] [2025-02-05 16:51:38,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:38,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:39,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 16:51:39,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 16:51:39,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:39,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2025-02-05 16:51:39,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:39,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532571210] [2025-02-05 16:51:39,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532571210] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:51:39,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206879150] [2025-02-05 16:51:39,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:39,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:51:39,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:51:39,328 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:51:39,330 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:51:39,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 16:51:39,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 16:51:39,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:39,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:39,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:51:39,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:51:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2025-02-05 16:51:39,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:51:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2025-02-05 16:51:40,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206879150] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:51:40,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:51:40,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 16:51:40,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474869530] [2025-02-05 16:51:40,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:51:40,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:51:40,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:40,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:51:40,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:51:40,051 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-02-05 16:51:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:40,966 INFO L93 Difference]: Finished difference Result 354 states and 514 transitions. [2025-02-05 16:51:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:51:40,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 220 [2025-02-05 16:51:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:40,970 INFO L225 Difference]: With dead ends: 354 [2025-02-05 16:51:40,970 INFO L226 Difference]: Without dead ends: 186 [2025-02-05 16:51:40,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 437 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:51:40,974 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 2 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 316 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.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:40,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 316 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:51:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-05 16:51:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-02-05 16:51:40,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 126 states have (on average 1.3095238095238095) internal successors, (165), 126 states have internal predecessors, (165), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-02-05 16:51:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2025-02-05 16:51:41,002 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 220 [2025-02-05 16:51:41,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:41,003 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2025-02-05 16:51:41,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-02-05 16:51:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2025-02-05 16:51:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 16:51:41,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:41,005 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:41,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:51:41,206 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:51:41,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:41,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash -389956193, now seen corresponding path program 2 times [2025-02-05 16:51:41,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:41,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201092476] [2025-02-05 16:51:41,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:51:41,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:41,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 230 statements into 2 equivalence classes. [2025-02-05 16:51:41,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 230 statements. [2025-02-05 16:51:41,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:51:41,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-02-05 16:51:41,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:41,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201092476] [2025-02-05 16:51:41,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201092476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:41,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:41,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:51:41,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078431836] [2025-02-05 16:51:41,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:41,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:51:41,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:41,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:51:41,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:51:41,533 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 16:51:46,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:51:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:46,193 INFO L93 Difference]: Finished difference Result 496 states and 721 transitions. [2025-02-05 16:51:46,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:51:46,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 230 [2025-02-05 16:51:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:46,197 INFO L225 Difference]: With dead ends: 496 [2025-02-05 16:51:46,197 INFO L226 Difference]: Without dead ends: 344 [2025-02-05 16:51:46,197 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:51:46,198 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 146 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:46,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 661 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-05 16:51:46,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-05 16:51:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 340. [2025-02-05 16:51:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 224 states have (on average 1.3080357142857142) internal successors, (293), 224 states have internal predecessors, (293), 95 states have call successors, (95), 20 states have call predecessors, (95), 20 states have return successors, (110), 95 states have call predecessors, (110), 95 states have call successors, (110) [2025-02-05 16:51:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 498 transitions. [2025-02-05 16:51:46,234 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 498 transitions. Word has length 230 [2025-02-05 16:51:46,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:46,235 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 498 transitions. [2025-02-05 16:51:46,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 16:51:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 498 transitions. [2025-02-05 16:51:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 16:51:46,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:46,239 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:46,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:51:46,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:46,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1068275201, now seen corresponding path program 1 times [2025-02-05 16:51:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:46,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551103912] [2025-02-05 16:51:46,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:46,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:46,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:51:46,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:51:46,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:46,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-02-05 16:51:47,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:47,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551103912] [2025-02-05 16:51:47,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551103912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:47,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:47,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:51:47,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703124299] [2025-02-05 16:51:47,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:47,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:51:47,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:47,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:51:47,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:51:47,011 INFO L87 Difference]: Start difference. First operand 340 states and 498 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 16:51:51,023 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:51:55,033 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:51:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:55,112 INFO L93 Difference]: Finished difference Result 620 states and 895 transitions. [2025-02-05 16:51:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:51:55,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 230 [2025-02-05 16:51:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:55,116 INFO L225 Difference]: With dead ends: 620 [2025-02-05 16:51:55,116 INFO L226 Difference]: Without dead ends: 308 [2025-02-05 16:51:55,119 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:51:55,119 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 142 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:55,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 665 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-02-05 16:51:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-05 16:51:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2025-02-05 16:51:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 200 states have (on average 1.26) internal successors, (252), 200 states have internal predecessors, (252), 85 states have call successors, (85), 18 states have call predecessors, (85), 18 states have return successors, (93), 85 states have call predecessors, (93), 85 states have call successors, (93) [2025-02-05 16:51:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2025-02-05 16:51:55,143 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 230 [2025-02-05 16:51:55,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:55,143 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2025-02-05 16:51:55,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 16:51:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2025-02-05 16:51:55,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 16:51:55,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:55,148 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:55,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:51:55,148 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:55,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:55,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1605607998, now seen corresponding path program 1 times [2025-02-05 16:51:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:55,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616366170] [2025-02-05 16:51:55,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:55,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:55,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:51:55,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:51:55,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:55,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-02-05 16:51:55,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:55,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616366170] [2025-02-05 16:51:55,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616366170] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:51:55,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003973015] [2025-02-05 16:51:55,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:55,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:51:55,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:51:55,693 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:51:55,695 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:51:56,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:51:56,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:51:56,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:56,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:56,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 16:51:56,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:51:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2025-02-05 16:51:56,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:51:56,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003973015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:56,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:51:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-02-05 16:51:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702608985] [2025-02-05 16:51:56,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:56,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:51:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:56,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:51:56,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:51:56,446 INFO L87 Difference]: Start difference. First operand 304 states and 430 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-02-05 16:51:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:57,278 INFO L93 Difference]: Finished difference Result 811 states and 1140 transitions. [2025-02-05 16:51:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:51:57,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 230 [2025-02-05 16:51:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:57,282 INFO L225 Difference]: With dead ends: 811 [2025-02-05 16:51:57,283 INFO L226 Difference]: Without dead ends: 519 [2025-02-05 16:51:57,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:51:57,285 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 258 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:57,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 483 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:51:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-05 16:51:57,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2025-02-05 16:51:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 328 states have (on average 1.1768292682926829) internal successors, (386), 327 states have internal predecessors, (386), 142 states have call successors, (142), 31 states have call predecessors, (142), 37 states have return successors, (170), 149 states have call predecessors, (170), 142 states have call successors, (170) [2025-02-05 16:51:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 698 transitions. [2025-02-05 16:51:57,325 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 698 transitions. Word has length 230 [2025-02-05 16:51:57,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:57,326 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 698 transitions. [2025-02-05 16:51:57,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-02-05 16:51:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 698 transitions. [2025-02-05 16:51:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 16:51:57,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:57,330 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:51:57,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:51:57,534 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:51:57,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:57,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:57,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1539527011, now seen corresponding path program 1 times [2025-02-05 16:51:57,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:57,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982738510] [2025-02-05 16:51:57,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:57,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:57,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:51:57,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:51:57,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:57,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-02-05 16:51:58,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:58,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982738510] [2025-02-05 16:51:58,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982738510] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:51:58,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078637386] [2025-02-05 16:51:58,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:58,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:51:58,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:51:58,088 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:51:58,090 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:51:58,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:51:58,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:51:58,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:58,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:58,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1770 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 16:51:58,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:51:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 400 proven. 4 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2025-02-05 16:51:58,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:51:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-02-05 16:51:59,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078637386] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:51:59,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:51:59,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-05 16:51:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860694375] [2025-02-05 16:51:59,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:51:59,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:51:59,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:59,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:51:59,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:51:59,243 INFO L87 Difference]: Start difference. First operand 508 states and 698 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 9 states have call successors, (60), 5 states have call predecessors, (60), 6 states have return successors, (61), 7 states have call predecessors, (61), 9 states have call successors, (61) [2025-02-05 16:52:03,267 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:52:07,285 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:52:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:07,926 INFO L93 Difference]: Finished difference Result 1043 states and 1454 transitions. [2025-02-05 16:52:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:52:07,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 9 states have call successors, (60), 5 states have call predecessors, (60), 6 states have return successors, (61), 7 states have call predecessors, (61), 9 states have call successors, (61) Word has length 230 [2025-02-05 16:52:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:07,932 INFO L225 Difference]: With dead ends: 1043 [2025-02-05 16:52:07,932 INFO L226 Difference]: Without dead ends: 571 [2025-02-05 16:52:07,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 459 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:52:07,934 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 214 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 137 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:07,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 505 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 379 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-02-05 16:52:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-02-05 16:52:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 546. [2025-02-05 16:52:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 364 states have (on average 1.2087912087912087) internal successors, (440), 364 states have internal predecessors, (440), 126 states have call successors, (126), 44 states have call predecessors, (126), 55 states have return successors, (180), 137 states have call predecessors, (180), 126 states have call successors, (180) [2025-02-05 16:52:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 746 transitions. [2025-02-05 16:52:07,979 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 746 transitions. Word has length 230 [2025-02-05 16:52:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:07,979 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 746 transitions. [2025-02-05 16:52:07,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 9 states have call successors, (60), 5 states have call predecessors, (60), 6 states have return successors, (61), 7 states have call predecessors, (61), 9 states have call successors, (61) [2025-02-05 16:52:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 746 transitions. [2025-02-05 16:52:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 16:52:07,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:07,982 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:07,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:52:08,182 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:52:08,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:08,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1506508195, now seen corresponding path program 1 times [2025-02-05 16:52:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:08,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704278429] [2025-02-05 16:52:08,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:08,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:08,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:52:08,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:52:08,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:08,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-02-05 16:52:09,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:09,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704278429] [2025-02-05 16:52:09,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704278429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:09,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72415172] [2025-02-05 16:52:09,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:09,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:09,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:09,881 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:09,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:52:10,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 16:52:10,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 16:52:10,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:10,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:10,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 1868 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 16:52:10,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:10,567 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:52:11,888 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-05 16:52:11,888 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:52:11,966 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2025-02-05 16:52:11,966 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:52:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 472 proven. 4 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-02-05 16:52:14,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:15,032 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:52:15,036 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:52:15,436 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:52:15,439 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:52:15,498 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:52:15,503 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:52:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2025-02-05 16:52:15,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72415172] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:15,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:15,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 34 [2025-02-05 16:52:15,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599781764] [2025-02-05 16:52:15,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:15,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 16:52:15,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:15,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 16:52:15,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:52:15,623 INFO L87 Difference]: Start difference. First operand 546 states and 746 transitions. Second operand has 34 states, 32 states have (on average 4.40625) internal successors, (141), 32 states have internal predecessors, (141), 16 states have call successors, (69), 10 states have call predecessors, (69), 13 states have return successors, (70), 15 states have call predecessors, (70), 16 states have call successors, (70) [2025-02-05 16:52:19,661 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:52:24,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:28,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:32,494 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:52:36,516 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:52:40,528 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:52:44,539 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:52:48,554 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:52:52,569 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:52:55,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:59,955 INFO L93 Difference]: Finished difference Result 1127 states and 1598 transitions. [2025-02-05 16:52:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 16:52:59,956 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 4.40625) internal successors, (141), 32 states have internal predecessors, (141), 16 states have call successors, (69), 10 states have call predecessors, (69), 13 states have return successors, (70), 15 states have call predecessors, (70), 16 states have call successors, (70) Word has length 230 [2025-02-05 16:52:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:59,960 INFO L225 Difference]: With dead ends: 1127 [2025-02-05 16:52:59,960 INFO L226 Difference]: Without dead ends: 651 [2025-02-05 16:52:59,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 440 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=589, Invalid=3193, Unknown=0, NotChecked=0, Total=3782 [2025-02-05 16:52:59,963 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 683 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 658 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:59,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1601 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 2516 Invalid, 9 Unknown, 0 Unchecked, 43.0s Time] [2025-02-05 16:52:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-02-05 16:53:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 596. [2025-02-05 16:53:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 393 states have (on average 1.2010178117048347) internal successors, (472), 392 states have internal predecessors, (472), 142 states have call successors, (142), 44 states have call predecessors, (142), 60 states have return successors, (232), 159 states have call predecessors, (232), 142 states have call successors, (232) [2025-02-05 16:53:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 846 transitions. [2025-02-05 16:53:00,021 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 846 transitions. Word has length 230 [2025-02-05 16:53:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:00,022 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 846 transitions. [2025-02-05 16:53:00,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 4.40625) internal successors, (141), 32 states have internal predecessors, (141), 16 states have call successors, (69), 10 states have call predecessors, (69), 13 states have return successors, (70), 15 states have call predecessors, (70), 16 states have call successors, (70) [2025-02-05 16:53:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 846 transitions. [2025-02-05 16:53:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 16:53:00,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:00,028 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 6, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:00,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 16:53:00,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 16:53:00,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:00,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1435016697, now seen corresponding path program 1 times [2025-02-05 16:53:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:00,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757744448] [2025-02-05 16:53:00,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:00,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:00,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 16:53:00,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 16:53:00,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:00,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-02-05 16:53:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757744448] [2025-02-05 16:53:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757744448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:01,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:01,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:53:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091832433] [2025-02-05 16:53:01,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:01,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:53:01,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:01,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:53:01,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:53:01,721 INFO L87 Difference]: Start difference. First operand 596 states and 846 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 6 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) [2025-02-05 16:53:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:02,831 INFO L93 Difference]: Finished difference Result 1347 states and 1887 transitions. [2025-02-05 16:53:02,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:53:02,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 6 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) Word has length 251 [2025-02-05 16:53:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:02,838 INFO L225 Difference]: With dead ends: 1347 [2025-02-05 16:53:02,839 INFO L226 Difference]: Without dead ends: 834 [2025-02-05 16:53:02,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:53:02,842 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 415 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:02,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 342 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:53:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-02-05 16:53:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 655. [2025-02-05 16:53:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 428 states have (on average 1.1869158878504673) internal successors, (508), 427 states have internal predecessors, (508), 163 states have call successors, (163), 47 states have call predecessors, (163), 63 states have return successors, (255), 180 states have call predecessors, (255), 163 states have call successors, (255) [2025-02-05 16:53:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 926 transitions. [2025-02-05 16:53:02,910 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 926 transitions. Word has length 251 [2025-02-05 16:53:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:02,912 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 926 transitions. [2025-02-05 16:53:02,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 9 states have internal predecessors, (75), 6 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 6 states have call predecessors, (33), 6 states have call successors, (33) [2025-02-05 16:53:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 926 transitions. [2025-02-05 16:53:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-05 16:53:02,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:02,916 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2025-02-05 16:53:02,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:53:02,916 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:02,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1511544434, now seen corresponding path program 1 times [2025-02-05 16:53:02,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:02,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154669473] [2025-02-05 16:53:02,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:03,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-05 16:53:03,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-05 16:53:03,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:03,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1916 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1880 trivial. 0 not checked. [2025-02-05 16:53:04,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:04,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154669473] [2025-02-05 16:53:04,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154669473] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:04,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766288429] [2025-02-05 16:53:04,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:04,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:04,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:04,410 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:53:04,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process