./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -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 297d4f7e6fe1324d357f4812a6556f1cd58caa692e4601779e6f52e2ab17fbf7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:40:13,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:40:13,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:40:13,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:40:13,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:40:13,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:40:13,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:40:13,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:40:13,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:40:13,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:40:13,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:40:13,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:40:13,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:40:13,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:40:13,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:40:13,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:40:13,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:40:13,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:40:13,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:40:13,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:40:13,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:40:13,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:40:13,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:40:13,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:40:13,571 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 -> 297d4f7e6fe1324d357f4812a6556f1cd58caa692e4601779e6f52e2ab17fbf7 [2025-02-05 16:40:13,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:40:13,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:40:13,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:40:13,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:40:13,776 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:40:13,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:40:14,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47928b06f/d0a13d7d6a864e57a3dc13e6fc572f08/FLAG95c667734 [2025-02-05 16:40:15,205 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:40:15,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:40:15,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47928b06f/d0a13d7d6a864e57a3dc13e6fc572f08/FLAG95c667734 [2025-02-05 16:40:15,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47928b06f/d0a13d7d6a864e57a3dc13e6fc572f08 [2025-02-05 16:40:15,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:40:15,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:40:15,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:40:15,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:40:15,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:40:15,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:40:15" (1/1) ... [2025-02-05 16:40:15,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d546e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:15, skipping insertion in model container [2025-02-05 16:40:15,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:40:15" (1/1) ... [2025-02-05 16:40:15,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:40:15,777 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16948,16961] [2025-02-05 16:40:15,798 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[23372,23385] [2025-02-05 16:40:15,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26559,26572] [2025-02-05 16:40:15,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[29535,29548] [2025-02-05 16:40:15,841 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33298,33311] [2025-02-05 16:40:15,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[36350,36363] [2025-02-05 16:40:15,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[39535,39548] [2025-02-05 16:40:15,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[42506,42519] [2025-02-05 16:40:15,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[45890,45903] [2025-02-05 16:40:15,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[48876,48889] [2025-02-05 16:40:15,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[52025,52038] [2025-02-05 16:40:15,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:40:15,901 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:40:15,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16948,16961] [2025-02-05 16:40:15,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[23372,23385] [2025-02-05 16:40:15,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26559,26572] [2025-02-05 16:40:15,965 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[29535,29548] [2025-02-05 16:40:15,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33298,33311] [2025-02-05 16:40:15,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[36350,36363] [2025-02-05 16:40:15,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[39535,39548] [2025-02-05 16:40:15,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[42506,42519] [2025-02-05 16:40:15,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[45890,45903] [2025-02-05 16:40:15,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[48876,48889] [2025-02-05 16:40:15,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[52025,52038] [2025-02-05 16:40:16,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:40:16,020 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:40:16,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16 WrapperNode [2025-02-05 16:40:16,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:40:16,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:40:16,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:40:16,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:40:16,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (1/1) ... [2025-02-05 16:40:16,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (1/1) ... [2025-02-05 16:40:16,092 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2763 [2025-02-05 16:40:16,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:40:16,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:40:16,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:40:16,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:40:16,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (1/1) ... [2025-02-05 16:40:16,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (1/1) ... [2025-02-05 16:40:16,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (1/1) ... [2025-02-05 16:40:16,144 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:40:16,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (1/1) ... [2025-02-05 16:40:16,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (1/1) ... [2025-02-05 16:40:16,178 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (1/1) ... [2025-02-05 16:40:16,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (1/1) ... [2025-02-05 16:40:16,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (1/1) ... [2025-02-05 16:40:16,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (1/1) ... [2025-02-05 16:40:16,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:40:16,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:40:16,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:40:16,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:40:16,215 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (1/1) ... [2025-02-05 16:40:16,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:40:16,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:16,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:40:16,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:40:16,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:40:16,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:40:16,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:40:16,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:40:16,400 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:40:16,401 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:40:17,652 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~13#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~12#1; [2025-02-05 16:40:17,652 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-05 16:40:17,652 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4469: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:40:17,652 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3347: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~15#1; [2025-02-05 16:40:17,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1300: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~5#1; [2025-02-05 16:40:17,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~9#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~16#1; [2025-02-05 16:40:17,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3746: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~17#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~14#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2025-02-05 16:40:17,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4276: havoc main_~node2__m2~18#1; [2025-02-05 16:40:17,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~11#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~10#1; [2025-02-05 16:40:17,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:40:17,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4412: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:40:17,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:40:17,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~7#1;havoc main_~node4__m4~5#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~6#1; [2025-02-05 16:40:17,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3364: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~18#1; [2025-02-05 16:40:17,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~6#1; [2025-02-05 16:40:17,653 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2309: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~9#1; [2025-02-05 16:40:17,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1452: havoc main_~check__tmp~9#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~8#1; [2025-02-05 16:40:17,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3237: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1;havoc main_~node4__m4~17#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-02-05 16:40:17,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~16#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-02-05 16:40:17,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4234: havoc main_~node1__m1~17#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2025-02-05 16:40:17,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L799: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~3#1; [2025-02-05 16:40:17,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-05 16:40:17,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: havoc main_~check__tmp~5#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1; [2025-02-05 16:40:17,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L673: havoc main_~check__tmp~3#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~2#1; [2025-02-05 16:40:17,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2326: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~10#1; [2025-02-05 16:40:17,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4440: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:40:17,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4308: havoc main_~node3__m3~20#1; [2025-02-05 16:40:17,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2856: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~15#1; [2025-02-05 16:40:17,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2196: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~15#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~9#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~14#1; [2025-02-05 16:40:17,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3853: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~21#1; [2025-02-05 16:40:17,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4384: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~24#1; [2025-02-05 16:40:17,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2997: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1;havoc main_~node4__m4~16#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~11#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-02-05 16:40:17,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L223: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-05 16:40:17,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2343: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-02-05 16:40:17,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~9#1; [2025-02-05 16:40:17,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~12#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~10#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-05 16:40:17,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3997: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1;havoc main_~node4__m4~22#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-02-05 16:40:17,718 INFO L? ?]: Removed 475 outVars from TransFormulas that were not future-live. [2025-02-05 16:40:17,718 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:40:17,732 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:40:17,733 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:40:17,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:40:17 BoogieIcfgContainer [2025-02-05 16:40:17,733 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:40:17,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:40:17,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:40:17,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:40:17,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:40:15" (1/3) ... [2025-02-05 16:40:17,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47930495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:40:17, skipping insertion in model container [2025-02-05 16:40:17,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:16" (2/3) ... [2025-02-05 16:40:17,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47930495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:40:17, skipping insertion in model container [2025-02-05 16:40:17,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:40:17" (3/3) ... [2025-02-05 16:40:17,740 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-02-05 16:40:17,749 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:40:17,751 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 537 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-02-05 16:40:17,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:40:17,798 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;@687a93fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:40:17,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-05 16:40:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 537 states, 525 states have (on average 1.8304761904761904) internal successors, (961), 536 states have internal predecessors, (961), 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-02-05 16:40:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:40:17,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:17,810 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:17,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:17,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:17,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1700733976, now seen corresponding path program 1 times [2025-02-05 16:40:17,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:17,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442777545] [2025-02-05 16:40:17,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:17,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:17,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:40:17,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:40:17,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:17,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:18,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:18,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442777545] [2025-02-05 16:40:18,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442777545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:18,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:18,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:18,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738632541] [2025-02-05 16:40:18,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:18,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:18,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:18,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:18,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:18,204 INFO L87 Difference]: Start difference. First operand has 537 states, 525 states have (on average 1.8304761904761904) internal successors, (961), 536 states have internal predecessors, (961), 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) Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-02-05 16:40:18,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:18,533 INFO L93 Difference]: Finished difference Result 676 states and 1176 transitions. [2025-02-05 16:40:18,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:18,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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) Word has length 59 [2025-02-05 16:40:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:18,542 INFO L225 Difference]: With dead ends: 676 [2025-02-05 16:40:18,542 INFO L226 Difference]: Without dead ends: 388 [2025-02-05 16:40:18,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:40:18,546 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 1949 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:18,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 438 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-05 16:40:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-02-05 16:40:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 377 states have (on average 1.297082228116711) internal successors, (489), 387 states have internal predecessors, (489), 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-02-05 16:40:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 489 transitions. [2025-02-05 16:40:18,580 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 489 transitions. Word has length 59 [2025-02-05 16:40:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:18,580 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 489 transitions. [2025-02-05 16:40:18,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-02-05 16:40:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 489 transitions. [2025-02-05 16:40:18,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:40:18,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:18,583 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:18,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:40:18,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:18,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash -281967215, now seen corresponding path program 1 times [2025-02-05 16:40:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:18,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723871959] [2025-02-05 16:40:18,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:18,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:18,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:40:18,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:40:18,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:18,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:18,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:18,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723871959] [2025-02-05 16:40:18,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723871959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:18,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:18,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:18,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357967672] [2025-02-05 16:40:18,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:18,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:18,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:18,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:18,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:18,768 INFO L87 Difference]: Start difference. First operand 388 states and 489 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-02-05 16:40:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:19,039 INFO L93 Difference]: Finished difference Result 554 states and 709 transitions. [2025-02-05 16:40:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:19,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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) Word has length 59 [2025-02-05 16:40:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:19,041 INFO L225 Difference]: With dead ends: 554 [2025-02-05 16:40:19,041 INFO L226 Difference]: Without dead ends: 356 [2025-02-05 16:40:19,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:40:19,042 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1281 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:19,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 247 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-02-05 16:40:19,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-02-05 16:40:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3101449275362318) internal successors, (452), 355 states have internal predecessors, (452), 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-02-05 16:40:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 452 transitions. [2025-02-05 16:40:19,062 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 452 transitions. Word has length 59 [2025-02-05 16:40:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:19,063 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 452 transitions. [2025-02-05 16:40:19,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-02-05 16:40:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 452 transitions. [2025-02-05 16:40:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:40:19,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:19,067 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:19,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:40:19,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:19,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1760429044, now seen corresponding path program 1 times [2025-02-05 16:40:19,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:19,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417596425] [2025-02-05 16:40:19,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:19,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:40:19,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:40:19,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:19,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:19,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:19,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417596425] [2025-02-05 16:40:19,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417596425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:19,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:19,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078123865] [2025-02-05 16:40:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:19,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:19,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:19,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:19,267 INFO L87 Difference]: Start difference. First operand 356 states and 452 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-02-05 16:40:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:19,601 INFO L93 Difference]: Finished difference Result 668 states and 866 transitions. [2025-02-05 16:40:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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) Word has length 59 [2025-02-05 16:40:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:19,604 INFO L225 Difference]: With dead ends: 668 [2025-02-05 16:40:19,604 INFO L226 Difference]: Without dead ends: 474 [2025-02-05 16:40:19,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:40:19,605 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1586 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:19,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 339 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:19,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-02-05 16:40:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 420. [2025-02-05 16:40:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 409 states have (on average 1.371638141809291) internal successors, (561), 419 states have internal predecessors, (561), 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-02-05 16:40:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 561 transitions. [2025-02-05 16:40:19,622 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 561 transitions. Word has length 59 [2025-02-05 16:40:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:19,622 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 561 transitions. [2025-02-05 16:40:19,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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-02-05 16:40:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 561 transitions. [2025-02-05 16:40:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:40:19,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:19,626 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:19,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:40:19,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:19,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1518359833, now seen corresponding path program 1 times [2025-02-05 16:40:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:19,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832239174] [2025-02-05 16:40:19,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:19,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:40:19,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:40:19,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:19,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:19,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:19,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832239174] [2025-02-05 16:40:19,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832239174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:19,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:19,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:19,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212049452] [2025-02-05 16:40:19,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:19,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:19,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:19,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:19,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:19,788 INFO L87 Difference]: Start difference. First operand 420 states and 561 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-05 16:40:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:19,988 INFO L93 Difference]: Finished difference Result 576 states and 768 transitions. [2025-02-05 16:40:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:19,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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) Word has length 60 [2025-02-05 16:40:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:19,994 INFO L225 Difference]: With dead ends: 576 [2025-02-05 16:40:19,994 INFO L226 Difference]: Without dead ends: 337 [2025-02-05 16:40:19,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:40:19,995 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 868 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:19,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 195 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-02-05 16:40:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-02-05 16:40:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3742331288343559) internal successors, (448), 336 states have internal predecessors, (448), 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-02-05 16:40:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 448 transitions. [2025-02-05 16:40:20,006 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 448 transitions. Word has length 60 [2025-02-05 16:40:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:20,006 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 448 transitions. [2025-02-05 16:40:20,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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-02-05 16:40:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 448 transitions. [2025-02-05 16:40:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:40:20,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:20,007 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:20,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:40:20,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:20,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:20,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2032795078, now seen corresponding path program 1 times [2025-02-05 16:40:20,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:20,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497006776] [2025-02-05 16:40:20,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:20,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:20,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:40:20,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:40:20,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:20,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:20,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:20,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497006776] [2025-02-05 16:40:20,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497006776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:20,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:20,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:40:20,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280730324] [2025-02-05 16:40:20,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:20,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:40:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:20,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:40:20,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:40:20,372 INFO L87 Difference]: Start difference. First operand 337 states and 448 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 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-02-05 16:40:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:20,881 INFO L93 Difference]: Finished difference Result 687 states and 917 transitions. [2025-02-05 16:40:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:40:20,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 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) Word has length 61 [2025-02-05 16:40:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:20,884 INFO L225 Difference]: With dead ends: 687 [2025-02-05 16:40:20,887 INFO L226 Difference]: Without dead ends: 502 [2025-02-05 16:40:20,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:20,888 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1285 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:20,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 762 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:40:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-05 16:40:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 337. [2025-02-05 16:40:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3711656441717792) internal successors, (447), 336 states have internal predecessors, (447), 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-02-05 16:40:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 447 transitions. [2025-02-05 16:40:20,900 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 447 transitions. Word has length 61 [2025-02-05 16:40:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:20,900 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 447 transitions. [2025-02-05 16:40:20,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 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-02-05 16:40:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 447 transitions. [2025-02-05 16:40:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:40:20,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:20,901 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:20,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:40:20,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:20,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:20,902 INFO L85 PathProgramCache]: Analyzing trace with hash 594708170, now seen corresponding path program 1 times [2025-02-05 16:40:20,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:20,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020619310] [2025-02-05 16:40:20,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:20,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:40:20,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:40:20,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:20,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:21,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:21,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020619310] [2025-02-05 16:40:21,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020619310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:21,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:21,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:21,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903682939] [2025-02-05 16:40:21,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:21,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:21,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:21,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:21,162 INFO L87 Difference]: Start difference. First operand 337 states and 447 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 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-02-05 16:40:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:21,623 INFO L93 Difference]: Finished difference Result 590 states and 815 transitions. [2025-02-05 16:40:21,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:21,624 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 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) Word has length 61 [2025-02-05 16:40:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:21,625 INFO L225 Difference]: With dead ends: 590 [2025-02-05 16:40:21,625 INFO L226 Difference]: Without dead ends: 450 [2025-02-05 16:40:21,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:40:21,626 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1080 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:21,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 883 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:21,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-02-05 16:40:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 337. [2025-02-05 16:40:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3680981595092025) internal successors, (446), 336 states have internal predecessors, (446), 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-02-05 16:40:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 446 transitions. [2025-02-05 16:40:21,633 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 446 transitions. Word has length 61 [2025-02-05 16:40:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:21,633 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 446 transitions. [2025-02-05 16:40:21,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 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-02-05 16:40:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 446 transitions. [2025-02-05 16:40:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:40:21,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:21,634 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:21,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:40:21,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:21,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash 630827982, now seen corresponding path program 1 times [2025-02-05 16:40:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:21,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347257825] [2025-02-05 16:40:21,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:21,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:40:21,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:40:21,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:21,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:21,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347257825] [2025-02-05 16:40:21,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347257825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:21,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:21,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:21,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632489994] [2025-02-05 16:40:21,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:21,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:21,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:21,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:21,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:21,800 INFO L87 Difference]: Start difference. First operand 337 states and 446 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 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-02-05 16:40:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:22,165 INFO L93 Difference]: Finished difference Result 533 states and 705 transitions. [2025-02-05 16:40:22,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:22,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 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) Word has length 61 [2025-02-05 16:40:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:22,168 INFO L225 Difference]: With dead ends: 533 [2025-02-05 16:40:22,168 INFO L226 Difference]: Without dead ends: 528 [2025-02-05 16:40:22,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:40:22,169 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 1265 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:22,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 744 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-05 16:40:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 337. [2025-02-05 16:40:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3650306748466257) internal successors, (445), 336 states have internal predecessors, (445), 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-02-05 16:40:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 445 transitions. [2025-02-05 16:40:22,198 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 445 transitions. Word has length 61 [2025-02-05 16:40:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:22,198 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 445 transitions. [2025-02-05 16:40:22,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 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-02-05 16:40:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 445 transitions. [2025-02-05 16:40:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:40:22,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:22,199 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:22,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:40:22,199 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:22,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:22,203 INFO L85 PathProgramCache]: Analyzing trace with hash 212113047, now seen corresponding path program 1 times [2025-02-05 16:40:22,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:22,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306864782] [2025-02-05 16:40:22,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:22,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:22,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:40:22,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:40:22,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:22,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:22,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:22,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306864782] [2025-02-05 16:40:22,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306864782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:22,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:22,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:22,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887457852] [2025-02-05 16:40:22,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:22,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:22,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:22,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:22,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:22,457 INFO L87 Difference]: Start difference. First operand 337 states and 445 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:22,895 INFO L93 Difference]: Finished difference Result 666 states and 908 transitions. [2025-02-05 16:40:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:22,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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) Word has length 63 [2025-02-05 16:40:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:22,897 INFO L225 Difference]: With dead ends: 666 [2025-02-05 16:40:22,897 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 16:40:22,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:40:22,898 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 1365 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:22,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 1093 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 16:40:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 337. [2025-02-05 16:40:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.361963190184049) internal successors, (444), 336 states have internal predecessors, (444), 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-02-05 16:40:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 444 transitions. [2025-02-05 16:40:22,911 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 444 transitions. Word has length 63 [2025-02-05 16:40:22,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:22,911 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 444 transitions. [2025-02-05 16:40:22,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 444 transitions. [2025-02-05 16:40:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:40:22,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:22,912 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:22,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:40:22,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:22,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1840806277, now seen corresponding path program 1 times [2025-02-05 16:40:22,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:22,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212888845] [2025-02-05 16:40:22,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:22,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:22,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:40:22,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:40:22,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:22,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:23,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:23,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212888845] [2025-02-05 16:40:23,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212888845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:23,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:23,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910355945] [2025-02-05 16:40:23,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:23,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:23,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:23,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:23,113 INFO L87 Difference]: Start difference. First operand 337 states and 444 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:23,461 INFO L93 Difference]: Finished difference Result 636 states and 860 transitions. [2025-02-05 16:40:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:23,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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) Word has length 63 [2025-02-05 16:40:23,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:23,463 INFO L225 Difference]: With dead ends: 636 [2025-02-05 16:40:23,464 INFO L226 Difference]: Without dead ends: 528 [2025-02-05 16:40:23,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:40:23,466 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 795 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:23,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 795 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-05 16:40:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 337. [2025-02-05 16:40:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3588957055214723) internal successors, (443), 336 states have internal predecessors, (443), 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-02-05 16:40:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 443 transitions. [2025-02-05 16:40:23,476 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 443 transitions. Word has length 63 [2025-02-05 16:40:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:23,476 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 443 transitions. [2025-02-05 16:40:23,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 443 transitions. [2025-02-05 16:40:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:40:23,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:23,480 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:23,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:40:23,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:23,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:23,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1972543275, now seen corresponding path program 1 times [2025-02-05 16:40:23,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:23,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711395394] [2025-02-05 16:40:23,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:23,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:23,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:40:23,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:40:23,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:23,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:23,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:23,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711395394] [2025-02-05 16:40:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711395394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:23,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:23,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:23,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302428636] [2025-02-05 16:40:23,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:23,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:23,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:23,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:23,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:23,670 INFO L87 Difference]: Start difference. First operand 337 states and 443 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:24,111 INFO L93 Difference]: Finished difference Result 671 states and 912 transitions. [2025-02-05 16:40:24,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:24,112 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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) Word has length 63 [2025-02-05 16:40:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:24,113 INFO L225 Difference]: With dead ends: 671 [2025-02-05 16:40:24,115 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 16:40:24,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:40:24,116 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 1058 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:24,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 981 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 16:40:24,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 337. [2025-02-05 16:40:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3558282208588956) internal successors, (442), 336 states have internal predecessors, (442), 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-02-05 16:40:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 442 transitions. [2025-02-05 16:40:24,124 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 442 transitions. Word has length 63 [2025-02-05 16:40:24,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:24,124 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 442 transitions. [2025-02-05 16:40:24,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 442 transitions. [2025-02-05 16:40:24,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:40:24,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:24,125 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:24,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:40:24,125 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:24,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:24,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1867877623, now seen corresponding path program 1 times [2025-02-05 16:40:24,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:24,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230597484] [2025-02-05 16:40:24,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:24,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:24,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:40:24,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:40:24,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:24,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:24,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:24,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230597484] [2025-02-05 16:40:24,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230597484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:24,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:24,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:24,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945171170] [2025-02-05 16:40:24,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:24,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:24,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:24,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:24,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:24,280 INFO L87 Difference]: Start difference. First operand 337 states and 442 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:24,632 INFO L93 Difference]: Finished difference Result 639 states and 861 transitions. [2025-02-05 16:40:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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) Word has length 63 [2025-02-05 16:40:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:24,634 INFO L225 Difference]: With dead ends: 639 [2025-02-05 16:40:24,634 INFO L226 Difference]: Without dead ends: 528 [2025-02-05 16:40:24,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:40:24,634 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 1558 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:24,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 847 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-05 16:40:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 337. [2025-02-05 16:40:24,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.352760736196319) internal successors, (441), 336 states have internal predecessors, (441), 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-02-05 16:40:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 441 transitions. [2025-02-05 16:40:24,642 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 441 transitions. Word has length 63 [2025-02-05 16:40:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:24,642 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 441 transitions. [2025-02-05 16:40:24,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2025-02-05 16:40:24,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:40:24,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:24,643 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:24,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:40:24,643 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:24,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:24,644 INFO L85 PathProgramCache]: Analyzing trace with hash 895742070, now seen corresponding path program 1 times [2025-02-05 16:40:24,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:24,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383744379] [2025-02-05 16:40:24,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:24,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:40:24,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:40:24,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:24,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:24,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:24,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383744379] [2025-02-05 16:40:24,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383744379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:24,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:24,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:24,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948296045] [2025-02-05 16:40:24,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:24,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:24,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:24,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:24,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:24,843 INFO L87 Difference]: Start difference. First operand 337 states and 441 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:25,194 INFO L93 Difference]: Finished difference Result 620 states and 848 transitions. [2025-02-05 16:40:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:25,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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) Word has length 63 [2025-02-05 16:40:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:25,196 INFO L225 Difference]: With dead ends: 620 [2025-02-05 16:40:25,196 INFO L226 Difference]: Without dead ends: 450 [2025-02-05 16:40:25,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:40:25,197 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1058 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:25,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 880 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-02-05 16:40:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 337. [2025-02-05 16:40:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3466257668711656) internal successors, (439), 336 states have internal predecessors, (439), 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-02-05 16:40:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 439 transitions. [2025-02-05 16:40:25,204 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 439 transitions. Word has length 63 [2025-02-05 16:40:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:25,204 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 439 transitions. [2025-02-05 16:40:25,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 439 transitions. [2025-02-05 16:40:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:40:25,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:25,205 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:25,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:40:25,205 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:25,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1696606601, now seen corresponding path program 1 times [2025-02-05 16:40:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:25,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573924220] [2025-02-05 16:40:25,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:25,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:25,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:40:25,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:40:25,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:25,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:25,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:25,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573924220] [2025-02-05 16:40:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573924220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:25,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:25,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:25,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685004363] [2025-02-05 16:40:25,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:25,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:25,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:25,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:25,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:25,389 INFO L87 Difference]: Start difference. First operand 337 states and 439 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:25,840 INFO L93 Difference]: Finished difference Result 565 states and 745 transitions. [2025-02-05 16:40:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:25,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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) Word has length 63 [2025-02-05 16:40:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:25,842 INFO L225 Difference]: With dead ends: 565 [2025-02-05 16:40:25,842 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 16:40:25,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:40:25,843 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1293 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:25,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 1221 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 16:40:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 337. [2025-02-05 16:40:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3404907975460123) internal successors, (437), 336 states have internal predecessors, (437), 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-02-05 16:40:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 437 transitions. [2025-02-05 16:40:25,851 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 437 transitions. Word has length 63 [2025-02-05 16:40:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:25,851 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 437 transitions. [2025-02-05 16:40:25,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 437 transitions. [2025-02-05 16:40:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:40:25,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:25,852 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:25,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:40:25,852 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:25,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1126356135, now seen corresponding path program 1 times [2025-02-05 16:40:25,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:25,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975531727] [2025-02-05 16:40:25,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:25,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:25,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:40:25,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:40:25,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:25,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:26,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:26,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975531727] [2025-02-05 16:40:26,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975531727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:26,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:26,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470595227] [2025-02-05 16:40:26,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:26,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:26,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:26,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:26,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:26,032 INFO L87 Difference]: Start difference. First operand 337 states and 437 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:26,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:26,423 INFO L93 Difference]: Finished difference Result 533 states and 695 transitions. [2025-02-05 16:40:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:26,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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) Word has length 63 [2025-02-05 16:40:26,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:26,425 INFO L225 Difference]: With dead ends: 533 [2025-02-05 16:40:26,425 INFO L226 Difference]: Without dead ends: 528 [2025-02-05 16:40:26,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:40:26,425 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 678 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:26,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1013 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-05 16:40:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 337. [2025-02-05 16:40:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.334355828220859) internal successors, (435), 336 states have internal predecessors, (435), 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-02-05 16:40:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 435 transitions. [2025-02-05 16:40:26,432 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 435 transitions. Word has length 63 [2025-02-05 16:40:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:26,432 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 435 transitions. [2025-02-05 16:40:26,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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-02-05 16:40:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 435 transitions. [2025-02-05 16:40:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:26,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:26,433 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:26,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:40:26,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:26,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2132808463, now seen corresponding path program 1 times [2025-02-05 16:40:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:26,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242254809] [2025-02-05 16:40:26,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:26,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:26,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:26,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:26,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:26,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:26,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242254809] [2025-02-05 16:40:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242254809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503246399] [2025-02-05 16:40:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:26,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:26,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:26,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:26,978 INFO L87 Difference]: Start difference. First operand 337 states and 435 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-02-05 16:40:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:27,483 INFO L93 Difference]: Finished difference Result 758 states and 1039 transitions. [2025-02-05 16:40:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:27,484 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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) Word has length 65 [2025-02-05 16:40:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:27,486 INFO L225 Difference]: With dead ends: 758 [2025-02-05 16:40:27,486 INFO L226 Difference]: Without dead ends: 628 [2025-02-05 16:40:27,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:40:27,488 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 984 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 3003 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:27,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 3003 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:27,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-02-05 16:40:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 313. [2025-02-05 16:40:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 303 states have (on average 1.3366336633663367) internal successors, (405), 312 states have internal predecessors, (405), 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-02-05 16:40:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 405 transitions. [2025-02-05 16:40:27,495 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 405 transitions. Word has length 65 [2025-02-05 16:40:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:27,495 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 405 transitions. [2025-02-05 16:40:27,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-02-05 16:40:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 405 transitions. [2025-02-05 16:40:27,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:27,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:27,496 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:27,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:40:27,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:27,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:27,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1862285579, now seen corresponding path program 1 times [2025-02-05 16:40:27,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:27,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263804591] [2025-02-05 16:40:27,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:27,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:27,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:27,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:27,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:27,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:28,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:28,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263804591] [2025-02-05 16:40:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263804591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:28,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-02-05 16:40:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896634874] [2025-02-05 16:40:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:28,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 16:40:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:28,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 16:40:28,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:40:28,476 INFO L87 Difference]: Start difference. First operand 313 states and 405 transitions. Second operand has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 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-02-05 16:40:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:30,713 INFO L93 Difference]: Finished difference Result 658 states and 892 transitions. [2025-02-05 16:40:30,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 16:40:30,713 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 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) Word has length 65 [2025-02-05 16:40:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:30,715 INFO L225 Difference]: With dead ends: 658 [2025-02-05 16:40:30,715 INFO L226 Difference]: Without dead ends: 548 [2025-02-05 16:40:30,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=341, Invalid=1465, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 16:40:30,716 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 952 mSDsluCounter, 5427 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 5884 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:30,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 5884 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 16:40:30,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-05 16:40:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 324. [2025-02-05 16:40:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 314 states have (on average 1.3343949044585988) internal successors, (419), 323 states have internal predecessors, (419), 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-02-05 16:40:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 419 transitions. [2025-02-05 16:40:30,723 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 419 transitions. Word has length 65 [2025-02-05 16:40:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:30,723 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 419 transitions. [2025-02-05 16:40:30,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 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-02-05 16:40:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 419 transitions. [2025-02-05 16:40:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:30,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:30,724 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:30,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:40:30,724 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash -918114264, now seen corresponding path program 1 times [2025-02-05 16:40:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:30,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450532576] [2025-02-05 16:40:30,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:30,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:30,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:30,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:30,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:30,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:32,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:32,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450532576] [2025-02-05 16:40:32,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450532576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:32,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:32,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-02-05 16:40:32,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583471048] [2025-02-05 16:40:32,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:32,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 16:40:32,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:32,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 16:40:32,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:40:32,201 INFO L87 Difference]: Start difference. First operand 324 states and 419 transitions. Second operand has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 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-02-05 16:40:34,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:34,845 INFO L93 Difference]: Finished difference Result 714 states and 973 transitions. [2025-02-05 16:40:34,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 16:40:34,846 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 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) Word has length 65 [2025-02-05 16:40:34,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:34,847 INFO L225 Difference]: With dead ends: 714 [2025-02-05 16:40:34,847 INFO L226 Difference]: Without dead ends: 601 [2025-02-05 16:40:34,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=367, Invalid=1525, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 16:40:34,848 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 1602 mSDsluCounter, 4794 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 5236 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:34,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 5236 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 16:40:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-02-05 16:40:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 329. [2025-02-05 16:40:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 319 states have (on average 1.3322884012539185) internal successors, (425), 328 states have internal predecessors, (425), 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-02-05 16:40:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 425 transitions. [2025-02-05 16:40:34,854 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 425 transitions. Word has length 65 [2025-02-05 16:40:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:34,854 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 425 transitions. [2025-02-05 16:40:34,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 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-02-05 16:40:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 425 transitions. [2025-02-05 16:40:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:34,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:34,855 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:34,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:40:34,855 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:34,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:34,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1088405693, now seen corresponding path program 1 times [2025-02-05 16:40:34,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:34,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868351458] [2025-02-05 16:40:34,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:34,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:34,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:34,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:34,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:34,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:35,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:35,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868351458] [2025-02-05 16:40:35,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868351458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:35,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:35,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:35,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274584240] [2025-02-05 16:40:35,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:35,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:35,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:35,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:35,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:35,179 INFO L87 Difference]: Start difference. First operand 329 states and 425 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-02-05 16:40:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:35,720 INFO L93 Difference]: Finished difference Result 901 states and 1215 transitions. [2025-02-05 16:40:35,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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) Word has length 65 [2025-02-05 16:40:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:35,722 INFO L225 Difference]: With dead ends: 901 [2025-02-05 16:40:35,722 INFO L226 Difference]: Without dead ends: 789 [2025-02-05 16:40:35,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:40:35,723 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 1862 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1862 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:35,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1862 Valid, 1945 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:35,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-02-05 16:40:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2025-02-05 16:40:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 310 states have (on average 1.3225806451612903) internal successors, (410), 318 states have internal predecessors, (410), 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-02-05 16:40:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 410 transitions. [2025-02-05 16:40:35,729 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 410 transitions. Word has length 65 [2025-02-05 16:40:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:35,729 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 410 transitions. [2025-02-05 16:40:35,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-02-05 16:40:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 410 transitions. [2025-02-05 16:40:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:35,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:35,730 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:35,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:40:35,730 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:35,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:35,731 INFO L85 PathProgramCache]: Analyzing trace with hash -210700697, now seen corresponding path program 1 times [2025-02-05 16:40:35,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:35,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579481253] [2025-02-05 16:40:35,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:35,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:35,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:35,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:35,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:35,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:36,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:36,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579481253] [2025-02-05 16:40:36,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579481253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:36,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:36,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:36,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746620115] [2025-02-05 16:40:36,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:36,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:36,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:36,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:36,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:36,075 INFO L87 Difference]: Start difference. First operand 319 states and 410 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-02-05 16:40:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:36,664 INFO L93 Difference]: Finished difference Result 891 states and 1200 transitions. [2025-02-05 16:40:36,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:36,665 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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) Word has length 65 [2025-02-05 16:40:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:36,667 INFO L225 Difference]: With dead ends: 891 [2025-02-05 16:40:36,667 INFO L226 Difference]: Without dead ends: 783 [2025-02-05 16:40:36,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:40:36,668 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 1101 mSDsluCounter, 2381 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 2767 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:36,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 2767 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-02-05 16:40:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 309. [2025-02-05 16:40:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 300 states have (on average 1.3166666666666667) internal successors, (395), 308 states have internal predecessors, (395), 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-02-05 16:40:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 395 transitions. [2025-02-05 16:40:36,674 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 395 transitions. Word has length 65 [2025-02-05 16:40:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:36,674 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 395 transitions. [2025-02-05 16:40:36,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-02-05 16:40:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 395 transitions. [2025-02-05 16:40:36,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:36,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:36,676 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:36,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:40:36,676 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:36,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash -490132286, now seen corresponding path program 1 times [2025-02-05 16:40:36,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:36,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634019819] [2025-02-05 16:40:36,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:36,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:36,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:36,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:36,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:36,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:37,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:37,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634019819] [2025-02-05 16:40:37,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634019819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:37,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:37,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-05 16:40:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830100184] [2025-02-05 16:40:37,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:37,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 16:40:37,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:37,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 16:40:37,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:40:37,492 INFO L87 Difference]: Start difference. First operand 309 states and 395 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 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-02-05 16:40:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:38,905 INFO L93 Difference]: Finished difference Result 598 states and 793 transitions. [2025-02-05 16:40:38,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 16:40:38,905 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 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) Word has length 65 [2025-02-05 16:40:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:38,907 INFO L225 Difference]: With dead ends: 598 [2025-02-05 16:40:38,907 INFO L226 Difference]: Without dead ends: 592 [2025-02-05 16:40:38,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 16:40:38,912 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 1531 mSDsluCounter, 3708 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 4064 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:38,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 4064 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:40:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-05 16:40:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 316. [2025-02-05 16:40:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 307 states have (on average 1.3159609120521172) internal successors, (404), 315 states have internal predecessors, (404), 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-02-05 16:40:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 404 transitions. [2025-02-05 16:40:38,924 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 404 transitions. Word has length 65 [2025-02-05 16:40:38,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:38,925 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 404 transitions. [2025-02-05 16:40:38,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 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-02-05 16:40:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 404 transitions. [2025-02-05 16:40:38,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:38,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:38,925 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:38,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:40:38,926 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:38,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:38,926 INFO L85 PathProgramCache]: Analyzing trace with hash 34725583, now seen corresponding path program 1 times [2025-02-05 16:40:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:38,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868717446] [2025-02-05 16:40:38,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:38,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:38,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:38,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:38,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:38,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:39,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:39,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868717446] [2025-02-05 16:40:39,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868717446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:39,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:39,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:39,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090527557] [2025-02-05 16:40:39,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:39,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:39,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:39,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:39,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:39,269 INFO L87 Difference]: Start difference. First operand 316 states and 404 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-02-05 16:40:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:39,683 INFO L93 Difference]: Finished difference Result 610 states and 818 transitions. [2025-02-05 16:40:39,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:39,684 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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) Word has length 65 [2025-02-05 16:40:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:39,685 INFO L225 Difference]: With dead ends: 610 [2025-02-05 16:40:39,685 INFO L226 Difference]: Without dead ends: 571 [2025-02-05 16:40:39,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:40:39,686 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 1395 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:39,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 1795 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-02-05 16:40:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 277. [2025-02-05 16:40:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 271 states have (on average 1.3210332103321034) internal successors, (358), 276 states have internal predecessors, (358), 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-02-05 16:40:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 358 transitions. [2025-02-05 16:40:39,691 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 358 transitions. Word has length 65 [2025-02-05 16:40:39,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:39,692 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 358 transitions. [2025-02-05 16:40:39,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-02-05 16:40:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 358 transitions. [2025-02-05 16:40:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:39,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:39,692 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:39,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:40:39,692 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:39,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash -445857057, now seen corresponding path program 1 times [2025-02-05 16:40:39,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:39,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366570041] [2025-02-05 16:40:39,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:39,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:39,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:39,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:39,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:39,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:40,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:40,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366570041] [2025-02-05 16:40:40,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366570041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:40,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:40,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:40,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838042117] [2025-02-05 16:40:40,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:40,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:40,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:40,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:40,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:40,021 INFO L87 Difference]: Start difference. First operand 277 states and 358 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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-02-05 16:40:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:40,540 INFO L93 Difference]: Finished difference Result 805 states and 1106 transitions. [2025-02-05 16:40:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:40:40,541 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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) Word has length 66 [2025-02-05 16:40:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:40,543 INFO L225 Difference]: With dead ends: 805 [2025-02-05 16:40:40,543 INFO L226 Difference]: Without dead ends: 695 [2025-02-05 16:40:40,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:40:40,544 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1473 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:40,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1751 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-02-05 16:40:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 267. [2025-02-05 16:40:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 262 states have (on average 1.316793893129771) internal successors, (345), 266 states have internal predecessors, (345), 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-02-05 16:40:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 345 transitions. [2025-02-05 16:40:40,549 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 345 transitions. Word has length 66 [2025-02-05 16:40:40,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:40,549 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 345 transitions. [2025-02-05 16:40:40,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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-02-05 16:40:40,549 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 345 transitions. [2025-02-05 16:40:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:40,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:40,549 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:40,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:40:40,550 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:40,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:40,550 INFO L85 PathProgramCache]: Analyzing trace with hash 498314258, now seen corresponding path program 1 times [2025-02-05 16:40:40,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:40,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068273298] [2025-02-05 16:40:40,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:40,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:40,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:40,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:40,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:40,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:41,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:41,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068273298] [2025-02-05 16:40:41,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068273298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:41,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:41,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 16:40:41,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197739428] [2025-02-05 16:40:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:41,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 16:40:41,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:41,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 16:40:41,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:40:41,058 INFO L87 Difference]: Start difference. First operand 267 states and 345 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 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-02-05 16:40:42,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:42,110 INFO L93 Difference]: Finished difference Result 447 states and 606 transitions. [2025-02-05 16:40:42,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:40:42,111 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 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) Word has length 66 [2025-02-05 16:40:42,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:42,112 INFO L225 Difference]: With dead ends: 447 [2025-02-05 16:40:42,112 INFO L226 Difference]: Without dead ends: 330 [2025-02-05 16:40:42,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:40:42,113 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 644 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:42,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1993 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-05 16:40:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 262. [2025-02-05 16:40:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 1.311284046692607) internal successors, (337), 261 states have internal predecessors, (337), 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-02-05 16:40:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 337 transitions. [2025-02-05 16:40:42,116 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 337 transitions. Word has length 66 [2025-02-05 16:40:42,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:42,116 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 337 transitions. [2025-02-05 16:40:42,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 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-02-05 16:40:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 337 transitions. [2025-02-05 16:40:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:42,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:42,117 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:42,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:40:42,117 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:42,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1751846983, now seen corresponding path program 1 times [2025-02-05 16:40:42,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:42,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366991521] [2025-02-05 16:40:42,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:42,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:42,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:42,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:42,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:42,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:42,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366991521] [2025-02-05 16:40:42,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366991521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:42,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:42,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:42,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707168450] [2025-02-05 16:40:42,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:42,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:42,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:42,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:42,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:42,235 INFO L87 Difference]: Start difference. First operand 262 states and 337 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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-02-05 16:40:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:42,509 INFO L93 Difference]: Finished difference Result 425 states and 559 transitions. [2025-02-05 16:40:42,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:42,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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) Word has length 66 [2025-02-05 16:40:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:42,510 INFO L225 Difference]: With dead ends: 425 [2025-02-05 16:40:42,510 INFO L226 Difference]: Without dead ends: 418 [2025-02-05 16:40:42,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:40:42,511 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 990 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:42,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 558 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-05 16:40:42,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 262. [2025-02-05 16:40:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 1.3073929961089494) internal successors, (336), 261 states have internal predecessors, (336), 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-02-05 16:40:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 336 transitions. [2025-02-05 16:40:42,515 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 336 transitions. Word has length 66 [2025-02-05 16:40:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:42,515 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 336 transitions. [2025-02-05 16:40:42,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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-02-05 16:40:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 336 transitions. [2025-02-05 16:40:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:42,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:42,516 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:42,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:40:42,516 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:42,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash 259036838, now seen corresponding path program 1 times [2025-02-05 16:40:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:42,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110169392] [2025-02-05 16:40:42,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:42,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:42,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:42,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:42,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:42,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:42,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110169392] [2025-02-05 16:40:42,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110169392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:42,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:42,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:40:42,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309958071] [2025-02-05 16:40:42,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:42,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:42,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:42,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:42,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:42,724 INFO L87 Difference]: Start difference. First operand 262 states and 336 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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-02-05 16:40:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:42,900 INFO L93 Difference]: Finished difference Result 496 states and 677 transitions. [2025-02-05 16:40:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:40:42,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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) Word has length 66 [2025-02-05 16:40:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:42,902 INFO L225 Difference]: With dead ends: 496 [2025-02-05 16:40:42,902 INFO L226 Difference]: Without dead ends: 350 [2025-02-05 16:40:42,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:40:42,903 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 454 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:42,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 848 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-05 16:40:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 222. [2025-02-05 16:40:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 219 states have (on average 1.3287671232876712) internal successors, (291), 221 states have internal predecessors, (291), 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-02-05 16:40:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 291 transitions. [2025-02-05 16:40:42,906 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 291 transitions. Word has length 66 [2025-02-05 16:40:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:42,906 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 291 transitions. [2025-02-05 16:40:42,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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-02-05 16:40:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 291 transitions. [2025-02-05 16:40:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:42,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:42,906 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:42,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:40:42,907 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:42,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1742300808, now seen corresponding path program 1 times [2025-02-05 16:40:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415945645] [2025-02-05 16:40:42,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:42,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:42,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:42,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:42,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:42,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:43,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:43,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415945645] [2025-02-05 16:40:43,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415945645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:43,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:43,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:43,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419395968] [2025-02-05 16:40:43,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:43,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:43,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:43,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:43,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:43,017 INFO L87 Difference]: Start difference. First operand 222 states and 291 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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-02-05 16:40:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:43,306 INFO L93 Difference]: Finished difference Result 524 states and 718 transitions. [2025-02-05 16:40:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:43,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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) Word has length 66 [2025-02-05 16:40:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:43,307 INFO L225 Difference]: With dead ends: 524 [2025-02-05 16:40:43,307 INFO L226 Difference]: Without dead ends: 388 [2025-02-05 16:40:43,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:40:43,308 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 519 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:43,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 732 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-05 16:40:43,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 222. [2025-02-05 16:40:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 221 states have internal predecessors, (289), 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-02-05 16:40:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 289 transitions. [2025-02-05 16:40:43,316 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 289 transitions. Word has length 66 [2025-02-05 16:40:43,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:43,316 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 289 transitions. [2025-02-05 16:40:43,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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-02-05 16:40:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 289 transitions. [2025-02-05 16:40:43,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:43,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:43,317 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:43,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:40:43,318 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:43,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash -474731046, now seen corresponding path program 1 times [2025-02-05 16:40:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:43,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977763400] [2025-02-05 16:40:43,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:43,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:43,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:43,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:43,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:43,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:43,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:43,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977763400] [2025-02-05 16:40:43,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977763400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:43,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:43,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:43,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991447825] [2025-02-05 16:40:43,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:43,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:43,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:43,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:43,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:43,431 INFO L87 Difference]: Start difference. First operand 222 states and 289 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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-02-05 16:40:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:43,700 INFO L93 Difference]: Finished difference Result 371 states and 496 transitions. [2025-02-05 16:40:43,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:43,701 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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) Word has length 66 [2025-02-05 16:40:43,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:43,701 INFO L225 Difference]: With dead ends: 371 [2025-02-05 16:40:43,701 INFO L226 Difference]: Without dead ends: 364 [2025-02-05 16:40:43,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:40:43,702 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 541 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:43,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 836 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-05 16:40:43,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 222. [2025-02-05 16:40:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 219 states have (on average 1.3150684931506849) internal successors, (288), 221 states have internal predecessors, (288), 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-02-05 16:40:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 288 transitions. [2025-02-05 16:40:43,707 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 288 transitions. Word has length 66 [2025-02-05 16:40:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:43,707 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 288 transitions. [2025-02-05 16:40:43,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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-02-05 16:40:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 288 transitions. [2025-02-05 16:40:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:40:43,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:43,708 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:43,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:40:43,708 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:43,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1612932329, now seen corresponding path program 1 times [2025-02-05 16:40:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:43,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894075306] [2025-02-05 16:40:43,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:43,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:43,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:40:43,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:40:43,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:43,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:44,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894075306] [2025-02-05 16:40:44,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894075306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:44,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:44,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-05 16:40:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393928715] [2025-02-05 16:40:44,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:44,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 16:40:44,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:44,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 16:40:44,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:40:44,490 INFO L87 Difference]: Start difference. First operand 222 states and 288 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 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-02-05 16:40:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:45,508 INFO L93 Difference]: Finished difference Result 369 states and 492 transitions. [2025-02-05 16:40:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 16:40:45,508 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 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) Word has length 68 [2025-02-05 16:40:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:45,509 INFO L225 Difference]: With dead ends: 369 [2025-02-05 16:40:45,509 INFO L226 Difference]: Without dead ends: 363 [2025-02-05 16:40:45,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=290, Invalid=1350, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 16:40:45,511 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 539 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:45,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1878 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:40:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-05 16:40:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 233. [2025-02-05 16:40:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 230 states have (on average 1.3130434782608695) internal successors, (302), 232 states have internal predecessors, (302), 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-02-05 16:40:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 302 transitions. [2025-02-05 16:40:45,514 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 302 transitions. Word has length 68 [2025-02-05 16:40:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:45,515 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 302 transitions. [2025-02-05 16:40:45,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 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-02-05 16:40:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 302 transitions. [2025-02-05 16:40:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:40:45,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:45,515 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:45,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:40:45,517 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:45,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1111323594, now seen corresponding path program 1 times [2025-02-05 16:40:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:45,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064636857] [2025-02-05 16:40:45,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:45,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:45,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:40:45,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:40:45,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:45,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:46,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:46,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064636857] [2025-02-05 16:40:46,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064636857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:46,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:46,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-05 16:40:46,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075795666] [2025-02-05 16:40:46,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:46,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 16:40:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:46,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 16:40:46,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:40:46,340 INFO L87 Difference]: Start difference. First operand 233 states and 302 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 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-02-05 16:40:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:47,336 INFO L93 Difference]: Finished difference Result 246 states and 316 transitions. [2025-02-05 16:40:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 16:40:47,336 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 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) Word has length 68 [2025-02-05 16:40:47,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:47,337 INFO L225 Difference]: With dead ends: 246 [2025-02-05 16:40:47,337 INFO L226 Difference]: Without dead ends: 238 [2025-02-05 16:40:47,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 16:40:47,338 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 397 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:47,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1559 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:40:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-05 16:40:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2025-02-05 16:40:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 234 states have (on average 1.311965811965812) internal successors, (307), 236 states have internal predecessors, (307), 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-02-05 16:40:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 307 transitions. [2025-02-05 16:40:47,340 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 307 transitions. Word has length 68 [2025-02-05 16:40:47,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:47,341 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 307 transitions. [2025-02-05 16:40:47,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 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-02-05 16:40:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 307 transitions. [2025-02-05 16:40:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:40:47,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:47,341 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:47,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:40:47,342 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:47,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:47,342 INFO L85 PathProgramCache]: Analyzing trace with hash -52323104, now seen corresponding path program 1 times [2025-02-05 16:40:47,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:47,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757181414] [2025-02-05 16:40:47,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:47,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:47,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:40:47,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:40:47,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:47,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:48,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:48,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757181414] [2025-02-05 16:40:48,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757181414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:48,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:48,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 16:40:48,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314490950] [2025-02-05 16:40:48,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:48,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:40:48,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:48,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:40:48,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:40:48,078 INFO L87 Difference]: Start difference. First operand 237 states and 307 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 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-02-05 16:40:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:49,357 INFO L93 Difference]: Finished difference Result 605 states and 827 transitions. [2025-02-05 16:40:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 16:40:49,357 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 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) Word has length 69 [2025-02-05 16:40:49,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:49,359 INFO L225 Difference]: With dead ends: 605 [2025-02-05 16:40:49,359 INFO L226 Difference]: Without dead ends: 599 [2025-02-05 16:40:49,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=866, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 16:40:49,360 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 1287 mSDsluCounter, 2687 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 2993 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:49,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 2993 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:40:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-02-05 16:40:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 248. [2025-02-05 16:40:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 245 states have (on average 1.310204081632653) internal successors, (321), 247 states have internal predecessors, (321), 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-02-05 16:40:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 321 transitions. [2025-02-05 16:40:49,366 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 321 transitions. Word has length 69 [2025-02-05 16:40:49,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:49,367 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 321 transitions. [2025-02-05 16:40:49,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 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-02-05 16:40:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 321 transitions. [2025-02-05 16:40:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:40:49,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:49,367 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:49,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:40:49,368 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:49,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:49,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1623034477, now seen corresponding path program 1 times [2025-02-05 16:40:49,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:49,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090927856] [2025-02-05 16:40:49,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:49,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:40:49,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:40:49,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:49,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:49,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:49,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090927856] [2025-02-05 16:40:49,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090927856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:49,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:49,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 16:40:49,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207201923] [2025-02-05 16:40:49,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:49,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 16:40:49,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:49,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 16:40:49,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:40:49,880 INFO L87 Difference]: Start difference. First operand 248 states and 321 transitions. Second operand has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 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-02-05 16:40:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:50,870 INFO L93 Difference]: Finished difference Result 545 states and 736 transitions. [2025-02-05 16:40:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 16:40:50,870 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 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) Word has length 69 [2025-02-05 16:40:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:50,872 INFO L225 Difference]: With dead ends: 545 [2025-02-05 16:40:50,872 INFO L226 Difference]: Without dead ends: 537 [2025-02-05 16:40:50,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:40:50,872 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 1116 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 3072 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:50,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 3072 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:40:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-05 16:40:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 244. [2025-02-05 16:40:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 241 states have (on average 1.3070539419087137) internal successors, (315), 243 states have internal predecessors, (315), 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-02-05 16:40:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 315 transitions. [2025-02-05 16:40:50,876 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 315 transitions. Word has length 69 [2025-02-05 16:40:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:50,876 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 315 transitions. [2025-02-05 16:40:50,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 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-02-05 16:40:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 315 transitions. [2025-02-05 16:40:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:40:50,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:50,877 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:50,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:40:50,878 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:50,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:50,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1379670630, now seen corresponding path program 1 times [2025-02-05 16:40:50,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:50,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587736530] [2025-02-05 16:40:50,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:50,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:50,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:40:50,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:40:50,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:50,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:51,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:51,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587736530] [2025-02-05 16:40:51,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587736530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:51,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:51,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 16:40:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985785004] [2025-02-05 16:40:51,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:51,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 16:40:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:51,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 16:40:51,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:40:51,373 INFO L87 Difference]: Start difference. First operand 244 states and 315 transitions. Second operand has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 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-02-05 16:40:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:52,533 INFO L93 Difference]: Finished difference Result 645 states and 890 transitions. [2025-02-05 16:40:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 16:40:52,534 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 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) Word has length 69 [2025-02-05 16:40:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:52,536 INFO L225 Difference]: With dead ends: 645 [2025-02-05 16:40:52,536 INFO L226 Difference]: Without dead ends: 630 [2025-02-05 16:40:52,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:40:52,537 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 1205 mSDsluCounter, 2794 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:52,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 3107 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:40:52,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-02-05 16:40:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 232. [2025-02-05 16:40:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 230 states have (on average 1.3130434782608695) internal successors, (302), 231 states have internal predecessors, (302), 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-02-05 16:40:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 302 transitions. [2025-02-05 16:40:52,544 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 302 transitions. Word has length 69 [2025-02-05 16:40:52,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:52,545 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 302 transitions. [2025-02-05 16:40:52,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 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-02-05 16:40:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 302 transitions. [2025-02-05 16:40:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:40:52,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:52,545 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:52,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:40:52,545 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:52,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:52,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1622973414, now seen corresponding path program 1 times [2025-02-05 16:40:52,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:52,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844648557] [2025-02-05 16:40:52,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:52,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:52,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:40:52,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:40:52,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:52,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:52,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:52,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844648557] [2025-02-05 16:40:52,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844648557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:52,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:52,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:40:52,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215473613] [2025-02-05 16:40:52,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:52,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:40:52,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:52,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:40:52,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:40:52,808 INFO L87 Difference]: Start difference. First operand 232 states and 302 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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-02-05 16:40:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:53,085 INFO L93 Difference]: Finished difference Result 364 states and 494 transitions. [2025-02-05 16:40:53,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:53,085 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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) Word has length 69 [2025-02-05 16:40:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:53,086 INFO L225 Difference]: With dead ends: 364 [2025-02-05 16:40:53,086 INFO L226 Difference]: Without dead ends: 358 [2025-02-05 16:40:53,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:40:53,089 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 513 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:53,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1065 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-05 16:40:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 204. [2025-02-05 16:40:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.3152709359605912) internal successors, (267), 203 states have internal predecessors, (267), 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-02-05 16:40:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 267 transitions. [2025-02-05 16:40:53,092 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 267 transitions. Word has length 69 [2025-02-05 16:40:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:53,092 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 267 transitions. [2025-02-05 16:40:53,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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-02-05 16:40:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 267 transitions. [2025-02-05 16:40:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:40:53,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:53,093 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:53,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:40:53,093 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:53,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1705723714, now seen corresponding path program 1 times [2025-02-05 16:40:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:53,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034576471] [2025-02-05 16:40:53,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:53,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:53,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:40:53,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:40:53,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:53,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:53,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:53,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034576471] [2025-02-05 16:40:53,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034576471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:53,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:53,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15734939] [2025-02-05 16:40:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:53,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:53,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:53,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:53,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:53,175 INFO L87 Difference]: Start difference. First operand 204 states and 267 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-02-05 16:40:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:53,268 INFO L93 Difference]: Finished difference Result 1052 states and 1547 transitions. [2025-02-05 16:40:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:40:53,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) Word has length 91 [2025-02-05 16:40:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:53,271 INFO L225 Difference]: With dead ends: 1052 [2025-02-05 16:40:53,271 INFO L226 Difference]: Without dead ends: 946 [2025-02-05 16:40:53,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:40:53,272 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 828 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:53,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1027 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-02-05 16:40:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 308. [2025-02-05 16:40:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.3745928338762214) internal successors, (422), 307 states have internal predecessors, (422), 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-02-05 16:40:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 422 transitions. [2025-02-05 16:40:53,276 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 422 transitions. Word has length 91 [2025-02-05 16:40:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:53,277 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 422 transitions. [2025-02-05 16:40:53,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-02-05 16:40:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 422 transitions. [2025-02-05 16:40:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:40:53,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:53,277 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:53,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:40:53,277 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:53,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:53,278 INFO L85 PathProgramCache]: Analyzing trace with hash -899188006, now seen corresponding path program 1 times [2025-02-05 16:40:53,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:53,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846362572] [2025-02-05 16:40:53,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:53,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:40:53,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:40:53,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:53,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846362572] [2025-02-05 16:40:53,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846362572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:53,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:53,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:53,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903860743] [2025-02-05 16:40:53,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:53,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:53,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:53,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:53,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:53,362 INFO L87 Difference]: Start difference. First operand 308 states and 422 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-02-05 16:40:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:53,421 INFO L93 Difference]: Finished difference Result 1254 states and 1838 transitions. [2025-02-05 16:40:53,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:53,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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) Word has length 93 [2025-02-05 16:40:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:53,424 INFO L225 Difference]: With dead ends: 1254 [2025-02-05 16:40:53,424 INFO L226 Difference]: Without dead ends: 1044 [2025-02-05 16:40:53,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:53,425 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 577 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:53,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 734 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2025-02-05 16:40:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 516. [2025-02-05 16:40:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 1.4252427184466019) internal successors, (734), 515 states have internal predecessors, (734), 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-02-05 16:40:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 734 transitions. [2025-02-05 16:40:53,431 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 734 transitions. Word has length 93 [2025-02-05 16:40:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:53,431 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 734 transitions. [2025-02-05 16:40:53,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-02-05 16:40:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 734 transitions. [2025-02-05 16:40:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:40:53,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:53,432 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:53,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:40:53,432 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:53,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash 308365914, now seen corresponding path program 1 times [2025-02-05 16:40:53,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:53,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969040455] [2025-02-05 16:40:53,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:53,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:53,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:40:53,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:40:53,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:53,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:53,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:53,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969040455] [2025-02-05 16:40:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969040455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:53,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569826197] [2025-02-05 16:40:53,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:53,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:53,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:53,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:53,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:53,498 INFO L87 Difference]: Start difference. First operand 516 states and 734 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-02-05 16:40:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:53,558 INFO L93 Difference]: Finished difference Result 1462 states and 2150 transitions. [2025-02-05 16:40:53,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:53,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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) Word has length 93 [2025-02-05 16:40:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:53,562 INFO L225 Difference]: With dead ends: 1462 [2025-02-05 16:40:53,562 INFO L226 Difference]: Without dead ends: 1252 [2025-02-05 16:40:53,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:53,563 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 618 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:53,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 681 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-02-05 16:40:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 828. [2025-02-05 16:40:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.4522370012091899) internal successors, (1201), 827 states have internal predecessors, (1201), 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-02-05 16:40:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1201 transitions. [2025-02-05 16:40:53,574 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1201 transitions. Word has length 93 [2025-02-05 16:40:53,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:53,575 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1201 transitions. [2025-02-05 16:40:53,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-02-05 16:40:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1201 transitions. [2025-02-05 16:40:53,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:40:53,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:53,576 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:53,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:40:53,576 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:53,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1830821414, now seen corresponding path program 1 times [2025-02-05 16:40:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:53,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096718953] [2025-02-05 16:40:53,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:53,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:40:53,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:40:53,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:53,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:53,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:53,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096718953] [2025-02-05 16:40:53,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096718953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:53,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:53,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:53,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823038528] [2025-02-05 16:40:53,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:53,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:53,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:53,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:53,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:53,655 INFO L87 Difference]: Start difference. First operand 828 states and 1201 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-02-05 16:40:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:53,717 INFO L93 Difference]: Finished difference Result 1670 states and 2462 transitions. [2025-02-05 16:40:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:53,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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) Word has length 93 [2025-02-05 16:40:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:53,720 INFO L225 Difference]: With dead ends: 1670 [2025-02-05 16:40:53,721 INFO L226 Difference]: Without dead ends: 1460 [2025-02-05 16:40:53,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:53,721 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 593 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:53,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 734 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2025-02-05 16:40:53,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1036. [2025-02-05 16:40:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1035 states have (on average 1.4618357487922706) internal successors, (1513), 1035 states have internal predecessors, (1513), 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-02-05 16:40:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1513 transitions. [2025-02-05 16:40:53,732 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1513 transitions. Word has length 93 [2025-02-05 16:40:53,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:53,732 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1513 transitions. [2025-02-05 16:40:53,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-02-05 16:40:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1513 transitions. [2025-02-05 16:40:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:40:53,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:53,733 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:53,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:40:53,733 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:53,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:53,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1555516790, now seen corresponding path program 1 times [2025-02-05 16:40:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:53,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318142661] [2025-02-05 16:40:53,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:53,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:40:53,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:40:53,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:53,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:53,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318142661] [2025-02-05 16:40:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318142661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:53,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766991499] [2025-02-05 16:40:53,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:53,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:53,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:53,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:53,772 INFO L87 Difference]: Start difference. First operand 1036 states and 1513 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-02-05 16:40:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:53,794 INFO L93 Difference]: Finished difference Result 2796 states and 4121 transitions. [2025-02-05 16:40:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:53,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) Word has length 93 [2025-02-05 16:40:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:53,798 INFO L225 Difference]: With dead ends: 2796 [2025-02-05 16:40:53,798 INFO L226 Difference]: Without dead ends: 1858 [2025-02-05 16:40:53,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:53,799 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 89 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:53,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 253 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2025-02-05 16:40:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1838. [2025-02-05 16:40:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.4425694066412629) internal successors, (2650), 1837 states have internal predecessors, (2650), 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-02-05 16:40:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2650 transitions. [2025-02-05 16:40:53,814 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2650 transitions. Word has length 93 [2025-02-05 16:40:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:53,814 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2650 transitions. [2025-02-05 16:40:53,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-02-05 16:40:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2650 transitions. [2025-02-05 16:40:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:40:53,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:53,815 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:53,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:40:53,815 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:53,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1590610588, now seen corresponding path program 1 times [2025-02-05 16:40:53,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:53,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507495618] [2025-02-05 16:40:53,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:53,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:53,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:40:53,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:40:53,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:53,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:53,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:53,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507495618] [2025-02-05 16:40:53,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507495618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:53,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:53,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:53,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177685404] [2025-02-05 16:40:53,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:53,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:53,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:53,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:53,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:53,934 INFO L87 Difference]: Start difference. First operand 1838 states and 2650 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-02-05 16:40:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,004 INFO L93 Difference]: Finished difference Result 3580 states and 5194 transitions. [2025-02-05 16:40:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:54,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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) Word has length 93 [2025-02-05 16:40:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,009 INFO L225 Difference]: With dead ends: 3580 [2025-02-05 16:40:54,009 INFO L226 Difference]: Without dead ends: 1840 [2025-02-05 16:40:54,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:40:54,011 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 76 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:54,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 460 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2025-02-05 16:40:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1838. [2025-02-05 16:40:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.437125748502994) internal successors, (2640), 1837 states have internal predecessors, (2640), 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-02-05 16:40:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2640 transitions. [2025-02-05 16:40:54,027 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2640 transitions. Word has length 93 [2025-02-05 16:40:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,027 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2640 transitions. [2025-02-05 16:40:54,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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-02-05 16:40:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2640 transitions. [2025-02-05 16:40:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:40:54,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,029 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:54,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:40:54,029 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:54,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2059583774, now seen corresponding path program 1 times [2025-02-05 16:40:54,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684777451] [2025-02-05 16:40:54,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:40:54,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:40:54,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684777451] [2025-02-05 16:40:54,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684777451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51118985] [2025-02-05 16:40:54,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:54,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:54,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:54,087 INFO L87 Difference]: Start difference. First operand 1838 states and 2640 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-02-05 16:40:54,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,107 INFO L93 Difference]: Finished difference Result 5174 states and 7454 transitions. [2025-02-05 16:40:54,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:54,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) Word has length 94 [2025-02-05 16:40:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,116 INFO L225 Difference]: With dead ends: 5174 [2025-02-05 16:40:54,116 INFO L226 Difference]: Without dead ends: 3434 [2025-02-05 16:40:54,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:54,119 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 73 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:54,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2025-02-05 16:40:54,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3288. [2025-02-05 16:40:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 3287 states have (on average 1.431092181320353) internal successors, (4704), 3287 states have internal predecessors, (4704), 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-02-05 16:40:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4704 transitions. [2025-02-05 16:40:54,149 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4704 transitions. Word has length 94 [2025-02-05 16:40:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,149 INFO L471 AbstractCegarLoop]: Abstraction has 3288 states and 4704 transitions. [2025-02-05 16:40:54,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-02-05 16:40:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4704 transitions. [2025-02-05 16:40:54,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:40:54,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,150 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:54,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:40:54,150 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:54,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1215328190, now seen corresponding path program 1 times [2025-02-05 16:40:54,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582345841] [2025-02-05 16:40:54,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:40:54,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:40:54,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582345841] [2025-02-05 16:40:54,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582345841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:54,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591532695] [2025-02-05 16:40:54,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:54,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:54,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:54,228 INFO L87 Difference]: Start difference. First operand 3288 states and 4704 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-02-05 16:40:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,256 INFO L93 Difference]: Finished difference Result 9380 states and 13394 transitions. [2025-02-05 16:40:54,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:54,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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) Word has length 95 [2025-02-05 16:40:54,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,267 INFO L225 Difference]: With dead ends: 9380 [2025-02-05 16:40:54,267 INFO L226 Difference]: Without dead ends: 6190 [2025-02-05 16:40:54,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:54,271 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 66 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:54,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6190 states. [2025-02-05 16:40:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6190 to 5900. [2025-02-05 16:40:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5900 states, 5899 states have (on average 1.4178674351585014) internal successors, (8364), 5899 states have internal predecessors, (8364), 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-02-05 16:40:54,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5900 states to 5900 states and 8364 transitions. [2025-02-05 16:40:54,341 INFO L78 Accepts]: Start accepts. Automaton has 5900 states and 8364 transitions. Word has length 95 [2025-02-05 16:40:54,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,341 INFO L471 AbstractCegarLoop]: Abstraction has 5900 states and 8364 transitions. [2025-02-05 16:40:54,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-02-05 16:40:54,341 INFO L276 IsEmpty]: Start isEmpty. Operand 5900 states and 8364 transitions. [2025-02-05 16:40:54,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:40:54,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,342 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:54,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 16:40:54,342 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:54,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1058846294, now seen corresponding path program 1 times [2025-02-05 16:40:54,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143161123] [2025-02-05 16:40:54,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:40:54,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:40:54,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143161123] [2025-02-05 16:40:54,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143161123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:54,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267250923] [2025-02-05 16:40:54,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:54,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:54,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:54,396 INFO L87 Difference]: Start difference. First operand 5900 states and 8364 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-02-05 16:40:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,429 INFO L93 Difference]: Finished difference Result 16928 states and 23870 transitions. [2025-02-05 16:40:54,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:54,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) Word has length 96 [2025-02-05 16:40:54,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,446 INFO L225 Difference]: With dead ends: 16928 [2025-02-05 16:40:54,446 INFO L226 Difference]: Without dead ends: 11126 [2025-02-05 16:40:54,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:54,456 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 56 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:54,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 333 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:54,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11126 states. [2025-02-05 16:40:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11126 to 10548. [2025-02-05 16:40:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10548 states, 10547 states have (on average 1.3983123162984734) internal successors, (14748), 10547 states have internal predecessors, (14748), 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-02-05 16:40:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10548 states to 10548 states and 14748 transitions. [2025-02-05 16:40:54,595 INFO L78 Accepts]: Start accepts. Automaton has 10548 states and 14748 transitions. Word has length 96 [2025-02-05 16:40:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,595 INFO L471 AbstractCegarLoop]: Abstraction has 10548 states and 14748 transitions. [2025-02-05 16:40:54,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-02-05 16:40:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 10548 states and 14748 transitions. [2025-02-05 16:40:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:40:54,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,596 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:54,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 16:40:54,596 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:54,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,596 INFO L85 PathProgramCache]: Analyzing trace with hash 648068651, now seen corresponding path program 1 times [2025-02-05 16:40:54,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96047615] [2025-02-05 16:40:54,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:40:54,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:40:54,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96047615] [2025-02-05 16:40:54,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96047615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:54,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734802130] [2025-02-05 16:40:54,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:54,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:54,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:54,767 INFO L87 Difference]: Start difference. First operand 10548 states and 14748 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-02-05 16:40:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,802 INFO L93 Difference]: Finished difference Result 10934 states and 15261 transitions. [2025-02-05 16:40:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:54,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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) Word has length 97 [2025-02-05 16:40:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,819 INFO L225 Difference]: With dead ends: 10934 [2025-02-05 16:40:54,819 INFO L226 Difference]: Without dead ends: 10932 [2025-02-05 16:40:54,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:54,823 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:54,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 764 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:54,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10932 states. [2025-02-05 16:40:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10932 to 10932. [2025-02-05 16:40:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10932 states, 10931 states have (on average 1.3770011892781997) internal successors, (15052), 10931 states have internal predecessors, (15052), 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-02-05 16:40:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10932 states to 10932 states and 15052 transitions. [2025-02-05 16:40:54,925 INFO L78 Accepts]: Start accepts. Automaton has 10932 states and 15052 transitions. Word has length 97 [2025-02-05 16:40:54,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,927 INFO L471 AbstractCegarLoop]: Abstraction has 10932 states and 15052 transitions. [2025-02-05 16:40:54,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-02-05 16:40:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 10932 states and 15052 transitions. [2025-02-05 16:40:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:40:54,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,928 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:54,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 16:40:54,928 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:54,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,929 INFO L85 PathProgramCache]: Analyzing trace with hash 863438709, now seen corresponding path program 1 times [2025-02-05 16:40:54,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177999746] [2025-02-05 16:40:54,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:40:54,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:40:54,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177999746] [2025-02-05 16:40:54,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177999746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306350800] [2025-02-05 16:40:54,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:54,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:54,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:54,998 INFO L87 Difference]: Start difference. First operand 10932 states and 15052 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-02-05 16:40:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:55,139 INFO L93 Difference]: Finished difference Result 20606 states and 28497 transitions. [2025-02-05 16:40:55,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:55,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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) Word has length 97 [2025-02-05 16:40:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:55,167 INFO L225 Difference]: With dead ends: 20606 [2025-02-05 16:40:55,167 INFO L226 Difference]: Without dead ends: 18188 [2025-02-05 16:40:55,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:55,175 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 588 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:55,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 809 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:55,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18188 states. [2025-02-05 16:40:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18188 to 13348. [2025-02-05 16:40:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13348 states, 13347 states have (on average 1.3770884843035889) internal successors, (18380), 13347 states have internal predecessors, (18380), 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-02-05 16:40:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13348 states to 13348 states and 18380 transitions. [2025-02-05 16:40:55,312 INFO L78 Accepts]: Start accepts. Automaton has 13348 states and 18380 transitions. Word has length 97 [2025-02-05 16:40:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:55,312 INFO L471 AbstractCegarLoop]: Abstraction has 13348 states and 18380 transitions. [2025-02-05 16:40:55,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-02-05 16:40:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 13348 states and 18380 transitions. [2025-02-05 16:40:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:40:55,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:55,313 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:55,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-05 16:40:55,313 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:55,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash -115048879, now seen corresponding path program 1 times [2025-02-05 16:40:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:55,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129607767] [2025-02-05 16:40:55,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:55,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:40:55,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:40:55,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:55,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:55,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:55,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129607767] [2025-02-05 16:40:55,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129607767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:55,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:55,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:55,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638511944] [2025-02-05 16:40:55,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:55,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:55,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:55,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:55,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:55,415 INFO L87 Difference]: Start difference. First operand 13348 states and 18380 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-02-05 16:40:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:55,478 INFO L93 Difference]: Finished difference Result 34744 states and 47782 transitions. [2025-02-05 16:40:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:55,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) Word has length 98 [2025-02-05 16:40:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:55,505 INFO L225 Difference]: With dead ends: 34744 [2025-02-05 16:40:55,505 INFO L226 Difference]: Without dead ends: 21494 [2025-02-05 16:40:55,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:55,520 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 77 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:55,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 336 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21494 states. [2025-02-05 16:40:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21494 to 20084. [2025-02-05 16:40:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20084 states, 20083 states have (on average 1.3553751929492606) internal successors, (27220), 20083 states have internal predecessors, (27220), 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-02-05 16:40:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20084 states to 20084 states and 27220 transitions. [2025-02-05 16:40:55,775 INFO L78 Accepts]: Start accepts. Automaton has 20084 states and 27220 transitions. Word has length 98 [2025-02-05 16:40:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:55,776 INFO L471 AbstractCegarLoop]: Abstraction has 20084 states and 27220 transitions. [2025-02-05 16:40:55,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-02-05 16:40:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 20084 states and 27220 transitions. [2025-02-05 16:40:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 16:40:55,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:55,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:55,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-05 16:40:55,780 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:55,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:55,781 INFO L85 PathProgramCache]: Analyzing trace with hash 142099927, now seen corresponding path program 1 times [2025-02-05 16:40:55,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:55,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11949053] [2025-02-05 16:40:55,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:55,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:55,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 16:40:55,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 16:40:55,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:55,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:55,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:55,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11949053] [2025-02-05 16:40:55,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11949053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:55,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:55,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:55,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028010019] [2025-02-05 16:40:55,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:55,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:55,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:55,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:55,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:55,869 INFO L87 Difference]: Start difference. First operand 20084 states and 27220 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-02-05 16:40:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:55,959 INFO L93 Difference]: Finished difference Result 40072 states and 54334 transitions. [2025-02-05 16:40:55,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:55,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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) Word has length 124 [2025-02-05 16:40:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:55,985 INFO L225 Difference]: With dead ends: 40072 [2025-02-05 16:40:55,985 INFO L226 Difference]: Without dead ends: 20086 [2025-02-05 16:40:56,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:56,004 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 68 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:56,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 310 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:56,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20086 states. [2025-02-05 16:40:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20086 to 20084. [2025-02-05 16:40:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20084 states, 20083 states have (on average 1.3378479310859932) internal successors, (26868), 20083 states have internal predecessors, (26868), 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-02-05 16:40:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20084 states to 20084 states and 26868 transitions. [2025-02-05 16:40:56,323 INFO L78 Accepts]: Start accepts. Automaton has 20084 states and 26868 transitions. Word has length 124 [2025-02-05 16:40:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:56,323 INFO L471 AbstractCegarLoop]: Abstraction has 20084 states and 26868 transitions. [2025-02-05 16:40:56,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-02-05 16:40:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 20084 states and 26868 transitions. [2025-02-05 16:40:56,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 16:40:56,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:56,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:56,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 16:40:56,326 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:56,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:56,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2108306651, now seen corresponding path program 1 times [2025-02-05 16:40:56,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:56,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784299887] [2025-02-05 16:40:56,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:56,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:56,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 16:40:56,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 16:40:56,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:56,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:56,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:56,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784299887] [2025-02-05 16:40:56,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784299887] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:56,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478713760] [2025-02-05 16:40:56,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:56,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:56,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:56,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:40:56,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:40:56,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 16:40:56,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 16:40:56,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:56,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:56,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:40:56,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:57,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:58,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478713760] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:58,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:58,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-02-05 16:40:58,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962632804] [2025-02-05 16:40:58,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:58,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 16:40:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:58,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 16:40:58,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:40:58,549 INFO L87 Difference]: Start difference. First operand 20084 states and 26868 transitions. Second operand has 28 states, 28 states have (on average 10.464285714285714) internal successors, (293), 27 states have internal predecessors, (293), 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-02-05 16:41:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:02,285 INFO L93 Difference]: Finished difference Result 163975 states and 217806 transitions. [2025-02-05 16:41:02,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-02-05 16:41:02,285 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.464285714285714) internal successors, (293), 27 states have internal predecessors, (293), 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) Word has length 124 [2025-02-05 16:41:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:02,461 INFO L225 Difference]: With dead ends: 163975 [2025-02-05 16:41:02,462 INFO L226 Difference]: Without dead ends: 143989 [2025-02-05 16:41:02,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4642 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2236, Invalid=13016, Unknown=0, NotChecked=0, Total=15252 [2025-02-05 16:41:02,518 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 3576 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3576 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:02,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3576 Valid, 2804 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:41:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143989 states. [2025-02-05 16:41:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143989 to 72621. [2025-02-05 16:41:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72621 states, 72620 states have (on average 1.3245800055081245) internal successors, (96191), 72620 states have internal predecessors, (96191), 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-02-05 16:41:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72621 states to 72621 states and 96191 transitions. [2025-02-05 16:41:03,837 INFO L78 Accepts]: Start accepts. Automaton has 72621 states and 96191 transitions. Word has length 124 [2025-02-05 16:41:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:03,837 INFO L471 AbstractCegarLoop]: Abstraction has 72621 states and 96191 transitions. [2025-02-05 16:41:03,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.464285714285714) internal successors, (293), 27 states have internal predecessors, (293), 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-02-05 16:41:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 72621 states and 96191 transitions. [2025-02-05 16:41:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 16:41:03,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:03,842 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:03,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:41:04,042 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,SelfDestructingSolverStorable46 [2025-02-05 16:41:04,044 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:41:04,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:04,046 INFO L85 PathProgramCache]: Analyzing trace with hash 564059630, now seen corresponding path program 1 times [2025-02-05 16:41:04,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:04,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290885507] [2025-02-05 16:41:04,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:04,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:04,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 16:41:04,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 16:41:04,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:04,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290885507] [2025-02-05 16:41:04,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290885507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:41:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361619716] [2025-02-05 16:41:04,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:04,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:04,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:41:04,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:41:04,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:41:04,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 16:41:04,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 16:41:04,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:04,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:04,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 16:41:04,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:41:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:05,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:41:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:05,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361619716] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:41:05,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:41:05,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-02-05 16:41:05,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152978182] [2025-02-05 16:41:05,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:41:05,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 16:41:05,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:05,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 16:41:05,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:41:05,743 INFO L87 Difference]: Start difference. First operand 72621 states and 96191 transitions. Second operand has 22 states, 22 states have (on average 14.318181818181818) internal successors, (315), 22 states have internal predecessors, (315), 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-02-05 16:41:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:06,822 INFO L93 Difference]: Finished difference Result 135962 states and 180247 transitions. [2025-02-05 16:41:06,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 16:41:06,822 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 14.318181818181818) internal successors, (315), 22 states have internal predecessors, (315), 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) Word has length 125 [2025-02-05 16:41:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:06,957 INFO L225 Difference]: With dead ends: 135962 [2025-02-05 16:41:06,957 INFO L226 Difference]: Without dead ends: 115976 [2025-02-05 16:41:06,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=402, Invalid=1404, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 16:41:07,000 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1297 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:07,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 940 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115976 states. [2025-02-05 16:41:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115976 to 95276. [2025-02-05 16:41:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95276 states, 95275 states have (on average 1.3236420886906324) internal successors, (126110), 95275 states have internal predecessors, (126110), 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-02-05 16:41:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95276 states to 95276 states and 126110 transitions. [2025-02-05 16:41:08,586 INFO L78 Accepts]: Start accepts. Automaton has 95276 states and 126110 transitions. Word has length 125 [2025-02-05 16:41:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:08,587 INFO L471 AbstractCegarLoop]: Abstraction has 95276 states and 126110 transitions. [2025-02-05 16:41:08,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 14.318181818181818) internal successors, (315), 22 states have internal predecessors, (315), 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-02-05 16:41:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 95276 states and 126110 transitions. [2025-02-05 16:41:08,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 16:41:08,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:08,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:08,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:41:08,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-02-05 16:41:08,798 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:41:08,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1333406069, now seen corresponding path program 1 times [2025-02-05 16:41:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:08,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237279140] [2025-02-05 16:41:08,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:08,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:08,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 16:41:08,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 16:41:08,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:08,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:09,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:09,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237279140] [2025-02-05 16:41:09,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237279140] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:41:09,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877751939] [2025-02-05 16:41:09,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:09,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:09,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:41:09,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:41:09,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:41:09,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 16:41:09,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 16:41:09,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:09,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:09,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 16:41:09,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:41:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:09,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:41:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:10,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877751939] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:41:10,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:41:10,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 29 [2025-02-05 16:41:10,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614849672] [2025-02-05 16:41:10,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:41:10,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 16:41:10,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:10,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 16:41:10,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:41:10,426 INFO L87 Difference]: Start difference. First operand 95276 states and 126110 transitions. Second operand has 29 states, 29 states have (on average 11.689655172413794) internal successors, (339), 29 states have internal predecessors, (339), 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-02-05 16:41:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:23,245 INFO L93 Difference]: Finished difference Result 643006 states and 850346 transitions. [2025-02-05 16:41:23,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2025-02-05 16:41:23,245 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 11.689655172413794) internal successors, (339), 29 states have internal predecessors, (339), 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) Word has length 125 [2025-02-05 16:41:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:23,945 INFO L225 Difference]: With dead ends: 643006 [2025-02-05 16:41:23,946 INFO L226 Difference]: Without dead ends: 547842 [2025-02-05 16:41:24,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23766 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=7177, Invalid=54079, Unknown=0, NotChecked=0, Total=61256 [2025-02-05 16:41:24,021 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 6973 mSDsluCounter, 4148 mSDsCounter, 0 mSdLazyCounter, 6031 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6973 SdHoareTripleChecker+Valid, 4407 SdHoareTripleChecker+Invalid, 6156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 6031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:24,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6973 Valid, 4407 Invalid, 6156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 6031 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 16:41:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547842 states. [2025-02-05 16:41:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547842 to 221516. [2025-02-05 16:41:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221516 states, 221515 states have (on average 1.3226643793874004) internal successors, (292990), 221515 states have internal predecessors, (292990), 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-02-05 16:41:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221516 states to 221516 states and 292990 transitions. [2025-02-05 16:41:28,733 INFO L78 Accepts]: Start accepts. Automaton has 221516 states and 292990 transitions. Word has length 125 [2025-02-05 16:41:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:28,734 INFO L471 AbstractCegarLoop]: Abstraction has 221516 states and 292990 transitions. [2025-02-05 16:41:28,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.689655172413794) internal successors, (339), 29 states have internal predecessors, (339), 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-02-05 16:41:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 221516 states and 292990 transitions. [2025-02-05 16:41:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 16:41:28,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:28,745 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:28,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 16:41:28,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:28,948 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:41:28,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:28,949 INFO L85 PathProgramCache]: Analyzing trace with hash -515031220, now seen corresponding path program 1 times [2025-02-05 16:41:28,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:28,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793101932] [2025-02-05 16:41:28,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:28,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:28,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 16:41:28,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 16:41:28,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:28,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793101932] [2025-02-05 16:41:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793101932] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:41:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532412775] [2025-02-05 16:41:29,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:29,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:29,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:41:29,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:41:29,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:41:29,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 16:41:29,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 16:41:29,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:29,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:29,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 16:41:29,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:41:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:30,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:41:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:31,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532412775] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:41:31,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:41:31,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 35 [2025-02-05 16:41:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421936932] [2025-02-05 16:41:31,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:41:31,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 16:41:31,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:31,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 16:41:31,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 16:41:31,111 INFO L87 Difference]: Start difference. First operand 221516 states and 292990 transitions. Second operand has 35 states, 35 states have (on average 9.914285714285715) internal successors, (347), 35 states have internal predecessors, (347), 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)