./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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_lamport.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 d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:25:10,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:25:10,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:25:10,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:25:10,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:25:10,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:25:10,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:25:10,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:25:10,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:25:10,264 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:25:10,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:25:10,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:25:10,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:25:10,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:25:10,267 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:25:10,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:25:10,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:25:10,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:25:10,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:25:10,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:25:10,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:25:10,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:25:10,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:25:10,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:25:10,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:25:10,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:25:10,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:25:10,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:25:10,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:25:10,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:25:10,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:25:10,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:25:10,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:10,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:25:10,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:25:10,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:25:10,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:25:10,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:25:10,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:25:10,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:25:10,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:25:10,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:25:10,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:25:10,270 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 -> d49d34698411f85a0a6e83adb869f73bcb1d6aade5262b0ab5e3122db7000276 [2025-02-07 21:25:10,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:25:10,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:25:10,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:25:10,551 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:25:10,552 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:25:10,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lamport.i [2025-02-07 21:25:11,891 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3c99cb23/0b7d6de1a0a44b19885947797bb3a5b0/FLAGab671fc98 [2025-02-07 21:25:12,200 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:25:12,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lamport.i [2025-02-07 21:25:12,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3c99cb23/0b7d6de1a0a44b19885947797bb3a5b0/FLAGab671fc98 [2025-02-07 21:25:12,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3c99cb23/0b7d6de1a0a44b19885947797bb3a5b0 [2025-02-07 21:25:12,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:25:12,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:25:12,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:12,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:25:12,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:25:12,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:12" (1/1) ... [2025-02-07 21:25:12,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4448f301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:12, skipping insertion in model container [2025-02-07 21:25:12,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:12" (1/1) ... [2025-02-07 21:25:12,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:25:12,797 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_lamport.i[23604,23617] [2025-02-07 21:25:12,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:12,949 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:25:12,984 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_lamport.i[23604,23617] [2025-02-07 21:25:13,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:13,088 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:25:13,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13 WrapperNode [2025-02-07 21:25:13,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:13,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:13,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:25:13,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:25:13,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,153 INFO L138 Inliner]: procedures = 145, calls = 360, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 471 [2025-02-07 21:25:13,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:13,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:25:13,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:25:13,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:25:13,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,216 INFO L175 MemorySlicer]: Split 168 memory accesses to 20 slices as follows [2, 6, 8, 8, 8, 29, 21, 13, 7, 7, 5, 7, 7, 7, 5, 5, 0, 5, 13, 5]. 17 percent of accesses are in the largest equivalence class. The 46 initializations are split as follows [2, 2, 3, 3, 3, 9, 9, 0, 3, 3, 0, 3, 3, 3, 0, 0, 0, 0, 0, 0]. The 42 writes are split as follows [0, 2, 2, 2, 2, 11, 6, 1, 2, 2, 1, 2, 2, 2, 1, 1, 0, 1, 1, 1]. [2025-02-07 21:25:13,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,239 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:25:13,267 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:25:13,267 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:25:13,267 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:25:13,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:13,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:13,300 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-07 21:25:13,308 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-07 21:25:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:25:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:25:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:25:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:25:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:25:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:25:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:25:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:25:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:25:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:25:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:25:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:25:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:25:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:25:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:25:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:25:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:25:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-07 21:25:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-07 21:25:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-07 21:25:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:25:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:25:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:25:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:25:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:25:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:25:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:25:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:25:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:25:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:25:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:25:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:25:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:25:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:25:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:25:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:25:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:25:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-07 21:25:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-07 21:25:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-07 21:25:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:25:13,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:25:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:25:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:25:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:25:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:25:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 21:25:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 21:25:13,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 21:25:13,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-07 21:25:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-07 21:25:13,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-07 21:25:13,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:13,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 21:25:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-07 21:25:13,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:25:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:25:13,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:25:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:25:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:25:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:25:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:25:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:25:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:25:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:25:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:25:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:25:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:25:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:25:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:25:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-07 21:25:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-07 21:25:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-07 21:25:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:25:13,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:25:13,630 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:25:13,633 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:25:16,281 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-02-07 21:25:16,281 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:25:16,294 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:25:16,295 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:25:16,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:16 BoogieIcfgContainer [2025-02-07 21:25:16,295 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:25:16,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:25:16,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:25:16,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:25:16,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:25:12" (1/3) ... [2025-02-07 21:25:16,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d7f22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:16, skipping insertion in model container [2025-02-07 21:25:16,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (2/3) ... [2025-02-07 21:25:16,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d7f22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:16, skipping insertion in model container [2025-02-07 21:25:16,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:16" (3/3) ... [2025-02-07 21:25:16,306 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_lamport.i [2025-02-07 21:25:16,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:25:16,323 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_lamport.i that has 6 procedures, 112 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 21:25:16,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:25:16,382 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;@2230dd98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:25:16,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:25:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 70 states have internal predecessors, (89), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-07 21:25:16,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-07 21:25:16,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:16,406 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 21:25:16,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:16,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1773985070, now seen corresponding path program 1 times [2025-02-07 21:25:16,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:16,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051868966] [2025-02-07 21:25:16,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:16,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:16,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-07 21:25:16,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-07 21:25:16,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:16,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-07 21:25:17,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:17,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051868966] [2025-02-07 21:25:17,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051868966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:17,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:17,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:17,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456350075] [2025-02-07 21:25:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:17,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:17,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:17,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:17,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:17,298 INFO L87 Difference]: Start difference. First operand has 112 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 70 states have internal predecessors, (89), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-07 21:25:21,335 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-07 21:25:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:21,410 INFO L93 Difference]: Finished difference Result 223 states and 355 transitions. [2025-02-07 21:25:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:21,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2025-02-07 21:25:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:21,422 INFO L225 Difference]: With dead ends: 223 [2025-02-07 21:25:21,423 INFO L226 Difference]: Without dead ends: 110 [2025-02-07 21:25:21,428 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-07 21:25:21,432 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 2 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:21,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 309 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-07 21:25:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-07 21:25:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-02-07 21:25:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 67 states have internal predecessors, (80), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-07 21:25:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 152 transitions. [2025-02-07 21:25:21,489 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 152 transitions. Word has length 142 [2025-02-07 21:25:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:21,490 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 152 transitions. [2025-02-07 21:25:21,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-07 21:25:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 152 transitions. [2025-02-07 21:25:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-07 21:25:21,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:21,495 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 21:25:21,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:25:21,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:21,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1257517026, now seen corresponding path program 1 times [2025-02-07 21:25:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:21,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157534546] [2025-02-07 21:25:21,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:21,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-07 21:25:21,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-07 21:25:21,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:21,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-07 21:25:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:21,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157534546] [2025-02-07 21:25:21,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157534546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:21,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:21,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813578556] [2025-02-07 21:25:21,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:21,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:21,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:21,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:21,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:21,989 INFO L87 Difference]: Start difference. First operand 109 states and 152 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-07 21:25:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:22,049 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2025-02-07 21:25:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:22,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-02-07 21:25:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:22,052 INFO L225 Difference]: With dead ends: 217 [2025-02-07 21:25:22,052 INFO L226 Difference]: Without dead ends: 110 [2025-02-07 21:25:22,053 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-07 21:25:22,054 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 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-07 21:25:22,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-07 21:25:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-07 21:25:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-07 21:25:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2025-02-07 21:25:22,070 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 144 [2025-02-07 21:25:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:22,071 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2025-02-07 21:25:22,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-07 21:25:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2025-02-07 21:25:22,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-07 21:25:22,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:22,079 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 21:25:22,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:25:22,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:22,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:22,080 INFO L85 PathProgramCache]: Analyzing trace with hash 439021738, now seen corresponding path program 1 times [2025-02-07 21:25:22,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:22,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075441836] [2025-02-07 21:25:22,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:22,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:22,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-07 21:25:22,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-07 21:25:22,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:22,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-07 21:25:22,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075441836] [2025-02-07 21:25:22,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075441836] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185377673] [2025-02-07 21:25:22,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:22,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:22,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:22,516 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-07 21:25:22,517 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-07 21:25:22,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-07 21:25:23,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-07 21:25:23,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:23,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:23,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:23,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-07 21:25:23,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-07 21:25:23,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185377673] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:23,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:23,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:25:23,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050876598] [2025-02-07 21:25:23,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:23,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:23,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:23,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:23,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:23,384 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-07 21:25:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:23,468 INFO L93 Difference]: Finished difference Result 220 states and 308 transitions. [2025-02-07 21:25:23,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:23,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 145 [2025-02-07 21:25:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:23,470 INFO L225 Difference]: With dead ends: 220 [2025-02-07 21:25:23,472 INFO L226 Difference]: Without dead ends: 112 [2025-02-07 21:25:23,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 287 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-07 21:25:23,474 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 444 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.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:23,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 444 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:25:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-07 21:25:23,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-07 21:25:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 70 states have internal predecessors, (83), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-07 21:25:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 155 transitions. [2025-02-07 21:25:23,487 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 155 transitions. Word has length 145 [2025-02-07 21:25:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:23,488 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 155 transitions. [2025-02-07 21:25:23,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-02-07 21:25:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 155 transitions. [2025-02-07 21:25:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-07 21:25:23,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:23,490 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:23,501 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-07 21:25:23,691 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-07 21:25:23,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:23,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:23,692 INFO L85 PathProgramCache]: Analyzing trace with hash -221704406, now seen corresponding path program 2 times [2025-02-07 21:25:23,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:23,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731312618] [2025-02-07 21:25:23,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:23,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:23,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-02-07 21:25:23,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 147 statements. [2025-02-07 21:25:23,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:23,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-02-07 21:25:24,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:24,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731312618] [2025-02-07 21:25:24,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731312618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:24,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:24,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:24,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512104122] [2025-02-07 21:25:24,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:24,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:24,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:24,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:24,137 INFO L87 Difference]: Start difference. First operand 112 states and 155 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-07 21:25:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:24,200 INFO L93 Difference]: Finished difference Result 215 states and 302 transitions. [2025-02-07 21:25:24,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:24,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2025-02-07 21:25:24,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:24,209 INFO L225 Difference]: With dead ends: 215 [2025-02-07 21:25:24,210 INFO L226 Difference]: Without dead ends: 165 [2025-02-07 21:25:24,211 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-07 21:25:24,212 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 93 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 492 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-07 21:25:24,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 492 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-07 21:25:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-07 21:25:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 105 states have (on average 1.2) internal successors, (126), 105 states have internal predecessors, (126), 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-07 21:25:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 228 transitions. [2025-02-07 21:25:24,242 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 228 transitions. Word has length 147 [2025-02-07 21:25:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:24,242 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 228 transitions. [2025-02-07 21:25:24,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-02-07 21:25:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 228 transitions. [2025-02-07 21:25:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-07 21:25:24,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:24,246 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1] [2025-02-07 21:25:24,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:24,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:24,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1502449225, now seen corresponding path program 1 times [2025-02-07 21:25:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:24,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016764841] [2025-02-07 21:25:24,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:24,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:24,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-07 21:25:24,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-07 21:25:24,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:24,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1469 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-02-07 21:25:24,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:24,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016764841] [2025-02-07 21:25:24,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016764841] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:24,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573697885] [2025-02-07 21:25:24,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:24,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:24,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:24,710 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-07 21:25:24,712 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-07 21:25:25,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-07 21:25:25,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-07 21:25:25,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:25,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:25,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:25,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1469 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-02-07 21:25:25,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1469 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-02-07 21:25:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573697885] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:25,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:25,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2025-02-07 21:25:25,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437364694] [2025-02-07 21:25:25,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:25,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:25,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:25,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:25,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:25,818 INFO L87 Difference]: Start difference. First operand 165 states and 228 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2025-02-07 21:25:27,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:29,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:29,951 INFO L93 Difference]: Finished difference Result 333 states and 461 transitions. [2025-02-07 21:25:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:29,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) Word has length 234 [2025-02-07 21:25:29,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:29,960 INFO L225 Difference]: With dead ends: 333 [2025-02-07 21:25:29,960 INFO L226 Difference]: Without dead ends: 175 [2025-02-07 21:25:29,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 465 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-07 21:25:29,962 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 2 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:29,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 586 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-07 21:25:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-02-07 21:25:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-02-07 21:25:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 115 states have (on average 1.2) internal successors, (138), 115 states have internal predecessors, (138), 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-07 21:25:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 240 transitions. [2025-02-07 21:25:30,000 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 240 transitions. Word has length 234 [2025-02-07 21:25:30,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:30,000 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 240 transitions. [2025-02-07 21:25:30,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 2 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2025-02-07 21:25:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 240 transitions. [2025-02-07 21:25:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-02-07 21:25:30,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:30,004 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 9, 5, 5, 5, 5, 5, 3, 3, 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, 1] [2025-02-07 21:25:30,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 21:25:30,207 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-07 21:25:30,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:30,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash -871750903, now seen corresponding path program 2 times [2025-02-07 21:25:30,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:30,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327427814] [2025-02-07 21:25:30,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:30,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 244 statements into 2 equivalence classes. [2025-02-07 21:25:30,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 244 statements. [2025-02-07 21:25:30,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:30,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1534 trivial. 0 not checked. [2025-02-07 21:25:30,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:30,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327427814] [2025-02-07 21:25:30,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327427814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:30,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:30,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:30,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986551149] [2025-02-07 21:25:30,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:30,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:30,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:30,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:30,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:30,600 INFO L87 Difference]: Start difference. First operand 175 states and 240 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-07 21:25:34,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:38,155 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-07 21:25:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:38,295 INFO L93 Difference]: Finished difference Result 465 states and 642 transitions. [2025-02-07 21:25:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:38,297 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 244 [2025-02-07 21:25:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:38,300 INFO L225 Difference]: With dead ends: 465 [2025-02-07 21:25:38,300 INFO L226 Difference]: Without dead ends: 323 [2025-02-07 21:25:38,303 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-07 21:25:38,304 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 136 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:38,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 650 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2025-02-07 21:25:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-07 21:25:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2025-02-07 21:25:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 203 states have (on average 1.1822660098522169) internal successors, (240), 203 states have internal predecessors, (240), 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-07 21:25:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 445 transitions. [2025-02-07 21:25:38,339 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 445 transitions. Word has length 244 [2025-02-07 21:25:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:38,339 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 445 transitions. [2025-02-07 21:25:38,339 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-07 21:25:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 445 transitions. [2025-02-07 21:25:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-02-07 21:25:38,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:38,343 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 9, 5, 5, 5, 5, 5, 3, 3, 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, 1] [2025-02-07 21:25:38,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:25:38,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:38,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:38,344 INFO L85 PathProgramCache]: Analyzing trace with hash 175488839, now seen corresponding path program 1 times [2025-02-07 21:25:38,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:38,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464534457] [2025-02-07 21:25:38,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:38,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-07 21:25:38,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-07 21:25:38,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:38,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1534 trivial. 0 not checked. [2025-02-07 21:25:39,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:39,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464534457] [2025-02-07 21:25:39,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464534457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:39,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:39,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:39,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147455925] [2025-02-07 21:25:39,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:39,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:39,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:39,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:39,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:39,397 INFO L87 Difference]: Start difference. First operand 319 states and 445 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-07 21:25:43,437 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-07 21:25:47,452 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-07 21:25:47,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:47,581 INFO L93 Difference]: Finished difference Result 585 states and 803 transitions. [2025-02-07 21:25:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:47,582 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 244 [2025-02-07 21:25:47,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:47,588 INFO L225 Difference]: With dead ends: 585 [2025-02-07 21:25:47,588 INFO L226 Difference]: Without dead ends: 294 [2025-02-07 21:25:47,590 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-07 21:25:47,593 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 132 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 647 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-07 21:25:47,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 647 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-02-07 21:25:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-07 21:25:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2025-02-07 21:25:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 185 states have (on average 1.172972972972973) internal successors, (217), 185 states have internal predecessors, (217), 86 states have call successors, (86), 18 states have call predecessors, (86), 18 states have return successors, (94), 86 states have call predecessors, (94), 86 states have call successors, (94) [2025-02-07 21:25:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 397 transitions. [2025-02-07 21:25:47,638 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 397 transitions. Word has length 244 [2025-02-07 21:25:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:47,639 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 397 transitions. [2025-02-07 21:25:47,639 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-07 21:25:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 397 transitions. [2025-02-07 21:25:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-02-07 21:25:47,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:47,646 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 9, 5, 5, 5, 5, 5, 3, 3, 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, 1] [2025-02-07 21:25:47,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:25:47,646 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:47,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash 500025157, now seen corresponding path program 1 times [2025-02-07 21:25:47,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:47,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787986616] [2025-02-07 21:25:47,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:47,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:47,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-07 21:25:47,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-07 21:25:47,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:47,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-02-07 21:25:48,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:48,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787986616] [2025-02-07 21:25:48,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787986616] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:48,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909703279] [2025-02-07 21:25:48,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:48,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:48,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:48,459 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-07 21:25:48,461 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-07 21:25:48,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-07 21:25:49,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-07 21:25:49,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:49,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:49,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 1924 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-07 21:25:49,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 407 proven. 0 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2025-02-07 21:25:49,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:25:49,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909703279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:49,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:25:49,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-02-07 21:25:49,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566961317] [2025-02-07 21:25:49,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:49,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 21:25:49,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:49,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 21:25:49,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:25:49,747 INFO L87 Difference]: Start difference. First operand 290 states and 397 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2025-02-07 21:25:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:50,909 INFO L93 Difference]: Finished difference Result 631 states and 844 transitions. [2025-02-07 21:25:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:25:50,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 244 [2025-02-07 21:25:50,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:50,913 INFO L225 Difference]: With dead ends: 631 [2025-02-07 21:25:50,916 INFO L226 Difference]: Without dead ends: 333 [2025-02-07 21:25:50,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-07 21:25:50,918 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 146 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:50,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 356 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 21:25:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-07 21:25:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2025-02-07 21:25:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 211 states have (on average 1.146919431279621) internal successors, (242), 213 states have internal predecessors, (242), 93 states have call successors, (93), 25 states have call predecessors, (93), 25 states have return successors, (107), 91 states have call predecessors, (107), 93 states have call successors, (107) [2025-02-07 21:25:50,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 442 transitions. [2025-02-07 21:25:50,960 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 442 transitions. Word has length 244 [2025-02-07 21:25:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:50,962 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 442 transitions. [2025-02-07 21:25:50,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (35), 3 states have call predecessors, (35), 4 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2025-02-07 21:25:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 442 transitions. [2025-02-07 21:25:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-07 21:25:50,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:50,968 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 9, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:50,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 21:25:51,172 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-07 21:25:51,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:51,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1684182982, now seen corresponding path program 1 times [2025-02-07 21:25:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:51,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778223006] [2025-02-07 21:25:51,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:51,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:51,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-07 21:25:51,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-07 21:25:51,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:51,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-02-07 21:25:51,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:51,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778223006] [2025-02-07 21:25:51,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778223006] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:51,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456245062] [2025-02-07 21:25:51,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:51,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:51,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:51,955 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-07 21:25:51,957 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-07 21:25:52,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-07 21:25:52,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-07 21:25:52,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:52,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:52,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 1921 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:25:52,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:52,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 440 proven. 4 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2025-02-07 21:25:52,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-02-07 21:25:53,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456245062] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:53,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:53,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-07 21:25:53,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849311913] [2025-02-07 21:25:53,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:53,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 21:25:53,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:53,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 21:25:53,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-07 21:25:53,627 INFO L87 Difference]: Start difference. First operand 330 states and 442 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 9 states have call successors, (66), 5 states have call predecessors, (66), 6 states have return successors, (67), 7 states have call predecessors, (67), 9 states have call successors, (67) [2025-02-07 21:25:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:54,953 INFO L93 Difference]: Finished difference Result 644 states and 870 transitions. [2025-02-07 21:25:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 21:25:54,954 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 9 states have call successors, (66), 5 states have call predecessors, (66), 6 states have return successors, (67), 7 states have call predecessors, (67), 9 states have call successors, (67) Word has length 242 [2025-02-07 21:25:54,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:54,958 INFO L225 Difference]: With dead ends: 644 [2025-02-07 21:25:54,958 INFO L226 Difference]: Without dead ends: 343 [2025-02-07 21:25:54,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 483 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-07 21:25:54,960 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 182 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:54,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 473 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 21:25:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-07 21:25:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 340. [2025-02-07 21:25:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 222 states have (on average 1.1441441441441442) internal successors, (254), 223 states have internal predecessors, (254), 84 states have call successors, (84), 33 states have call predecessors, (84), 33 states have return successors, (107), 83 states have call predecessors, (107), 84 states have call successors, (107) [2025-02-07 21:25:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 445 transitions. [2025-02-07 21:25:54,994 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 445 transitions. Word has length 242 [2025-02-07 21:25:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:54,995 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 445 transitions. [2025-02-07 21:25:54,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 9 states have call successors, (66), 5 states have call predecessors, (66), 6 states have return successors, (67), 7 states have call predecessors, (67), 9 states have call successors, (67) [2025-02-07 21:25:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 445 transitions. [2025-02-07 21:25:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-07 21:25:54,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:54,998 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 9, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:55,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 21:25:55,201 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-07 21:25:55,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:55,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash 857426822, now seen corresponding path program 1 times [2025-02-07 21:25:55,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:55,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022325349] [2025-02-07 21:25:55,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:55,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-07 21:25:55,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-07 21:25:55,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:55,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2025-02-07 21:25:57,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:57,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022325349] [2025-02-07 21:25:57,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022325349] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:57,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362437971] [2025-02-07 21:25:57,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:57,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:57,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:57,163 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-07 21:25:57,165 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-07 21:25:57,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-07 21:25:57,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-07 21:25:57,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:57,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:57,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 2019 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-07 21:25:58,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:58,232 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 13 treesize of output 9 [2025-02-07 21:26:01,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 21:26:01,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:26:01,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-02-07 21:26:02,390 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-02-07 21:26:02,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2025-02-07 21:26:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 503 proven. 4 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2025-02-07 21:26:26,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:26:26,904 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-07 21:26:26,913 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-07 21:26:27,435 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-07 21:26:27,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-07 21:26:27,509 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-07 21:26:27,514 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-07 21:26:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-02-07 21:26:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362437971] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:26:27,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:26:27,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 9] total 34 [2025-02-07 21:26:27,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111801243] [2025-02-07 21:26:27,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:26:27,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-07 21:26:27,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:27,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-07 21:26:27,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=986, Unknown=3, NotChecked=0, Total=1122 [2025-02-07 21:26:27,636 INFO L87 Difference]: Start difference. First operand 340 states and 445 transitions. Second operand has 34 states, 31 states have (on average 4.516129032258065) internal successors, (140), 34 states have internal predecessors, (140), 19 states have call successors, (78), 11 states have call predecessors, (78), 14 states have return successors, (78), 17 states have call predecessors, (78), 19 states have call successors, (78) [2025-02-07 21:26:31,788 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-07 21:26:35,809 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 []