./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-12.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 7d22deea41fa59fa50d8ffe4393e1dc9de22de8468ac22621a99fafe2a1542e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:42:15,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:42:16,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:42:16,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:42:16,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:42:16,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:42:16,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:42:16,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:42:16,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:42:16,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:42:16,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:42:16,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:42:16,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:42:16,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:42:16,048 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:42:16,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:42:16,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:42:16,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:42:16,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:42:16,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:42:16,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:42:16,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:42:16,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:42:16,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:42:16,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:42:16,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:42:16,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:42:16,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:42:16,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:42:16,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:42:16,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:42:16,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:42:16,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:42:16,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:42:16,052 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 -> 7d22deea41fa59fa50d8ffe4393e1dc9de22de8468ac22621a99fafe2a1542e8 [2025-01-09 15:42:16,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:42:16,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:42:16,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:42:16,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:42:16,283 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:42:16,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-12.i [2025-01-09 15:42:17,398 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e946d71b2/165c30721c1b4e3090fa079c30129a00/FLAGdc6b32bbd [2025-01-09 15:42:17,639 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:42:17,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-12.i [2025-01-09 15:42:17,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e946d71b2/165c30721c1b4e3090fa079c30129a00/FLAGdc6b32bbd [2025-01-09 15:42:17,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e946d71b2/165c30721c1b4e3090fa079c30129a00 [2025-01-09 15:42:17,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:42:17,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:42:17,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:42:17,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:42:17,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:42:17,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:42:17" (1/1) ... [2025-01-09 15:42:17,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e449f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:17, skipping insertion in model container [2025-01-09 15:42:17,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:42:17" (1/1) ... [2025-01-09 15:42:17,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:42:18,075 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-12.i[916,929] [2025-01-09 15:42:18,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:42:18,114 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:42:18,121 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-12.i[916,929] [2025-01-09 15:42:18,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:42:18,167 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:42:18,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18 WrapperNode [2025-01-09 15:42:18,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:42:18,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:42:18,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:42:18,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:42:18,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,206 INFO L138 Inliner]: procedures = 26, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 471 [2025-01-09 15:42:18,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:42:18,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:42:18,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:42:18,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:42:18,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,245 INFO L175 MemorySlicer]: Split 123 memory accesses to 12 slices as follows [2, 5, 6, 6, 8, 10, 23, 10, 18, 20, 7, 8]. 19 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1]. [2025-01-09 15:42:18,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:42:18,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:42:18,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:42:18,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:42:18,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (1/1) ... [2025-01-09 15:42:18,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:42:18,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:42:18,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:42:18,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:42:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:42:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:42:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:42:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:42:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:42:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:42:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:42:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:42:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:42:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:42:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:42:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:42:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:42:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:42:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:42:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:42:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:42:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:42:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:42:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:42:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:42:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:42:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:42:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:42:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:42:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:42:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:42:18,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:42:18,422 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:42:18,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:42:18,812 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-01-09 15:42:18,812 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:42:18,821 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:42:18,822 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:42:18,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:42:18 BoogieIcfgContainer [2025-01-09 15:42:18,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:42:18,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:42:18,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:42:18,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:42:18,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:42:17" (1/3) ... [2025-01-09 15:42:18,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8976e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:42:18, skipping insertion in model container [2025-01-09 15:42:18,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:42:18" (2/3) ... [2025-01-09 15:42:18,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8976e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:42:18, skipping insertion in model container [2025-01-09 15:42:18,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:42:18" (3/3) ... [2025-01-09 15:42:18,829 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-12.i [2025-01-09 15:42:18,840 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:42:18,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-12.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:42:18,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:42:18,887 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;@25eee742, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:42:18,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:42:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 15:42:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:42:18,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:18,897 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:18,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:18,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash -253534540, now seen corresponding path program 1 times [2025-01-09 15:42:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:18,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338685719] [2025-01-09 15:42:18,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:18,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:18,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:42:19,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:42:19,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:19,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 15:42:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:19,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338685719] [2025-01-09 15:42:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338685719] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:42:19,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204159283] [2025-01-09 15:42:19,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:19,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:19,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:42:19,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:42:19,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:42:19,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:42:19,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:42:19,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:19,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:19,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:42:19,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:42:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-01-09 15:42:19,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:42:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204159283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:19,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:42:19,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:42:19,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206253155] [2025-01-09 15:42:19,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:19,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:42:19,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:19,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:42:19,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:42:19,342 INFO L87 Difference]: Start difference. First operand has 97 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 15:42:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:19,361 INFO L93 Difference]: Finished difference Result 182 states and 281 transitions. [2025-01-09 15:42:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:42:19,362 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 117 [2025-01-09 15:42:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:19,367 INFO L225 Difference]: With dead ends: 182 [2025-01-09 15:42:19,367 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 15:42:19,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:42:19,371 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:19,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:42:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 15:42:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 15:42:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 15:42:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2025-01-09 15:42:19,402 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 117 [2025-01-09 15:42:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:19,402 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2025-01-09 15:42:19,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 15:42:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2025-01-09 15:42:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 15:42:19,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:19,406 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:19,412 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-01-09 15:42:19,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:42:19,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:19,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1078795924, now seen corresponding path program 1 times [2025-01-09 15:42:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:19,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412211760] [2025-01-09 15:42:19,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:19,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:19,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:42:19,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:42:19,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:19,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 15:42:19,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:19,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412211760] [2025-01-09 15:42:19,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412211760] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:42:19,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138828708] [2025-01-09 15:42:19,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:19,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:19,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:42:19,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:42:19,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:42:20,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 15:42:20,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 15:42:20,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:20,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:20,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:42:20,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:42:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:20,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:42:20,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138828708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:20,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:42:20,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 15:42:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238675631] [2025-01-09 15:42:20,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:20,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:42:20,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:20,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:42:20,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:42:20,163 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:20,186 INFO L93 Difference]: Finished difference Result 173 states and 243 transitions. [2025-01-09 15:42:20,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:42:20,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2025-01-09 15:42:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:20,188 INFO L225 Difference]: With dead ends: 173 [2025-01-09 15:42:20,188 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 15:42:20,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:42:20,189 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:20,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:42:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 15:42:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 15:42:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 15:42:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2025-01-09 15:42:20,197 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 117 [2025-01-09 15:42:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:20,198 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2025-01-09 15:42:20,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2025-01-09 15:42:20,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 15:42:20,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:20,200 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:20,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:42:20,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:20,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:20,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash 928929970, now seen corresponding path program 1 times [2025-01-09 15:42:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055296469] [2025-01-09 15:42:20,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:20,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:42:20,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:42:20,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:20,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 15:42:20,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:20,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055296469] [2025-01-09 15:42:20,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055296469] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:42:20,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361407070] [2025-01-09 15:42:20,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:20,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:20,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:42:20,631 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:42:20,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:42:20,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 15:42:20,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 15:42:20,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:20,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:20,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:42:20,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:42:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:20,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:42:20,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361407070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:20,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:42:20,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:42:20,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280347937] [2025-01-09 15:42:20,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:20,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:42:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:20,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:42:20,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:42:20,836 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:20,872 INFO L93 Difference]: Finished difference Result 176 states and 245 transitions. [2025-01-09 15:42:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:42:20,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2025-01-09 15:42:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:20,874 INFO L225 Difference]: With dead ends: 176 [2025-01-09 15:42:20,874 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 15:42:20,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:42:20,875 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:20,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:42:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 15:42:20,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 15:42:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 15:42:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2025-01-09 15:42:20,887 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 119 [2025-01-09 15:42:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:20,888 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2025-01-09 15:42:20,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2025-01-09 15:42:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 15:42:20,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:20,889 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:20,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:42:21,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:21,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:21,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1684265354, now seen corresponding path program 1 times [2025-01-09 15:42:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:21,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869484419] [2025-01-09 15:42:21,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:21,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 15:42:21,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 15:42:21,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:21,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:21,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:21,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869484419] [2025-01-09 15:42:21,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869484419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:21,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:21,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:42:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888714529] [2025-01-09 15:42:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:21,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:42:21,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:21,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:42:21,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:42:21,942 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 15:42:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:22,364 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2025-01-09 15:42:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:42:22,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 121 [2025-01-09 15:42:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:22,366 INFO L225 Difference]: With dead ends: 165 [2025-01-09 15:42:22,367 INFO L226 Difference]: Without dead ends: 163 [2025-01-09 15:42:22,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:42:22,368 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 181 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:22,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 948 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:42:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-09 15:42:22,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2025-01-09 15:42:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 127 states have (on average 1.2440944881889764) internal successors, (158), 128 states have internal predecessors, (158), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:42:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 218 transitions. [2025-01-09 15:42:22,397 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 218 transitions. Word has length 121 [2025-01-09 15:42:22,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:22,397 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 218 transitions. [2025-01-09 15:42:22,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 15:42:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2025-01-09 15:42:22,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 15:42:22,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:22,401 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:22,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:42:22,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:22,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:22,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1993155792, now seen corresponding path program 1 times [2025-01-09 15:42:22,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:22,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284402126] [2025-01-09 15:42:22,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:22,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:22,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:42:22,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:42:22,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:22,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 108 proven. 36 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-01-09 15:42:24,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:24,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284402126] [2025-01-09 15:42:24,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284402126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:42:24,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161938521] [2025-01-09 15:42:24,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:24,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:24,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:42:24,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:42:24,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:42:24,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 15:42:24,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 15:42:24,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:24,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:24,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-01-09 15:42:24,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:42:24,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:42:25,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:42:25,517 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 27 treesize of output 19 [2025-01-09 15:42:25,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 15:42:25,721 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 40 treesize of output 28 [2025-01-09 15:42:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 46 proven. 302 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-01-09 15:42:25,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:42:26,552 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 42 treesize of output 38 [2025-01-09 15:42:27,079 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 43 treesize of output 39 [2025-01-09 15:42:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 114 proven. 48 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-01-09 15:42:27,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161938521] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:42:27,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:42:27,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27, 26] total 60 [2025-01-09 15:42:27,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372674625] [2025-01-09 15:42:27,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:42:27,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-01-09 15:42:27,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:27,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-01-09 15:42:27,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3207, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 15:42:27,172 INFO L87 Difference]: Start difference. First operand 160 states and 218 transitions. Second operand has 60 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 52 states have internal predecessors, (130), 15 states have call successors, (37), 5 states have call predecessors, (37), 12 states have return successors, (37), 12 states have call predecessors, (37), 15 states have call successors, (37) [2025-01-09 15:42:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:29,707 INFO L93 Difference]: Finished difference Result 274 states and 347 transitions. [2025-01-09 15:42:29,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-09 15:42:29,709 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 52 states have internal predecessors, (130), 15 states have call successors, (37), 5 states have call predecessors, (37), 12 states have return successors, (37), 12 states have call predecessors, (37), 15 states have call successors, (37) Word has length 122 [2025-01-09 15:42:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:29,711 INFO L225 Difference]: With dead ends: 274 [2025-01-09 15:42:29,711 INFO L226 Difference]: Without dead ends: 272 [2025-01-09 15:42:29,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2618 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1629, Invalid=9083, Unknown=0, NotChecked=0, Total=10712 [2025-01-09 15:42:29,718 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 1267 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:29,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 2215 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1963 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 15:42:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-09 15:42:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 184. [2025-01-09 15:42:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 145 states have (on average 1.2137931034482758) internal successors, (176), 146 states have internal predecessors, (176), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:42:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 236 transitions. [2025-01-09 15:42:29,745 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 236 transitions. Word has length 122 [2025-01-09 15:42:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:29,745 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 236 transitions. [2025-01-09 15:42:29,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 52 states have internal predecessors, (130), 15 states have call successors, (37), 5 states have call predecessors, (37), 12 states have return successors, (37), 12 states have call predecessors, (37), 15 states have call successors, (37) [2025-01-09 15:42:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 236 transitions. [2025-01-09 15:42:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 15:42:29,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:29,746 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:29,754 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-01-09 15:42:29,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:29,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:29,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2071042037, now seen corresponding path program 1 times [2025-01-09 15:42:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925845593] [2025-01-09 15:42:29,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:29,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:42:30,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:42:30,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:30,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 108 proven. 36 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-01-09 15:42:31,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:31,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925845593] [2025-01-09 15:42:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925845593] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:42:31,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183539377] [2025-01-09 15:42:31,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:31,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:31,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:42:31,321 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:42:31,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 15:42:31,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 15:42:31,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 15:42:31,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:31,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:31,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-01-09 15:42:31,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:42:31,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:42:32,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:42:32,548 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 17 [2025-01-09 15:42:32,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 15:42:32,705 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 52 treesize of output 40 [2025-01-09 15:42:32,713 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 40 treesize of output 28 [2025-01-09 15:42:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 46 proven. 302 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-01-09 15:42:32,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:42:33,434 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 42 treesize of output 38 [2025-01-09 15:42:33,912 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 43 treesize of output 39 [2025-01-09 15:42:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 114 proven. 48 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-01-09 15:42:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183539377] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:42:34,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:42:34,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28, 27] total 62 [2025-01-09 15:42:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763968573] [2025-01-09 15:42:34,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:42:34,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-01-09 15:42:34,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:34,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-01-09 15:42:34,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=3444, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 15:42:34,010 INFO L87 Difference]: Start difference. First operand 184 states and 236 transitions. Second operand has 62 states, 50 states have (on average 2.64) internal successors, (132), 54 states have internal predecessors, (132), 15 states have call successors, (37), 5 states have call predecessors, (37), 12 states have return successors, (37), 12 states have call predecessors, (37), 15 states have call successors, (37) [2025-01-09 15:42:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:35,731 INFO L93 Difference]: Finished difference Result 205 states and 255 transitions. [2025-01-09 15:42:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 15:42:35,731 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 50 states have (on average 2.64) internal successors, (132), 54 states have internal predecessors, (132), 15 states have call successors, (37), 5 states have call predecessors, (37), 12 states have return successors, (37), 12 states have call predecessors, (37), 15 states have call successors, (37) Word has length 123 [2025-01-09 15:42:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:35,733 INFO L225 Difference]: With dead ends: 205 [2025-01-09 15:42:35,733 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 15:42:35,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2204 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1416, Invalid=7896, Unknown=0, NotChecked=0, Total=9312 [2025-01-09 15:42:35,736 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1362 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:35,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 1688 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:42:35,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 15:42:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 189. [2025-01-09 15:42:35,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 149 states have (on average 1.2080536912751678) internal successors, (180), 150 states have internal predecessors, (180), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:42:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 240 transitions. [2025-01-09 15:42:35,762 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 240 transitions. Word has length 123 [2025-01-09 15:42:35,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:35,763 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 240 transitions. [2025-01-09 15:42:35,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 50 states have (on average 2.64) internal successors, (132), 54 states have internal predecessors, (132), 15 states have call successors, (37), 5 states have call predecessors, (37), 12 states have return successors, (37), 12 states have call predecessors, (37), 15 states have call successors, (37) [2025-01-09 15:42:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 240 transitions. [2025-01-09 15:42:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:42:35,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:35,764 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:35,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 15:42:35,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:35,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:35,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:35,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1257942411, now seen corresponding path program 1 times [2025-01-09 15:42:35,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:35,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585444267] [2025-01-09 15:42:35,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:35,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:35,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:42:36,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:42:36,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:36,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 15:42:36,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:36,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585444267] [2025-01-09 15:42:36,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585444267] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:42:36,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207835462] [2025-01-09 15:42:36,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:36,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:36,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:42:36,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:42:36,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 15:42:36,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:42:36,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:42:36,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:36,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:36,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 15:42:36,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:42:36,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:42:36,670 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 35 treesize of output 23 [2025-01-09 15:42:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 10 proven. 250 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:42:36,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:42:36,823 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 27 treesize of output 23 [2025-01-09 15:42:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 15:42:36,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207835462] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:42:36,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:42:36,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2025-01-09 15:42:36,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588230302] [2025-01-09 15:42:36,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:42:36,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:42:36,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:36,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:42:36,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:42:36,855 INFO L87 Difference]: Start difference. First operand 189 states and 240 transitions. Second operand has 17 states, 14 states have (on average 6.214285714285714) internal successors, (87), 17 states have internal predecessors, (87), 10 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 7 states have call predecessors, (48), 10 states have call successors, (48) [2025-01-09 15:42:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:37,142 INFO L93 Difference]: Finished difference Result 391 states and 491 transitions. [2025-01-09 15:42:37,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:42:37,145 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 6.214285714285714) internal successors, (87), 17 states have internal predecessors, (87), 10 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 7 states have call predecessors, (48), 10 states have call successors, (48) Word has length 124 [2025-01-09 15:42:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:37,146 INFO L225 Difference]: With dead ends: 391 [2025-01-09 15:42:37,146 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 15:42:37,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2025-01-09 15:42:37,150 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 162 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:37,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 507 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:42:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 15:42:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 197. [2025-01-09 15:42:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 155 states have (on average 1.1935483870967742) internal successors, (185), 156 states have internal predecessors, (185), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:42:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 245 transitions. [2025-01-09 15:42:37,172 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 245 transitions. Word has length 124 [2025-01-09 15:42:37,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:37,172 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 245 transitions. [2025-01-09 15:42:37,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 6.214285714285714) internal successors, (87), 17 states have internal predecessors, (87), 10 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 7 states have call predecessors, (48), 10 states have call successors, (48) [2025-01-09 15:42:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 245 transitions. [2025-01-09 15:42:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 15:42:37,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:37,173 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:37,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 15:42:37,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 15:42:37,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:37,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:37,374 INFO L85 PathProgramCache]: Analyzing trace with hash -810147536, now seen corresponding path program 1 times [2025-01-09 15:42:37,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:37,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765166806] [2025-01-09 15:42:37,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:37,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:37,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 15:42:37,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 15:42:37,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:37,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:37,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:37,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765166806] [2025-01-09 15:42:37,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765166806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:37,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:37,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:42:37,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792751008] [2025-01-09 15:42:37,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:37,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:42:37,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:37,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:42:37,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:42:37,448 INFO L87 Difference]: Start difference. First operand 197 states and 245 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:37,494 INFO L93 Difference]: Finished difference Result 453 states and 563 transitions. [2025-01-09 15:42:37,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:42:37,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2025-01-09 15:42:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:37,496 INFO L225 Difference]: With dead ends: 453 [2025-01-09 15:42:37,497 INFO L226 Difference]: Without dead ends: 259 [2025-01-09 15:42:37,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:42:37,498 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 32 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:37,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 455 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:42:37,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-09 15:42:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 218. [2025-01-09 15:42:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:42:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 269 transitions. [2025-01-09 15:42:37,521 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 269 transitions. Word has length 124 [2025-01-09 15:42:37,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:37,521 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 269 transitions. [2025-01-09 15:42:37,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 269 transitions. [2025-01-09 15:42:37,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 15:42:37,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:37,522 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:37,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:42:37,523 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:37,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1964205882, now seen corresponding path program 1 times [2025-01-09 15:42:37,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:37,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983750741] [2025-01-09 15:42:37,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:37,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:37,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:42:37,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:42:37,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:37,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 15:42:37,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983750741] [2025-01-09 15:42:37,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983750741] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:42:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097275090] [2025-01-09 15:42:37,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:37,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:37,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:42:37,872 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:42:37,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 15:42:37,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 15:42:37,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 15:42:37,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:37,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:38,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 15:42:38,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:42:38,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:42:38,229 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 35 treesize of output 23 [2025-01-09 15:42:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 10 proven. 250 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:42:38,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:42:38,413 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 27 treesize of output 23 [2025-01-09 15:42:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 15:42:38,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097275090] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:42:38,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:42:38,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2025-01-09 15:42:38,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621879998] [2025-01-09 15:42:38,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:42:38,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:42:38,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:38,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:42:38,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:42:38,448 INFO L87 Difference]: Start difference. First operand 218 states and 269 transitions. Second operand has 17 states, 14 states have (on average 7.071428571428571) internal successors, (99), 17 states have internal predecessors, (99), 10 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 7 states have call predecessors, (48), 10 states have call successors, (48) [2025-01-09 15:42:38,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:38,735 INFO L93 Difference]: Finished difference Result 441 states and 543 transitions. [2025-01-09 15:42:38,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:42:38,736 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 7.071428571428571) internal successors, (99), 17 states have internal predecessors, (99), 10 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 7 states have call predecessors, (48), 10 states have call successors, (48) Word has length 125 [2025-01-09 15:42:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:38,743 INFO L225 Difference]: With dead ends: 441 [2025-01-09 15:42:38,743 INFO L226 Difference]: Without dead ends: 226 [2025-01-09 15:42:38,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2025-01-09 15:42:38,744 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 430 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:38,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 501 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:42:38,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-01-09 15:42:38,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2025-01-09 15:42:38,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 176 states have (on average 1.1761363636363635) internal successors, (207), 177 states have internal predecessors, (207), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:42:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2025-01-09 15:42:38,763 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 125 [2025-01-09 15:42:38,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:38,764 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2025-01-09 15:42:38,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 7.071428571428571) internal successors, (99), 17 states have internal predecessors, (99), 10 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 7 states have call predecessors, (48), 10 states have call successors, (48) [2025-01-09 15:42:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2025-01-09 15:42:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 15:42:38,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:38,765 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:38,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 15:42:38,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:38,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:38,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2065942149, now seen corresponding path program 1 times [2025-01-09 15:42:38,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:38,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394855756] [2025-01-09 15:42:38,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:38,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:38,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:42:39,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:42:39,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:39,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:42:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [624843116] [2025-01-09 15:42:39,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:39,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:39,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:42:39,011 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:42:39,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 15:42:39,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 15:42:39,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 15:42:39,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:39,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:39,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 15:42:39,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:42:39,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:42:39,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:42:39,900 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 33 treesize of output 25 [2025-01-09 15:42:39,905 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 63 treesize of output 43 [2025-01-09 15:42:39,908 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 44 treesize of output 32 [2025-01-09 15:42:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-01-09 15:42:39,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:42:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:40,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394855756] [2025-01-09 15:42:40,170 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:42:40,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624843116] [2025-01-09 15:42:40,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624843116] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:42:40,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:42:40,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-01-09 15:42:40,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004410528] [2025-01-09 15:42:40,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:40,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:42:40,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:40,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:42:40,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:42:40,171 INFO L87 Difference]: Start difference. First operand 218 states and 267 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:40,456 INFO L93 Difference]: Finished difference Result 477 states and 579 transitions. [2025-01-09 15:42:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:42:40,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2025-01-09 15:42:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:40,458 INFO L225 Difference]: With dead ends: 477 [2025-01-09 15:42:40,458 INFO L226 Difference]: Without dead ends: 262 [2025-01-09 15:42:40,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:42:40,459 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 155 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:40,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 506 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:42:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-09 15:42:40,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 259. [2025-01-09 15:42:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 202 states have (on average 1.1485148514851484) internal successors, (232), 204 states have internal predecessors, (232), 40 states have call successors, (40), 16 states have call predecessors, (40), 16 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:42:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 312 transitions. [2025-01-09 15:42:40,480 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 312 transitions. Word has length 126 [2025-01-09 15:42:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:40,480 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 312 transitions. [2025-01-09 15:42:40,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 312 transitions. [2025-01-09 15:42:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 15:42:40,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:40,481 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:40,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 15:42:40,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:40,682 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:40,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:40,682 INFO L85 PathProgramCache]: Analyzing trace with hash -861187360, now seen corresponding path program 1 times [2025-01-09 15:42:40,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:40,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800487157] [2025-01-09 15:42:40,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:40,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:40,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:42:40,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:42:40,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:40,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:42:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399305540] [2025-01-09 15:42:40,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:40,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:40,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:42:40,727 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:42:40,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 15:42:40,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 15:42:41,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 15:42:41,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:41,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:41,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 15:42:41,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:42:41,222 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 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-09 15:42:41,281 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 35 treesize of output 27 [2025-01-09 15:42:41,284 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 31 treesize of output 23 [2025-01-09 15:42:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-01-09 15:42:41,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:42:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:41,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800487157] [2025-01-09 15:42:41,424 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:42:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399305540] [2025-01-09 15:42:41,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399305540] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:42:41,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:42:41,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 15:42:41,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249204372] [2025-01-09 15:42:41,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:41,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:42:41,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:41,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:42:41,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:42:41,426 INFO L87 Difference]: Start difference. First operand 259 states and 312 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:41,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:41,679 INFO L93 Difference]: Finished difference Result 563 states and 674 transitions. [2025-01-09 15:42:41,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:42:41,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2025-01-09 15:42:41,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:41,682 INFO L225 Difference]: With dead ends: 563 [2025-01-09 15:42:41,682 INFO L226 Difference]: Without dead ends: 344 [2025-01-09 15:42:41,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:42:41,683 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 96 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:41,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 295 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:42:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-01-09 15:42:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 299. [2025-01-09 15:42:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 241 states have (on average 1.1535269709543567) internal successors, (278), 243 states have internal predecessors, (278), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:42:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 358 transitions. [2025-01-09 15:42:41,709 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 358 transitions. Word has length 127 [2025-01-09 15:42:41,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:41,709 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 358 transitions. [2025-01-09 15:42:41,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 358 transitions. [2025-01-09 15:42:41,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 15:42:41,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:41,710 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:41,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 15:42:41,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:41,911 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:41,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:41,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1599192998, now seen corresponding path program 1 times [2025-01-09 15:42:41,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:41,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35645517] [2025-01-09 15:42:41,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:41,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:41,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:42:41,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:42:41,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:41,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:42:41,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [423693742] [2025-01-09 15:42:41,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:41,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:41,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:42:41,961 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:42:41,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 15:42:42,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:42:42,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:42:42,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:42,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:42,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 15:42:42,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:42:42,438 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 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-09 15:42:42,512 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 35 treesize of output 27 [2025-01-09 15:42:42,514 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 45 treesize of output 25 [2025-01-09 15:42:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 15:42:42,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:42:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:42,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:42,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35645517] [2025-01-09 15:42:42,746 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:42:42,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423693742] [2025-01-09 15:42:42,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423693742] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:42:42,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:42:42,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2025-01-09 15:42:42,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637792601] [2025-01-09 15:42:42,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:42,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:42:42,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:42,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:42:42,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:42:42,747 INFO L87 Difference]: Start difference. First operand 299 states and 358 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:43,069 INFO L93 Difference]: Finished difference Result 647 states and 770 transitions. [2025-01-09 15:42:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:42:43,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2025-01-09 15:42:43,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:43,071 INFO L225 Difference]: With dead ends: 647 [2025-01-09 15:42:43,072 INFO L226 Difference]: Without dead ends: 351 [2025-01-09 15:42:43,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:42:43,073 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 163 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:43,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 536 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:42:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-09 15:42:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 348. [2025-01-09 15:42:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 272 states have (on average 1.1323529411764706) internal successors, (308), 275 states have internal predecessors, (308), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 412 transitions. [2025-01-09 15:42:43,104 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 412 transitions. Word has length 128 [2025-01-09 15:42:43,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:43,105 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 412 transitions. [2025-01-09 15:42:43,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 412 transitions. [2025-01-09 15:42:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 15:42:43,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:43,106 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:43,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 15:42:43,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 15:42:43,306 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:43,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash 45224986, now seen corresponding path program 1 times [2025-01-09 15:42:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:43,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224330103] [2025-01-09 15:42:43,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:43,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:43,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:42:43,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:42:43,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:43,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:42:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [679923325] [2025-01-09 15:42:43,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:43,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:42:43,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:42:43,349 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:42:43,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 15:42:43,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 15:42:43,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 15:42:43,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:43,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:43,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 15:42:43,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:42:43,928 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 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-09 15:42:43,990 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 49 treesize of output 29 [2025-01-09 15:42:43,994 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 27 treesize of output 19 [2025-01-09 15:42:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 15:42:44,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:42:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:44,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:44,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224330103] [2025-01-09 15:42:44,168 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:42:44,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679923325] [2025-01-09 15:42:44,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679923325] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:42:44,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:42:44,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2025-01-09 15:42:44,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409068972] [2025-01-09 15:42:44,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:44,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:42:44,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:44,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:42:44,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:42:44,169 INFO L87 Difference]: Start difference. First operand 348 states and 412 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:44,454 INFO L93 Difference]: Finished difference Result 658 states and 777 transitions. [2025-01-09 15:42:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:42:44,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2025-01-09 15:42:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:44,456 INFO L225 Difference]: With dead ends: 658 [2025-01-09 15:42:44,456 INFO L226 Difference]: Without dead ends: 358 [2025-01-09 15:42:44,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:42:44,457 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 70 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:44,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 539 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:42:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-01-09 15:42:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 305. [2025-01-09 15:42:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 243 states have (on average 1.139917695473251) internal successors, (277), 245 states have internal predecessors, (277), 42 states have call successors, (42), 19 states have call predecessors, (42), 19 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:42:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 361 transitions. [2025-01-09 15:42:44,485 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 361 transitions. Word has length 128 [2025-01-09 15:42:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:44,486 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 361 transitions. [2025-01-09 15:42:44,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 361 transitions. [2025-01-09 15:42:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:44,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:44,486 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:44,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 15:42:44,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 15:42:44,687 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:44,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:44,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1514792543, now seen corresponding path program 1 times [2025-01-09 15:42:44,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:44,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110369186] [2025-01-09 15:42:44,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:44,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:44,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:44,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:44,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:44,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:45,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110369186] [2025-01-09 15:42:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110369186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:45,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:45,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:42:45,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059980607] [2025-01-09 15:42:45,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:45,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:42:45,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:45,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:42:45,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:42:45,124 INFO L87 Difference]: Start difference. First operand 305 states and 361 transitions. Second operand has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 15:42:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:45,619 INFO L93 Difference]: Finished difference Result 817 states and 971 transitions. [2025-01-09 15:42:45,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:42:45,620 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 129 [2025-01-09 15:42:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:45,622 INFO L225 Difference]: With dead ends: 817 [2025-01-09 15:42:45,622 INFO L226 Difference]: Without dead ends: 515 [2025-01-09 15:42:45,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:42:45,623 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 368 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:45,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 882 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:42:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-01-09 15:42:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 343. [2025-01-09 15:42:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 281 states have (on average 1.1601423487544484) internal successors, (326), 283 states have internal predecessors, (326), 42 states have call successors, (42), 19 states have call predecessors, (42), 19 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:42:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 410 transitions. [2025-01-09 15:42:45,673 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 410 transitions. Word has length 129 [2025-01-09 15:42:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:45,673 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 410 transitions. [2025-01-09 15:42:45,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 15:42:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 410 transitions. [2025-01-09 15:42:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:45,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:45,674 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:45,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:42:45,674 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:45,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1666256968, now seen corresponding path program 1 times [2025-01-09 15:42:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:45,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798922683] [2025-01-09 15:42:45,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:45,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:45,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:45,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:45,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:45,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:46,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:46,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798922683] [2025-01-09 15:42:46,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798922683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:46,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:46,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:42:46,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47720802] [2025-01-09 15:42:46,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:46,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:42:46,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:46,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:42:46,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:42:46,139 INFO L87 Difference]: Start difference. First operand 343 states and 410 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:46,617 INFO L93 Difference]: Finished difference Result 939 states and 1122 transitions. [2025-01-09 15:42:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 15:42:46,618 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-01-09 15:42:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:46,620 INFO L225 Difference]: With dead ends: 939 [2025-01-09 15:42:46,620 INFO L226 Difference]: Without dead ends: 599 [2025-01-09 15:42:46,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:42:46,621 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 90 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:46,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1908 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:42:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-01-09 15:42:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 424. [2025-01-09 15:42:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 362 states have (on average 1.1906077348066297) internal successors, (431), 364 states have internal predecessors, (431), 42 states have call successors, (42), 19 states have call predecessors, (42), 19 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:42:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 515 transitions. [2025-01-09 15:42:46,672 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 515 transitions. Word has length 129 [2025-01-09 15:42:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:46,673 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 515 transitions. [2025-01-09 15:42:46,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 515 transitions. [2025-01-09 15:42:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:46,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:46,673 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:46,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:42:46,677 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:46,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2059283978, now seen corresponding path program 1 times [2025-01-09 15:42:46,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:46,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561276919] [2025-01-09 15:42:46,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:46,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:46,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:46,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:46,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:46,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:46,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:46,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561276919] [2025-01-09 15:42:46,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561276919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:46,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:46,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:42:46,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081051193] [2025-01-09 15:42:46,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:46,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:42:46,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:46,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:42:46,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:42:46,894 INFO L87 Difference]: Start difference. First operand 424 states and 515 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:42:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:47,225 INFO L93 Difference]: Finished difference Result 1087 states and 1316 transitions. [2025-01-09 15:42:47,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:42:47,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-01-09 15:42:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:47,228 INFO L225 Difference]: With dead ends: 1087 [2025-01-09 15:42:47,229 INFO L226 Difference]: Without dead ends: 666 [2025-01-09 15:42:47,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:42:47,231 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 172 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:47,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 581 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:42:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-01-09 15:42:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 534. [2025-01-09 15:42:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 457 states have (on average 1.1947483588621444) internal successors, (546), 460 states have internal predecessors, (546), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 650 transitions. [2025-01-09 15:42:47,290 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 650 transitions. Word has length 129 [2025-01-09 15:42:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:47,290 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 650 transitions. [2025-01-09 15:42:47,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:42:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 650 transitions. [2025-01-09 15:42:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:47,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:47,291 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:47,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:42:47,291 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:47,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1256627105, now seen corresponding path program 1 times [2025-01-09 15:42:47,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:47,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033323616] [2025-01-09 15:42:47,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:47,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:47,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:47,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:47,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:47,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:47,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033323616] [2025-01-09 15:42:47,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033323616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:47,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:47,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:42:47,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663576052] [2025-01-09 15:42:47,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:47,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:42:47,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:47,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:42:47,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:42:47,507 INFO L87 Difference]: Start difference. First operand 534 states and 650 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:42:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:47,794 INFO L93 Difference]: Finished difference Result 1194 states and 1439 transitions. [2025-01-09 15:42:47,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:42:47,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-01-09 15:42:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:47,797 INFO L225 Difference]: With dead ends: 1194 [2025-01-09 15:42:47,797 INFO L226 Difference]: Without dead ends: 663 [2025-01-09 15:42:47,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:42:47,798 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 172 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:47,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 581 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:42:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-01-09 15:42:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 531. [2025-01-09 15:42:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 454 states have (on average 1.169603524229075) internal successors, (531), 457 states have internal predecessors, (531), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 635 transitions. [2025-01-09 15:42:47,853 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 635 transitions. Word has length 129 [2025-01-09 15:42:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:47,853 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 635 transitions. [2025-01-09 15:42:47,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:42:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 635 transitions. [2025-01-09 15:42:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:47,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:47,855 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:47,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:42:47,855 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:47,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:47,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1800270474, now seen corresponding path program 1 times [2025-01-09 15:42:47,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:47,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188463204] [2025-01-09 15:42:47,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:47,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:47,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:47,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:47,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:47,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188463204] [2025-01-09 15:42:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188463204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:47,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:42:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659130692] [2025-01-09 15:42:47,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:47,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:42:47,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:47,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:42:47,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:42:47,998 INFO L87 Difference]: Start difference. First operand 531 states and 635 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:48,183 INFO L93 Difference]: Finished difference Result 1155 states and 1373 transitions. [2025-01-09 15:42:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:42:48,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-01-09 15:42:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:48,187 INFO L225 Difference]: With dead ends: 1155 [2025-01-09 15:42:48,187 INFO L226 Difference]: Without dead ends: 627 [2025-01-09 15:42:48,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:42:48,188 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 90 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:48,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 564 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:42:48,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-01-09 15:42:48,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 495. [2025-01-09 15:42:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 418 states have (on average 1.167464114832536) internal successors, (488), 421 states have internal predecessors, (488), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 592 transitions. [2025-01-09 15:42:48,244 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 592 transitions. Word has length 129 [2025-01-09 15:42:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:48,244 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 592 transitions. [2025-01-09 15:42:48,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 592 transitions. [2025-01-09 15:42:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:48,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:48,246 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:48,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:42:48,247 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:48,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:48,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1019922486, now seen corresponding path program 1 times [2025-01-09 15:42:48,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:48,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596471728] [2025-01-09 15:42:48,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:48,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:48,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:48,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:48,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:48,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:49,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:49,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596471728] [2025-01-09 15:42:49,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596471728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:49,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:49,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 15:42:49,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388485801] [2025-01-09 15:42:49,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:49,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 15:42:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:49,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 15:42:49,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:42:49,130 INFO L87 Difference]: Start difference. First operand 495 states and 592 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:42:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:50,178 INFO L93 Difference]: Finished difference Result 1219 states and 1447 transitions. [2025-01-09 15:42:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 15:42:50,180 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-01-09 15:42:50,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:50,183 INFO L225 Difference]: With dead ends: 1219 [2025-01-09 15:42:50,183 INFO L226 Difference]: Without dead ends: 727 [2025-01-09 15:42:50,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=1176, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 15:42:50,185 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 181 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:50,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1777 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:42:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-01-09 15:42:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 537. [2025-01-09 15:42:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 460 states have (on average 1.1782608695652175) internal successors, (542), 463 states have internal predecessors, (542), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 646 transitions. [2025-01-09 15:42:50,247 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 646 transitions. Word has length 129 [2025-01-09 15:42:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:50,247 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 646 transitions. [2025-01-09 15:42:50,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:42:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 646 transitions. [2025-01-09 15:42:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:50,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:50,248 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:50,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:42:50,248 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:50,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1412949496, now seen corresponding path program 1 times [2025-01-09 15:42:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:50,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152809992] [2025-01-09 15:42:50,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:50,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:50,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:50,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:50,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:50,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:50,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152809992] [2025-01-09 15:42:50,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152809992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:50,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:50,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:42:50,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345724662] [2025-01-09 15:42:50,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:50,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:42:50,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:50,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:42:50,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:42:50,495 INFO L87 Difference]: Start difference. First operand 537 states and 646 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:42:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:50,891 INFO L93 Difference]: Finished difference Result 1203 states and 1437 transitions. [2025-01-09 15:42:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:42:50,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-01-09 15:42:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:50,895 INFO L225 Difference]: With dead ends: 1203 [2025-01-09 15:42:50,895 INFO L226 Difference]: Without dead ends: 669 [2025-01-09 15:42:50,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:42:50,897 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 166 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:50,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 581 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:42:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-01-09 15:42:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 539. [2025-01-09 15:42:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 462 states have (on average 1.1688311688311688) internal successors, (540), 465 states have internal predecessors, (540), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 644 transitions. [2025-01-09 15:42:50,974 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 644 transitions. Word has length 129 [2025-01-09 15:42:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:50,975 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 644 transitions. [2025-01-09 15:42:50,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:42:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 644 transitions. [2025-01-09 15:42:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:50,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:50,977 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:50,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:42:50,977 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:50,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:50,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1171386911, now seen corresponding path program 1 times [2025-01-09 15:42:50,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:50,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587252652] [2025-01-09 15:42:50,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:50,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:50,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:51,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:51,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:51,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:51,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:51,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587252652] [2025-01-09 15:42:51,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587252652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:51,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:51,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:42:51,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891799484] [2025-01-09 15:42:51,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:51,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:42:51,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:51,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:42:51,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:42:51,244 INFO L87 Difference]: Start difference. First operand 539 states and 644 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:42:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:51,630 INFO L93 Difference]: Finished difference Result 1226 states and 1453 transitions. [2025-01-09 15:42:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:42:51,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-01-09 15:42:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:51,634 INFO L225 Difference]: With dead ends: 1226 [2025-01-09 15:42:51,634 INFO L226 Difference]: Without dead ends: 690 [2025-01-09 15:42:51,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:42:51,635 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 242 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:51,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 742 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:42:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-01-09 15:42:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 535. [2025-01-09 15:42:51,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 458 states have (on average 1.1572052401746724) internal successors, (530), 461 states have internal predecessors, (530), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 634 transitions. [2025-01-09 15:42:51,760 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 634 transitions. Word has length 129 [2025-01-09 15:42:51,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:51,761 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 634 transitions. [2025-01-09 15:42:51,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:42:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 634 transitions. [2025-01-09 15:42:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:51,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:51,763 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:51,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:42:51,763 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:51,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:51,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1153935992, now seen corresponding path program 1 times [2025-01-09 15:42:51,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:51,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932479592] [2025-01-09 15:42:51,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:51,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:51,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:51,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:51,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:51,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:52,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:52,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932479592] [2025-01-09 15:42:52,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932479592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:52,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:52,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:42:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107245180] [2025-01-09 15:42:52,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:52,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:42:52,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:52,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:42:52,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:42:52,019 INFO L87 Difference]: Start difference. First operand 535 states and 634 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:42:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:52,362 INFO L93 Difference]: Finished difference Result 1135 states and 1336 transitions. [2025-01-09 15:42:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:42:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-01-09 15:42:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:52,367 INFO L225 Difference]: With dead ends: 1135 [2025-01-09 15:42:52,367 INFO L226 Difference]: Without dead ends: 603 [2025-01-09 15:42:52,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:42:52,369 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 261 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:52,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 591 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:42:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-01-09 15:42:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 488. [2025-01-09 15:42:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 411 states have (on average 1.1532846715328466) internal successors, (474), 414 states have internal predecessors, (474), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 578 transitions. [2025-01-09 15:42:52,523 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 578 transitions. Word has length 129 [2025-01-09 15:42:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:52,523 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 578 transitions. [2025-01-09 15:42:52,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:42:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 578 transitions. [2025-01-09 15:42:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:52,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:52,525 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:52,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:42:52,525 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:52,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:52,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1452752929, now seen corresponding path program 1 times [2025-01-09 15:42:52,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:52,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325924911] [2025-01-09 15:42:52,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:52,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:52,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:52,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:52,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:52,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:53,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:53,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325924911] [2025-01-09 15:42:53,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325924911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:53,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:53,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:42:53,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342995694] [2025-01-09 15:42:53,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:53,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:42:53,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:53,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:42:53,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:42:53,010 INFO L87 Difference]: Start difference. First operand 488 states and 578 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 15:42:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:53,334 INFO L93 Difference]: Finished difference Result 932 states and 1097 transitions. [2025-01-09 15:42:53,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:42:53,334 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 129 [2025-01-09 15:42:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:53,336 INFO L225 Difference]: With dead ends: 932 [2025-01-09 15:42:53,336 INFO L226 Difference]: Without dead ends: 447 [2025-01-09 15:42:53,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:42:53,337 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 247 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:53,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 425 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:42:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-01-09 15:42:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-01-09 15:42:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 370 states have (on average 1.127027027027027) internal successors, (417), 373 states have internal predecessors, (417), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 521 transitions. [2025-01-09 15:42:53,407 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 521 transitions. Word has length 129 [2025-01-09 15:42:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:53,408 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 521 transitions. [2025-01-09 15:42:53,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 15:42:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 521 transitions. [2025-01-09 15:42:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:53,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:53,409 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:53,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:42:53,409 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:53,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:53,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1586766435, now seen corresponding path program 1 times [2025-01-09 15:42:53,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:53,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045578897] [2025-01-09 15:42:53,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:53,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:53,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:53,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:53,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:53,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:53,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:53,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045578897] [2025-01-09 15:42:53,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045578897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:53,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:53,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:42:53,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474699659] [2025-01-09 15:42:53,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:53,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:42:53,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:53,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:42:53,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:42:53,650 INFO L87 Difference]: Start difference. First operand 447 states and 521 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:53,937 INFO L93 Difference]: Finished difference Result 1054 states and 1219 transitions. [2025-01-09 15:42:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:42:53,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-01-09 15:42:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:53,940 INFO L225 Difference]: With dead ends: 1054 [2025-01-09 15:42:53,940 INFO L226 Difference]: Without dead ends: 610 [2025-01-09 15:42:53,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:42:53,942 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 82 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:53,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 588 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:42:53,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-01-09 15:42:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 447. [2025-01-09 15:42:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 370 states have (on average 1.1189189189189188) internal successors, (414), 373 states have internal predecessors, (414), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 518 transitions. [2025-01-09 15:42:54,012 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 518 transitions. Word has length 129 [2025-01-09 15:42:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:54,012 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 518 transitions. [2025-01-09 15:42:54,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 518 transitions. [2025-01-09 15:42:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:54,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:54,013 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:54,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:42:54,013 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:54,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1328600997, now seen corresponding path program 1 times [2025-01-09 15:42:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:54,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958046824] [2025-01-09 15:42:54,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:54,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:54,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:54,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:54,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:54,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:54,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958046824] [2025-01-09 15:42:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958046824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:54,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:54,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:42:54,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468241746] [2025-01-09 15:42:54,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:54,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:42:54,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:54,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:42:54,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:42:54,609 INFO L87 Difference]: Start difference. First operand 447 states and 518 transitions. Second operand has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 15:42:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:55,277 INFO L93 Difference]: Finished difference Result 1089 states and 1262 transitions. [2025-01-09 15:42:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:42:55,278 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 129 [2025-01-09 15:42:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:55,280 INFO L225 Difference]: With dead ends: 1089 [2025-01-09 15:42:55,280 INFO L226 Difference]: Without dead ends: 645 [2025-01-09 15:42:55,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:42:55,281 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 233 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:55,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1021 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:42:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-01-09 15:42:55,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 482. [2025-01-09 15:42:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 405 states have (on average 1.123456790123457) internal successors, (455), 408 states have internal predecessors, (455), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 559 transitions. [2025-01-09 15:42:55,349 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 559 transitions. Word has length 129 [2025-01-09 15:42:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:55,349 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 559 transitions. [2025-01-09 15:42:55,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 15:42:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 559 transitions. [2025-01-09 15:42:55,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:55,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:55,350 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:55,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:42:55,350 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:55,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1480065422, now seen corresponding path program 1 times [2025-01-09 15:42:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:55,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382937892] [2025-01-09 15:42:55,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:55,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:55,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:55,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:55,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:55,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:55,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:55,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382937892] [2025-01-09 15:42:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382937892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:55,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:55,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:42:55,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846202099] [2025-01-09 15:42:55,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:55,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:42:55,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:55,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:42:55,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:42:55,547 INFO L87 Difference]: Start difference. First operand 482 states and 559 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:55,850 INFO L93 Difference]: Finished difference Result 1124 states and 1295 transitions. [2025-01-09 15:42:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:42:55,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-01-09 15:42:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:55,853 INFO L225 Difference]: With dead ends: 1124 [2025-01-09 15:42:55,853 INFO L226 Difference]: Without dead ends: 645 [2025-01-09 15:42:55,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:42:55,854 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 79 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:55,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 588 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:42:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-01-09 15:42:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 482. [2025-01-09 15:42:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 405 states have (on average 1.1160493827160494) internal successors, (452), 408 states have internal predecessors, (452), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 556 transitions. [2025-01-09 15:42:55,921 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 556 transitions. Word has length 129 [2025-01-09 15:42:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:55,921 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 556 transitions. [2025-01-09 15:42:55,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 556 transitions. [2025-01-09 15:42:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:55,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:55,922 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:55,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:42:55,922 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:55,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:55,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1873092432, now seen corresponding path program 1 times [2025-01-09 15:42:55,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:55,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884020063] [2025-01-09 15:42:55,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:55,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:55,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:55,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:55,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:55,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:56,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:56,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884020063] [2025-01-09 15:42:56,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884020063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:56,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:42:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710390570] [2025-01-09 15:42:56,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:56,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:42:56,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:56,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:42:56,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:42:56,354 INFO L87 Difference]: Start difference. First operand 482 states and 556 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:56,885 INFO L93 Difference]: Finished difference Result 1127 states and 1292 transitions. [2025-01-09 15:42:56,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 15:42:56,886 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-01-09 15:42:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:56,888 INFO L225 Difference]: With dead ends: 1127 [2025-01-09 15:42:56,888 INFO L226 Difference]: Without dead ends: 648 [2025-01-09 15:42:56,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:42:56,889 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 70 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:56,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2105 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:42:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-01-09 15:42:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 485. [2025-01-09 15:42:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 408 states have (on average 1.1151960784313726) internal successors, (455), 411 states have internal predecessors, (455), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 559 transitions. [2025-01-09 15:42:56,961 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 559 transitions. Word has length 129 [2025-01-09 15:42:56,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:56,961 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 559 transitions. [2025-01-09 15:42:56,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:42:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 559 transitions. [2025-01-09 15:42:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:56,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:56,962 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:56,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:42:56,963 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:56,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:56,963 INFO L85 PathProgramCache]: Analyzing trace with hash -699717434, now seen corresponding path program 1 times [2025-01-09 15:42:56,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:56,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816543110] [2025-01-09 15:42:56,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:56,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:56,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:56,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:56,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:56,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:57,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:57,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816543110] [2025-01-09 15:42:57,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816543110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:57,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:57,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:42:57,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837229624] [2025-01-09 15:42:57,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:57,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:42:57,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:57,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:42:57,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:42:57,350 INFO L87 Difference]: Start difference. First operand 485 states and 559 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 15:42:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:57,737 INFO L93 Difference]: Finished difference Result 1136 states and 1301 transitions. [2025-01-09 15:42:57,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:42:57,742 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 129 [2025-01-09 15:42:57,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:57,744 INFO L225 Difference]: With dead ends: 1136 [2025-01-09 15:42:57,744 INFO L226 Difference]: Without dead ends: 654 [2025-01-09 15:42:57,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:42:57,745 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 248 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:57,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 595 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:42:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-01-09 15:42:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 485. [2025-01-09 15:42:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 408 states have (on average 1.1127450980392157) internal successors, (454), 411 states have internal predecessors, (454), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 558 transitions. [2025-01-09 15:42:57,831 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 558 transitions. Word has length 129 [2025-01-09 15:42:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:57,832 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 558 transitions. [2025-01-09 15:42:57,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 15:42:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 558 transitions. [2025-01-09 15:42:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:57,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:57,835 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:57,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:42:57,835 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:57,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash -833730940, now seen corresponding path program 1 times [2025-01-09 15:42:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:57,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919905443] [2025-01-09 15:42:57,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:57,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:57,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:57,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:57,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:58,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:58,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919905443] [2025-01-09 15:42:58,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919905443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:58,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:58,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:42:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318530854] [2025-01-09 15:42:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:58,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:42:58,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:58,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:42:58,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:42:58,216 INFO L87 Difference]: Start difference. First operand 485 states and 558 transitions. Second operand has 12 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 15:42:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:42:58,684 INFO L93 Difference]: Finished difference Result 1136 states and 1299 transitions. [2025-01-09 15:42:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:42:58,684 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 129 [2025-01-09 15:42:58,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:42:58,687 INFO L225 Difference]: With dead ends: 1136 [2025-01-09 15:42:58,687 INFO L226 Difference]: Without dead ends: 654 [2025-01-09 15:42:58,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:42:58,687 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 156 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:42:58,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 643 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:42:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-01-09 15:42:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 485. [2025-01-09 15:42:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 408 states have (on average 1.1053921568627452) internal successors, (451), 411 states have internal predecessors, (451), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:42:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 555 transitions. [2025-01-09 15:42:58,758 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 555 transitions. Word has length 129 [2025-01-09 15:42:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:42:58,758 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 555 transitions. [2025-01-09 15:42:58,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 15:42:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 555 transitions. [2025-01-09 15:42:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:42:58,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:42:58,759 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:42:58,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:42:58,760 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:42:58,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:42:58,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1226757950, now seen corresponding path program 1 times [2025-01-09 15:42:58,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:42:58,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180042255] [2025-01-09 15:42:58,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:42:58,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:42:58,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:42:58,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:42:58,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:42:58,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:42:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:42:59,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:42:59,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180042255] [2025-01-09 15:42:59,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180042255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:42:59,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:42:59,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 15:42:59,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488975504] [2025-01-09 15:42:59,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:42:59,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 15:42:59,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:42:59,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 15:42:59,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:42:59,911 INFO L87 Difference]: Start difference. First operand 485 states and 555 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:43:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:01,365 INFO L93 Difference]: Finished difference Result 1127 states and 1284 transitions. [2025-01-09 15:43:01,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 15:43:01,366 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-01-09 15:43:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:01,368 INFO L225 Difference]: With dead ends: 1127 [2025-01-09 15:43:01,368 INFO L226 Difference]: Without dead ends: 645 [2025-01-09 15:43:01,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=1253, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 15:43:01,369 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 230 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:01,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1865 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:43:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-01-09 15:43:01,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 482. [2025-01-09 15:43:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 405 states have (on average 1.1061728395061727) internal successors, (448), 408 states have internal predecessors, (448), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:43:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 552 transitions. [2025-01-09 15:43:01,453 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 552 transitions. Word has length 129 [2025-01-09 15:43:01,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:01,453 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 552 transitions. [2025-01-09 15:43:01,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 15:43:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 552 transitions. [2025-01-09 15:43:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 15:43:01,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:01,454 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:01,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 15:43:01,454 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:01,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:01,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1378222375, now seen corresponding path program 1 times [2025-01-09 15:43:01,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:01,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098511882] [2025-01-09 15:43:01,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:01,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:01,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 15:43:01,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 15:43:01,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:01,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:43:01,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:01,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098511882] [2025-01-09 15:43:01,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098511882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:43:01,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:43:01,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:43:01,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657757396] [2025-01-09 15:43:01,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:43:01,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:43:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:01,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:43:01,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:43:01,616 INFO L87 Difference]: Start difference. First operand 482 states and 552 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:43:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:01,891 INFO L93 Difference]: Finished difference Result 1082 states and 1231 transitions. [2025-01-09 15:43:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:43:01,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-01-09 15:43:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:01,895 INFO L225 Difference]: With dead ends: 1082 [2025-01-09 15:43:01,895 INFO L226 Difference]: Without dead ends: 603 [2025-01-09 15:43:01,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:43:01,896 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 66 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:01,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 725 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:43:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-01-09 15:43:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 458. [2025-01-09 15:43:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 381 states have (on average 1.0918635170603674) internal successors, (416), 384 states have internal predecessors, (416), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:43:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 520 transitions. [2025-01-09 15:43:01,979 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 520 transitions. Word has length 129 [2025-01-09 15:43:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:01,979 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 520 transitions. [2025-01-09 15:43:01,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:43:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 520 transitions. [2025-01-09 15:43:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:43:01,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:01,980 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:01,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 15:43:01,980 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:01,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1451725905, now seen corresponding path program 1 times [2025-01-09 15:43:01,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:01,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724045066] [2025-01-09 15:43:01,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:01,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:43:02,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:43:02,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:02,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:43:02,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:02,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724045066] [2025-01-09 15:43:02,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724045066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:43:02,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:43:02,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:43:02,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591331004] [2025-01-09 15:43:02,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:43:02,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:43:02,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:02,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:43:02,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:43:02,617 INFO L87 Difference]: Start difference. First operand 458 states and 520 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:43:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:03,037 INFO L93 Difference]: Finished difference Result 602 states and 676 transitions. [2025-01-09 15:43:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:43:03,040 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-01-09 15:43:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:03,042 INFO L225 Difference]: With dead ends: 602 [2025-01-09 15:43:03,042 INFO L226 Difference]: Without dead ends: 600 [2025-01-09 15:43:03,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:43:03,043 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 85 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:03,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1447 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:43:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-01-09 15:43:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 597. [2025-01-09 15:43:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 499 states have (on average 1.0821643286573146) internal successors, (540), 503 states have internal predecessors, (540), 66 states have call successors, (66), 31 states have call predecessors, (66), 31 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:43:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 672 transitions. [2025-01-09 15:43:03,162 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 672 transitions. Word has length 132 [2025-01-09 15:43:03,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:03,162 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 672 transitions. [2025-01-09 15:43:03,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:43:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 672 transitions. [2025-01-09 15:43:03,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:43:03,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:03,167 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:03,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 15:43:03,167 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:03,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:03,168 INFO L85 PathProgramCache]: Analyzing trace with hash -771667535, now seen corresponding path program 1 times [2025-01-09 15:43:03,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:03,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728723459] [2025-01-09 15:43:03,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:03,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:03,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:43:03,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:43:03,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:03,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:43:03,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:03,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728723459] [2025-01-09 15:43:03,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728723459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:43:03,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:43:03,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:43:03,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971001124] [2025-01-09 15:43:03,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:43:03,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:43:03,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:03,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:43:03,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:43:03,281 INFO L87 Difference]: Start difference. First operand 597 states and 672 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:43:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:03,423 INFO L93 Difference]: Finished difference Result 1184 states and 1333 transitions. [2025-01-09 15:43:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:43:03,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-01-09 15:43:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:03,426 INFO L225 Difference]: With dead ends: 1184 [2025-01-09 15:43:03,426 INFO L226 Difference]: Without dead ends: 590 [2025-01-09 15:43:03,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:43:03,427 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 81 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:03,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 382 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:43:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-01-09 15:43:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-01-09 15:43:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 492 states have (on average 1.079268292682927) internal successors, (531), 496 states have internal predecessors, (531), 66 states have call successors, (66), 31 states have call predecessors, (66), 31 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:43:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 663 transitions. [2025-01-09 15:43:03,542 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 663 transitions. Word has length 132 [2025-01-09 15:43:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:03,542 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 663 transitions. [2025-01-09 15:43:03,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:43:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 663 transitions. [2025-01-09 15:43:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:43:03,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:03,543 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:03,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 15:43:03,543 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:03,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:03,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1311177295, now seen corresponding path program 1 times [2025-01-09 15:43:03,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:03,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311703082] [2025-01-09 15:43:03,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:03,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:03,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:43:03,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:43:03,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:03,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:43:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311703082] [2025-01-09 15:43:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311703082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:43:03,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:43:03,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:43:03,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898485048] [2025-01-09 15:43:03,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:43:03,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:43:03,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:03,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:43:03,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:43:03,652 INFO L87 Difference]: Start difference. First operand 590 states and 663 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:43:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:03,797 INFO L93 Difference]: Finished difference Result 1177 states and 1323 transitions. [2025-01-09 15:43:03,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:43:03,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-01-09 15:43:03,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:03,801 INFO L225 Difference]: With dead ends: 1177 [2025-01-09 15:43:03,801 INFO L226 Difference]: Without dead ends: 590 [2025-01-09 15:43:03,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:43:03,802 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 47 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:03,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 543 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:43:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-01-09 15:43:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-01-09 15:43:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 492 states have (on average 1.0772357723577235) internal successors, (530), 496 states have internal predecessors, (530), 66 states have call successors, (66), 31 states have call predecessors, (66), 31 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:43:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 662 transitions. [2025-01-09 15:43:03,915 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 662 transitions. Word has length 132 [2025-01-09 15:43:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:03,915 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 662 transitions. [2025-01-09 15:43:03,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:43:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 662 transitions. [2025-01-09 15:43:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 15:43:03,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:43:03,916 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:03,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 15:43:03,916 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:43:03,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:43:03,916 INFO L85 PathProgramCache]: Analyzing trace with hash -631118925, now seen corresponding path program 1 times [2025-01-09 15:43:03,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:43:03,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080934266] [2025-01-09 15:43:03,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:43:03,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:43:03,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 15:43:03,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 15:43:03,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:43:03,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:43:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:43:04,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:43:04,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080934266] [2025-01-09 15:43:04,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080934266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:43:04,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:43:04,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:43:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370332072] [2025-01-09 15:43:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:43:04,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:43:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:43:04,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:43:04,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:43:04,186 INFO L87 Difference]: Start difference. First operand 590 states and 662 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:43:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:43:04,448 INFO L93 Difference]: Finished difference Result 665 states and 756 transitions. [2025-01-09 15:43:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:43:04,452 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-01-09 15:43:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:43:04,453 INFO L225 Difference]: With dead ends: 665 [2025-01-09 15:43:04,453 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 15:43:04,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:43:04,454 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 98 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:43:04,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 2197 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:43:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 15:43:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 15:43:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 15:43:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 15:43:04,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2025-01-09 15:43:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:43:04,455 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 15:43:04,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-01-09 15:43:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 15:43:04,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 15:43:04,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:43:04,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 15:43:04,460 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:43:04,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 15:43:17,508 WARN L286 SmtUtils]: Spent 13.04s on a formula simplification. DAG size of input: 210 DAG size of output: 221 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)