./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_szymanski.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_szymanski.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:25:41,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:25:41,987 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:41,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:25:41,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:25:42,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:25:42,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:25:42,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:25:42,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:25:42,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:25:42,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:25:42,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:25:42,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:25:42,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:25:42,025 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:25:42,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:25:42,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:25:42,026 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:25:42,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:25:42,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:25:42,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:25:42,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:25:42,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:25:42,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:25:42,027 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:25:42,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:25:42,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:25:42,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:25:42,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:25:42,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:25:42,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:25:42,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:25:42,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:42,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:25:42,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:25:42,029 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:25:42,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:25:42,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:25:42,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:25:42,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:25:42,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:25:42,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:25:42,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:25:42,030 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 [2025-02-07 21:25:42,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:25:42,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:25:42,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:25:42,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:25:42,325 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:25:42,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_szymanski.i [2025-02-07 21:25:43,632 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2e8685d4/aef9907f966c43ab9eda90a7f194f414/FLAG304c75811 [2025-02-07 21:25:44,036 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:25:44,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i [2025-02-07 21:25:44,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2e8685d4/aef9907f966c43ab9eda90a7f194f414/FLAG304c75811 [2025-02-07 21:25:44,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2e8685d4/aef9907f966c43ab9eda90a7f194f414 [2025-02-07 21:25:44,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:25:44,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:25:44,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:44,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:25:44,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:25:44,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f5e2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44, skipping insertion in model container [2025-02-07 21:25:44,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:25:44,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i[23606,23619] [2025-02-07 21:25:44,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:44,509 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:25:44,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i[23606,23619] [2025-02-07 21:25:44,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:44,642 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:25:44,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44 WrapperNode [2025-02-07 21:25:44,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:44,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:44,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:25:44,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:25:44,654 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:44" (1/1) ... [2025-02-07 21:25:44,684 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:44" (1/1) ... [2025-02-07 21:25:44,727 INFO L138 Inliner]: procedures = 145, calls = 298, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 403 [2025-02-07 21:25:44,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:44,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:25:44,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:25:44,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:25:44,742 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:44" (1/1) ... [2025-02-07 21:25:44,743 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:44" (1/1) ... [2025-02-07 21:25:44,754 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:44" (1/1) ... [2025-02-07 21:25:44,793 INFO L175 MemorySlicer]: Split 144 memory accesses to 16 slices as follows [2, 5, 8, 5, 8, 8, 29, 21, 7, 7, 7, 0, 6, 5, 13, 13]. 20 percent of accesses are in the largest equivalence class. The 40 initializations are split as follows [2, 0, 3, 0, 3, 3, 9, 9, 3, 3, 3, 0, 2, 0, 0, 0]. The 36 writes are split as follows [0, 1, 2, 1, 2, 2, 11, 6, 2, 2, 2, 0, 2, 1, 1, 1]. [2025-02-07 21:25:44,794 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:44" (1/1) ... [2025-02-07 21:25:44,794 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:44" (1/1) ... [2025-02-07 21:25:44,826 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:44" (1/1) ... [2025-02-07 21:25:44,830 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:44" (1/1) ... [2025-02-07 21:25:44,834 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:44" (1/1) ... [2025-02-07 21:25:44,844 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:44" (1/1) ... [2025-02-07 21:25:44,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:25:44,858 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:25:44,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:25:44,858 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:25:44,859 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (1/1) ... [2025-02-07 21:25:44,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:44,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:44,894 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:44,900 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:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:25:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:25:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:25:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:25:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:25:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:25:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:25:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:25:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:25:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:25:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:25:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:25:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:25:44,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:25:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:25:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:25:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:25:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:25:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 21:25:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 21:25:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 21:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 21:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 21:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-07 21:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-07 21:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-07 21:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-07 21:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-07 21:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-07 21:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-07 21:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-07 21:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-07 21:25:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-07 21:25:44,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-07 21:25:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:25:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:25:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 21:25:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 21:25:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 21:25:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-07 21:25:44,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:44,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-07 21:25:44,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:25:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:25:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:25:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:25:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:25:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:25:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:25:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:25:44,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:25:45,205 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:25:45,207 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:25:49,812 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2025-02-07 21:25:49,812 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:25:49,822 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:25:49,822 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:25:49,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:49 BoogieIcfgContainer [2025-02-07 21:25:49,823 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:25:49,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:25:49,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:25:49,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:25:49,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:25:44" (1/3) ... [2025-02-07 21:25:49,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581f35e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:49, skipping insertion in model container [2025-02-07 21:25:49,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:44" (2/3) ... [2025-02-07 21:25:49,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581f35e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:49, skipping insertion in model container [2025-02-07 21:25:49,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:49" (3/3) ... [2025-02-07 21:25:49,831 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_szymanski.i [2025-02-07 21:25:49,843 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:25:49,845 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_szymanski.i that has 6 procedures, 104 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 21:25:49,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:25:49,902 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;@290ec6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:25:49,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:25:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 64 states have (on average 1.328125) internal successors, (85), 66 states have internal predecessors, (85), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-07 21:25:49,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-07 21:25:49,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:49,922 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:49,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:49,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1638629238, now seen corresponding path program 1 times [2025-02-07 21:25:49,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:49,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331193282] [2025-02-07 21:25:49,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:50,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-07 21:25:50,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-07 21:25:50,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:50,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-07 21:25:50,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:50,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331193282] [2025-02-07 21:25:50,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331193282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:50,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:50,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927092402] [2025-02-07 21:25:50,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:50,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:50,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:50,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:50,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:50,652 INFO L87 Difference]: Start difference. First operand has 104 states, 64 states have (on average 1.328125) internal successors, (85), 66 states have internal predecessors, (85), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-07 21:25:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:51,078 INFO L93 Difference]: Finished difference Result 207 states and 327 transitions. [2025-02-07 21:25:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:51,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2025-02-07 21:25:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:51,088 INFO L225 Difference]: With dead ends: 207 [2025-02-07 21:25:51,088 INFO L226 Difference]: Without dead ends: 102 [2025-02-07 21:25:51,094 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:51,097 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 285 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.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:51,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:25:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-07 21:25:51,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-02-07 21:25:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-07 21:25:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2025-02-07 21:25:51,159 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 118 [2025-02-07 21:25:51,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:51,163 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2025-02-07 21:25:51,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-07 21:25:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2025-02-07 21:25:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-07 21:25:51,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:51,168 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:51,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:25:51,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:51,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash 635956698, now seen corresponding path program 1 times [2025-02-07 21:25:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:51,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868269213] [2025-02-07 21:25:51,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:51,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-07 21:25:51,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-07 21:25:51,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:51,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-07 21:25:51,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:51,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868269213] [2025-02-07 21:25:51,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868269213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:51,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:51,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:51,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011579035] [2025-02-07 21:25:51,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:51,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:51,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:51,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:51,518 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-07 21:25:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:51,568 INFO L93 Difference]: Finished difference Result 201 states and 280 transitions. [2025-02-07 21:25:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:51,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2025-02-07 21:25:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:51,571 INFO L225 Difference]: With dead ends: 201 [2025-02-07 21:25:51,571 INFO L226 Difference]: Without dead ends: 102 [2025-02-07 21:25:51,572 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:51,572 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 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:51,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 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:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-07 21:25:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-02-07 21:25:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 64 states have (on average 1.203125) internal successors, (77), 64 states have internal predecessors, (77), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-07 21:25:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2025-02-07 21:25:51,596 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 120 [2025-02-07 21:25:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:51,596 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2025-02-07 21:25:51,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-07 21:25:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2025-02-07 21:25:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-07 21:25:51,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:51,603 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:51,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:25:51,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:51,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:51,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1041033822, now seen corresponding path program 1 times [2025-02-07 21:25:51,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:51,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474274011] [2025-02-07 21:25:51,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:51,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:51,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-07 21:25:51,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-07 21:25:51,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:51,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-07 21:25:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474274011] [2025-02-07 21:25:51,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474274011] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968842091] [2025-02-07 21:25:51,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:51,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:51,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:51,916 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:51,918 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:52,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-07 21:25:52,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-07 21:25:52,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:52,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:52,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:52,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-07 21:25:52,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-07 21:25:52,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968842091] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:52,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:25:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104571017] [2025-02-07 21:25:52,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:52,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:52,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:52,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:52,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:52,548 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-07 21:25:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:52,616 INFO L93 Difference]: Finished difference Result 204 states and 284 transitions. [2025-02-07 21:25:52,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:52,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 121 [2025-02-07 21:25:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:52,618 INFO L225 Difference]: With dead ends: 204 [2025-02-07 21:25:52,621 INFO L226 Difference]: Without dead ends: 104 [2025-02-07 21:25:52,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 239 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:52,623 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:52,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 408 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-07 21:25:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-07 21:25:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 66 states have (on average 1.196969696969697) internal successors, (79), 66 states have internal predecessors, (79), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-07 21:25:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2025-02-07 21:25:52,642 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 121 [2025-02-07 21:25:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:52,642 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2025-02-07 21:25:52,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-02-07 21:25:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2025-02-07 21:25:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-07 21:25:52,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:52,646 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:52,657 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:52,847 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:52,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:52,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash -849384994, now seen corresponding path program 2 times [2025-02-07 21:25:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:52,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028459126] [2025-02-07 21:25:52,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:52,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:52,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-02-07 21:25:52,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 123 statements. [2025-02-07 21:25:52,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:52,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2025-02-07 21:25:53,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:53,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028459126] [2025-02-07 21:25:53,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028459126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:53,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:53,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:53,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595155448] [2025-02-07 21:25:53,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:53,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:53,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:53,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:53,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:53,198 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-07 21:25:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:53,231 INFO L93 Difference]: Finished difference Result 199 states and 278 transitions. [2025-02-07 21:25:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:53,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2025-02-07 21:25:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:53,235 INFO L225 Difference]: With dead ends: 199 [2025-02-07 21:25:53,235 INFO L226 Difference]: Without dead ends: 157 [2025-02-07 21:25:53,235 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:53,236 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 89 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 456 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:53,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 456 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:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-07 21:25:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-07 21:25:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 101 states have internal predecessors, (122), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2025-02-07 21:25:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 216 transitions. [2025-02-07 21:25:53,253 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 216 transitions. Word has length 123 [2025-02-07 21:25:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:53,253 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 216 transitions. [2025-02-07 21:25:53,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-07 21:25:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 216 transitions. [2025-02-07 21:25:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-07 21:25:53,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:53,258 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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] [2025-02-07 21:25:53,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:53,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:53,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:53,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1613308461, now seen corresponding path program 1 times [2025-02-07 21:25:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483223193] [2025-02-07 21:25:53,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:53,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:53,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-07 21:25:53,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-07 21:25:53,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:53,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1076 trivial. 0 not checked. [2025-02-07 21:25:53,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:53,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483223193] [2025-02-07 21:25:53,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483223193] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:53,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85214870] [2025-02-07 21:25:53,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:53,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:53,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:53,644 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:53,646 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:53,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-07 21:25:54,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-07 21:25:54,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:54,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:54,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 1424 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:54,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1076 trivial. 0 not checked. [2025-02-07 21:25:54,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1076 trivial. 0 not checked. [2025-02-07 21:25:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85214870] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:54,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:54,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2025-02-07 21:25:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100641107] [2025-02-07 21:25:54,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:54,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:54,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:54,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:54,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:54,562 INFO L87 Difference]: Start difference. First operand 157 states and 216 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2025-02-07 21:25:56,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:56,401 INFO L93 Difference]: Finished difference Result 317 states and 437 transitions. [2025-02-07 21:25:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:56,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 210 [2025-02-07 21:25:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:56,407 INFO L225 Difference]: With dead ends: 317 [2025-02-07 21:25:56,410 INFO L226 Difference]: Without dead ends: 167 [2025-02-07 21:25:56,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 417 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:56,412 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 2 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:56,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 270 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-07 21:25:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-07 21:25:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-02-07 21:25:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 111 states have internal predecessors, (134), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2025-02-07 21:25:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 228 transitions. [2025-02-07 21:25:56,439 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 228 transitions. Word has length 210 [2025-02-07 21:25:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:56,439 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 228 transitions. [2025-02-07 21:25:56,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2025-02-07 21:25:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 228 transitions. [2025-02-07 21:25:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-07 21:25:56,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:56,446 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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] [2025-02-07 21:25:56,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 21:25:56,646 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:56,647 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:56,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:56,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1873694227, now seen corresponding path program 2 times [2025-02-07 21:25:56,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:56,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449072779] [2025-02-07 21:25:56,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:56,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:56,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-02-07 21:25:56,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 220 statements. [2025-02-07 21:25:56,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:56,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1142 trivial. 0 not checked. [2025-02-07 21:25:57,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:57,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449072779] [2025-02-07 21:25:57,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449072779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:57,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:57,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:57,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721516272] [2025-02-07 21:25:57,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:57,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:57,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:57,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:57,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:57,009 INFO L87 Difference]: Start difference. First operand 167 states and 228 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-07 21:25:58,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:02,194 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:26:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:02,308 INFO L93 Difference]: Finished difference Result 441 states and 606 transitions. [2025-02-07 21:26:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:26:02,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 220 [2025-02-07 21:26:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:02,312 INFO L225 Difference]: With dead ends: 441 [2025-02-07 21:26:02,312 INFO L226 Difference]: Without dead ends: 307 [2025-02-07 21:26:02,312 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:26:02,313 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 124 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:02,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 590 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-02-07 21:26:02,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-07 21:26:02,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2025-02-07 21:26:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 195 states have (on average 1.1897435897435897) internal successors, (232), 195 states have internal predecessors, (232), 87 states have call successors, (87), 20 states have call predecessors, (87), 20 states have return successors, (102), 87 states have call predecessors, (102), 87 states have call successors, (102) [2025-02-07 21:26:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 421 transitions. [2025-02-07 21:26:02,363 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 421 transitions. Word has length 220 [2025-02-07 21:26:02,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:02,363 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 421 transitions. [2025-02-07 21:26:02,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-07 21:26:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 421 transitions. [2025-02-07 21:26:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-07 21:26:02,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:02,370 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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] [2025-02-07 21:26:02,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:26:02,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:02,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash -133120469, now seen corresponding path program 1 times [2025-02-07 21:26:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:02,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57631973] [2025-02-07 21:26:02,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:02,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:02,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-07 21:26:02,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-07 21:26:02,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:02,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1142 trivial. 0 not checked. [2025-02-07 21:26:03,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:03,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57631973] [2025-02-07 21:26:03,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57631973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:26:03,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:26:03,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:26:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735557844] [2025-02-07 21:26:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:26:03,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:26:03,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:03,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:26:03,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:26:03,204 INFO L87 Difference]: Start difference. First operand 303 states and 421 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-07 21:26:07,959 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:26:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:08,056 INFO L93 Difference]: Finished difference Result 553 states and 755 transitions. [2025-02-07 21:26:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:26:08,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 220 [2025-02-07 21:26:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:08,059 INFO L225 Difference]: With dead ends: 553 [2025-02-07 21:26:08,059 INFO L226 Difference]: Without dead ends: 278 [2025-02-07 21:26:08,060 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:26:08,061 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 120 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:08,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 587 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-02-07 21:26:08,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-02-07 21:26:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 274. [2025-02-07 21:26:08,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 177 states have (on average 1.1807909604519775) internal successors, (209), 177 states have internal predecessors, (209), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (86), 78 states have call predecessors, (86), 78 states have call successors, (86) [2025-02-07 21:26:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 373 transitions. [2025-02-07 21:26:08,088 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 373 transitions. Word has length 220 [2025-02-07 21:26:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:08,089 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 373 transitions. [2025-02-07 21:26:08,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-07 21:26:08,089 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 373 transitions. [2025-02-07 21:26:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-07 21:26:08,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:08,093 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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] [2025-02-07 21:26:08,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:26:08,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:08,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:08,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1969616425, now seen corresponding path program 1 times [2025-02-07 21:26:08,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:08,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510250153] [2025-02-07 21:26:08,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:08,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:08,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-07 21:26:08,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-07 21:26:08,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:08,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1138 trivial. 0 not checked. [2025-02-07 21:26:08,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:08,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510250153] [2025-02-07 21:26:08,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510250153] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:26:08,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367277066] [2025-02-07 21:26:08,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:08,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:26:08,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:26:08,736 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:26:08,739 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:26:09,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-07 21:26:09,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-07 21:26:09,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:09,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:09,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 21:26:09,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:26:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2025-02-07 21:26:09,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:26:09,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367277066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:26:09,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:26:09,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-02-07 21:26:09,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404320289] [2025-02-07 21:26:09,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:26:09,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 21:26:09,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:09,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 21:26:09,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:26:09,832 INFO L87 Difference]: Start difference. First operand 274 states and 373 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 4 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2025-02-07 21:26:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:10,562 INFO L93 Difference]: Finished difference Result 599 states and 796 transitions. [2025-02-07 21:26:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:26:10,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 4 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) Word has length 220 [2025-02-07 21:26:10,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:10,566 INFO L225 Difference]: With dead ends: 599 [2025-02-07 21:26:10,566 INFO L226 Difference]: Without dead ends: 317 [2025-02-07 21:26:10,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 217 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:26:10,571 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 139 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:10,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 290 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:26:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-07 21:26:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2025-02-07 21:26:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 203 states have (on average 1.1527093596059113) internal successors, (234), 205 states have internal predecessors, (234), 85 states have call successors, (85), 25 states have call predecessors, (85), 25 states have return successors, (99), 83 states have call predecessors, (99), 85 states have call successors, (99) [2025-02-07 21:26:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 418 transitions. [2025-02-07 21:26:10,620 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 418 transitions. Word has length 220 [2025-02-07 21:26:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:10,621 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 418 transitions. [2025-02-07 21:26:10,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 6 states have internal predecessors, (70), 4 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) [2025-02-07 21:26:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 418 transitions. [2025-02-07 21:26:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-07 21:26:10,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:10,626 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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] [2025-02-07 21:26:10,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 21:26:10,827 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:26:10,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:10,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1189814186, now seen corresponding path program 1 times [2025-02-07 21:26:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:10,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547790676] [2025-02-07 21:26:10,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:10,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-07 21:26:11,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-07 21:26:11,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:11,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1138 trivial. 0 not checked. [2025-02-07 21:26:11,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:11,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547790676] [2025-02-07 21:26:11,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547790676] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:26:11,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210847445] [2025-02-07 21:26:11,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:11,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:26:11,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:26:11,550 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:26:11,551 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:26:11,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-07 21:26:12,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-07 21:26:12,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:12,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:12,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:26:12,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:26:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 360 proven. 4 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2025-02-07 21:26:12,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:26:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1138 trivial. 0 not checked. [2025-02-07 21:26:12,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210847445] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:26:12,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:26:12,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-07 21:26:12,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854817384] [2025-02-07 21:26:12,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:26:12,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 21:26:12,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:12,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 21:26:12,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-07 21:26:12,844 INFO L87 Difference]: Start difference. First operand 314 states and 418 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 9 states have call successors, (58), 5 states have call predecessors, (58), 6 states have return successors, (59), 7 states have call predecessors, (59), 9 states have call successors, (59) [2025-02-07 21:26:14,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:15,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:26:15,850 INFO L93 Difference]: Finished difference Result 620 states and 834 transitions. [2025-02-07 21:26:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 21:26:15,852 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 9 states have call successors, (58), 5 states have call predecessors, (58), 6 states have return successors, (59), 7 states have call predecessors, (59), 9 states have call successors, (59) Word has length 218 [2025-02-07 21:26:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:26:15,856 INFO L225 Difference]: With dead ends: 620 [2025-02-07 21:26:15,857 INFO L226 Difference]: Without dead ends: 335 [2025-02-07 21:26:15,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 435 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:26:15,860 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 118 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-07 21:26:15,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 400 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-07 21:26:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-02-07 21:26:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2025-02-07 21:26:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 218 states have (on average 1.146788990825688) internal successors, (250), 219 states have internal predecessors, (250), 80 states have call successors, (80), 33 states have call predecessors, (80), 33 states have return successors, (103), 79 states have call predecessors, (103), 80 states have call successors, (103) [2025-02-07 21:26:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 433 transitions. [2025-02-07 21:26:15,893 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 433 transitions. Word has length 218 [2025-02-07 21:26:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:26:15,894 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 433 transitions. [2025-02-07 21:26:15,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 9 states have call successors, (58), 5 states have call predecessors, (58), 6 states have return successors, (59), 7 states have call predecessors, (59), 9 states have call successors, (59) [2025-02-07 21:26:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 433 transitions. [2025-02-07 21:26:15,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-07 21:26:15,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:26:15,897 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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] [2025-02-07 21:26:15,910 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:26:16,098 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:26:16,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:26:16,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:26:16,099 INFO L85 PathProgramCache]: Analyzing trace with hash 491983722, now seen corresponding path program 1 times [2025-02-07 21:26:16,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:26:16,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019106154] [2025-02-07 21:26:16,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:16,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:26:16,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-07 21:26:16,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-07 21:26:16,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:16,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1135 trivial. 0 not checked. [2025-02-07 21:26:17,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:26:17,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019106154] [2025-02-07 21:26:17,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019106154] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:26:17,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456168332] [2025-02-07 21:26:17,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:26:17,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:26:17,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:26:17,699 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:26:17,701 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:26:18,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-07 21:26:18,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-07 21:26:18,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:26:18,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:26:18,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 1777 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-07 21:26:18,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:26:18,716 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:21,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 21:26:21,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:26:21,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2025-02-07 21:26:22,175 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-02-07 21:26:22,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2025-02-07 21:26:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 423 proven. 4 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-02-07 21:26:53,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:26:53,949 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:53,953 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:27:01,169 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:27:01,182 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:27:01,600 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:27:01,614 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:27:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1138 trivial. 0 not checked. [2025-02-07 21:27:02,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456168332] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:27:02,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:27:02,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 10] total 34 [2025-02-07 21:27:02,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666512432] [2025-02-07 21:27:02,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:27:02,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-07 21:27:02,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:27:02,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-07 21:27:02,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=987, Unknown=2, NotChecked=0, Total=1122 [2025-02-07 21:27:02,145 INFO L87 Difference]: Start difference. First operand 332 states and 433 transitions. Second operand has 34 states, 31 states have (on average 4.387096774193548) internal successors, (136), 34 states have internal predecessors, (136), 18 states have call successors, (70), 11 states have call predecessors, (70), 14 states have return successors, (70), 16 states have call predecessors, (70), 18 states have call successors, (70) [2025-02-07 21:27:04,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:27:08,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:27:13,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []