./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.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.ufo.BOUNDED-8.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 5990b1cf211e12a23ca85722a0e539783495fb8504bce43e0d5e789fe089f178 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:40:47,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:40:47,293 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:47,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:40:47,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:40:47,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:40:47,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:40:47,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:40:47,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:40:47,310 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:40:47,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:40:47,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:40:47,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:40:47,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:40:47,311 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:40:47,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:40:47,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:40:47,311 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:40:47,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:40:47,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:40:47,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:40:47,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:40:47,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:40:47,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:40:47,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:40:47,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:40:47,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:40:47,312 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 -> 5990b1cf211e12a23ca85722a0e539783495fb8504bce43e0d5e789fe089f178 [2025-02-05 16:40:47,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:40:47,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:40:47,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:40:47,588 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:40:47,588 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:40:47,589 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-02-05 16:40:48,751 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91120a187/5858350c15bd4468a38662fc32ba68eb/FLAGa9f52e42b [2025-02-05 16:40:49,170 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:40:49,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-02-05 16:40:49,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91120a187/5858350c15bd4468a38662fc32ba68eb/FLAGa9f52e42b [2025-02-05 16:40:49,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91120a187/5858350c15bd4468a38662fc32ba68eb [2025-02-05 16:40:49,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:40:49,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:40:49,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:40:49,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:40:49,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:40:49,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:40:49" (1/1) ... [2025-02-05 16:40:49,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:49, skipping insertion in model container [2025-02-05 16:40:49,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:40:49" (1/1) ... [2025-02-05 16:40:49,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:40:49,575 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18815,18828] [2025-02-05 16:40:49,596 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25895,25908] [2025-02-05 16:40:49,605 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29420,29433] [2025-02-05 16:40:49,614 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32798,32811] [2025-02-05 16:40:49,624 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36856,36869] [2025-02-05 16:40:49,632 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40310,40323] [2025-02-05 16:40:49,640 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43875,43888] [2025-02-05 16:40:49,648 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47290,47303] [2025-02-05 16:40:49,659 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[50969,50982] [2025-02-05 16:40:49,666 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54551,54564] [2025-02-05 16:40:49,672 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58080,58093] [2025-02-05 16:40:49,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:40:49,710 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:40:49,770 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[18815,18828] [2025-02-05 16:40:49,787 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[25895,25908] [2025-02-05 16:40:49,795 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[29420,29433] [2025-02-05 16:40:49,808 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[32798,32811] [2025-02-05 16:40:49,822 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[36856,36869] [2025-02-05 16:40:49,831 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[40310,40323] [2025-02-05 16:40:49,844 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[43875,43888] [2025-02-05 16:40:49,849 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[47290,47303] [2025-02-05 16:40:49,855 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[50969,50982] [2025-02-05 16:40:49,859 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[54551,54564] [2025-02-05 16:40:49,867 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.ufo.BOUNDED-8.pals.c.v+sep-reducer.c[58080,58093] [2025-02-05 16:40:49,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:40:49,894 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:40:49,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:49 WrapperNode [2025-02-05 16:40:49,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:40:49,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:40:49,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:40:49,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:40:49,900 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:49" (1/1) ... [2025-02-05 16:40:49,925 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:49" (1/1) ... [2025-02-05 16:40:49,973 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2962 [2025-02-05 16:40:49,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:40:49,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:40:49,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:40:49,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:40:49,980 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:49" (1/1) ... [2025-02-05 16:40:49,980 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:49" (1/1) ... [2025-02-05 16:40:49,986 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:49" (1/1) ... [2025-02-05 16:40:50,019 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:50,020 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:49" (1/1) ... [2025-02-05 16:40:50,020 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:49" (1/1) ... [2025-02-05 16:40:50,050 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:49" (1/1) ... [2025-02-05 16:40:50,052 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:49" (1/1) ... [2025-02-05 16:40:50,056 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:49" (1/1) ... [2025-02-05 16:40:50,062 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:49" (1/1) ... [2025-02-05 16:40:50,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:40:50,070 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:40:50,070 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:40:50,070 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:40:50,070 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:49" (1/1) ... [2025-02-05 16:40:50,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:40:50,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:50,096 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:50,103 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:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:40:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:40:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:40:50,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:40:50,256 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:40:50,257 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:40:51,534 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2291: 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_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~14#1; [2025-02-05 16:40:51,534 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4009: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~21#1; [2025-02-05 16:40:51,534 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L244: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-05 16:40:51,534 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3482: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~15#1; [2025-02-05 16:40:51,534 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2426: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~10#1; [2025-02-05 16:40:51,534 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1369: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~5#1; [2025-02-05 16:40:51,534 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4475: havoc main_~node3__m3~20#1; [2025-02-05 16:40:51,534 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~9#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4608: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4410: havoc main_~node1__m1~17#1;havoc main_~main____CPAchecker_TMP_0~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_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245: 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_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~6#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L719: 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_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~2#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4552: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~24#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2042: 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_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~12#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L853: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~3#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1778: 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_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~10#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4157: 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_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L988: 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_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3499: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~18#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3367: 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_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1386: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~6#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3897: 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_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~15#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1521: 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_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~8#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2852: 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_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4636: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3117: 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_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-02-05 16:40:51,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L278: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-05 16:40:51,536 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2592: 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_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~16#1; [2025-02-05 16:40:51,536 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4443: havoc main_~node2__m2~18#1; [2025-02-05 16:40:51,536 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3653: havoc main_~main____CPAchecker_TMP_0~13#1;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_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-02-05 16:40:51,536 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4580: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:40:51,536 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: 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_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:40:51,537 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L227: 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:51,537 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2409: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~9#1; [2025-02-05 16:40:51,619 INFO L? ?]: Removed 576 outVars from TransFormulas that were not future-live. [2025-02-05 16:40:51,619 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:40:51,646 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:40:51,646 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:40:51,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:40:51 BoogieIcfgContainer [2025-02-05 16:40:51,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:40:51,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:40:51,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:40:51,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:40:51,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:40:49" (1/3) ... [2025-02-05 16:40:51,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675c56f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:40:51, skipping insertion in model container [2025-02-05 16:40:51,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:49" (2/3) ... [2025-02-05 16:40:51,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675c56f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:40:51, skipping insertion in model container [2025-02-05 16:40:51,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:40:51" (3/3) ... [2025-02-05 16:40:51,653 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2025-02-05 16:40:51,663 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:40:51,665 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c that has 1 procedures, 570 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-02-05 16:40:51,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:40:51,717 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;@21f0743c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:40:51,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-05 16:40:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 570 states, 558 states have (on average 1.7831541218637992) internal successors, (995), 569 states have internal predecessors, (995), 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:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:40:51,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:51,736 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:51,736 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:51,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:51,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1992259109, now seen corresponding path program 1 times [2025-02-05 16:40:51,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:51,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819283994] [2025-02-05 16:40:51,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:51,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:40:51,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:40:51,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:51,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:52,205 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,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:52,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819283994] [2025-02-05 16:40:52,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819283994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:52,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:52,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937759389] [2025-02-05 16:40:52,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:52,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:52,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:52,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:52,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:52,251 INFO L87 Difference]: Start difference. First operand has 570 states, 558 states have (on average 1.7831541218637992) internal successors, (995), 569 states have internal predecessors, (995), 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 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:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:52,606 INFO L93 Difference]: Finished difference Result 713 states and 1214 transitions. [2025-02-05 16:40:52,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:52,608 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:52,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:52,614 INFO L225 Difference]: With dead ends: 713 [2025-02-05 16:40:52,614 INFO L226 Difference]: Without dead ends: 413 [2025-02-05 16:40:52,617 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:52,618 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 2026 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:52,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 463 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-05 16:40:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-02-05 16:40:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 402 states have (on average 1.2761194029850746) internal successors, (513), 412 states have internal predecessors, (513), 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,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 513 transitions. [2025-02-05 16:40:52,650 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 513 transitions. Word has length 60 [2025-02-05 16:40:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:52,650 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 513 transitions. [2025-02-05 16:40:52,650 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:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 513 transitions. [2025-02-05 16:40:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:40:52,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:52,652 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:52,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:40:52,652 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:52,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1616741545, now seen corresponding path program 1 times [2025-02-05 16:40:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:52,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917686740] [2025-02-05 16:40:52,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:52,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:40:52,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:40:52,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:52,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:52,862 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,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:52,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917686740] [2025-02-05 16:40:52,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917686740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:52,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:52,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:52,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906910688] [2025-02-05 16:40:52,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:52,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:52,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:52,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:52,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:52,866 INFO L87 Difference]: Start difference. First operand 413 states and 513 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:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:53,117 INFO L93 Difference]: Finished difference Result 589 states and 742 transitions. [2025-02-05 16:40:53,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:53,117 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:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:53,118 INFO L225 Difference]: With dead ends: 589 [2025-02-05 16:40:53,119 INFO L226 Difference]: Without dead ends: 381 [2025-02-05 16:40:53,119 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:53,120 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 1352 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:53,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 270 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:53,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-02-05 16:40:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-02-05 16:40:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 370 states have (on average 1.2864864864864864) internal successors, (476), 380 states have internal predecessors, (476), 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,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 476 transitions. [2025-02-05 16:40:53,140 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 476 transitions. Word has length 60 [2025-02-05 16:40:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:53,140 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 476 transitions. [2025-02-05 16:40:53,140 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:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2025-02-05 16:40:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:40:53,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:53,145 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:53,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:40:53,145 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:53,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:53,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1176279047, now seen corresponding path program 1 times [2025-02-05 16:40:53,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:53,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063914451] [2025-02-05 16:40:53,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:53,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:53,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:40:53,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:40:53,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:53,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:53,312 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,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063914451] [2025-02-05 16:40:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063914451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:53,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:53,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369286150] [2025-02-05 16:40:53,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:53,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:53,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:53,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:53,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:53,314 INFO L87 Difference]: Start difference. First operand 381 states and 476 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:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:53,505 INFO L93 Difference]: Finished difference Result 539 states and 682 transitions. [2025-02-05 16:40:53,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:53,506 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:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:53,507 INFO L225 Difference]: With dead ends: 539 [2025-02-05 16:40:53,507 INFO L226 Difference]: Without dead ends: 335 [2025-02-05 16:40:53,507 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:53,508 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 1224 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:53,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 240 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-02-05 16:40:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2025-02-05 16:40:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 324 states have (on average 1.2993827160493827) internal successors, (421), 334 states have internal predecessors, (421), 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,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 421 transitions. [2025-02-05 16:40:53,523 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 421 transitions. Word has length 60 [2025-02-05 16:40:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:53,523 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 421 transitions. [2025-02-05 16:40:53,523 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:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 421 transitions. [2025-02-05 16:40:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:40:53,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:53,529 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] [2025-02-05 16:40:53,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:40:53,529 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:53,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1643758765, now seen corresponding path program 1 times [2025-02-05 16:40:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083159669] [2025-02-05 16:40:53,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:53,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:53,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:40:53,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:40:53,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:53,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:53,725 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,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:53,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083159669] [2025-02-05 16:40:53,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083159669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:53,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:53,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:53,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540060741] [2025-02-05 16:40:53,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:53,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:53,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:53,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:53,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:53,727 INFO L87 Difference]: Start difference. First operand 335 states and 421 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:53,858 INFO L93 Difference]: Finished difference Result 433 states and 540 transitions. [2025-02-05 16:40:53,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:53,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2025-02-05 16:40:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:53,859 INFO L225 Difference]: With dead ends: 433 [2025-02-05 16:40:53,859 INFO L226 Difference]: Without dead ends: 261 [2025-02-05 16:40:53,860 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:53,860 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 909 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 209 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:53,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 209 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-05 16:40:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-02-05 16:40:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.296) internal successors, (324), 260 states have internal predecessors, (324), 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,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 324 transitions. [2025-02-05 16:40:53,869 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 324 transitions. Word has length 62 [2025-02-05 16:40:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:53,870 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 324 transitions. [2025-02-05 16:40:53,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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,870 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 324 transitions. [2025-02-05 16:40:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:40:53,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:53,870 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] [2025-02-05 16:40:53,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:40:53,871 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:53,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash -821194675, now seen corresponding path program 1 times [2025-02-05 16:40:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:53,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623508419] [2025-02-05 16:40:53,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:53,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:40:53,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:40:53,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:53,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,205 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,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623508419] [2025-02-05 16:40:54,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623508419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:40:54,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393593617] [2025-02-05 16:40:54,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:40:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:40:54,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:40:54,206 INFO L87 Difference]: Start difference. First operand 261 states and 324 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,535 INFO L93 Difference]: Finished difference Result 516 states and 640 transitions. [2025-02-05 16:40:54,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:40:54,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 64 [2025-02-05 16:40:54,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,537 INFO L225 Difference]: With dead ends: 516 [2025-02-05 16:40:54,537 INFO L226 Difference]: Without dead ends: 375 [2025-02-05 16:40:54,537 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:54,538 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1346 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:54,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 825 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-02-05 16:40:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 261. [2025-02-05 16:40:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.292) internal successors, (323), 260 states have internal predecessors, (323), 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,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 323 transitions. [2025-02-05 16:40:54,542 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 323 transitions. Word has length 64 [2025-02-05 16:40:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,542 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 323 transitions. [2025-02-05 16:40:54,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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,542 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 323 transitions. [2025-02-05 16:40:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:40:54,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,543 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] [2025-02-05 16:40:54,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:40:54,543 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:54,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1083020715, now seen corresponding path program 1 times [2025-02-05 16:40:54,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629661386] [2025-02-05 16:40:54,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:40:54,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:40:54,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,798 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,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629661386] [2025-02-05 16:40:54,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629661386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:54,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180316596] [2025-02-05 16:40:54,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:54,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:54,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:54,799 INFO L87 Difference]: Start difference. First operand 261 states and 323 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:55,198 INFO L93 Difference]: Finished difference Result 497 states and 633 transitions. [2025-02-05 16:40:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:55,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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 64 [2025-02-05 16:40:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:55,200 INFO L225 Difference]: With dead ends: 497 [2025-02-05 16:40:55,200 INFO L226 Difference]: Without dead ends: 405 [2025-02-05 16:40:55,201 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:55,201 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 744 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:55,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1109 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-02-05 16:40:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 261. [2025-02-05 16:40:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.288) internal successors, (322), 260 states have internal predecessors, (322), 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,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 322 transitions. [2025-02-05 16:40:55,208 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 322 transitions. Word has length 64 [2025-02-05 16:40:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:55,208 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 322 transitions. [2025-02-05 16:40:55,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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,208 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 322 transitions. [2025-02-05 16:40:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:40:55,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:55,211 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] [2025-02-05 16:40:55,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:40:55,212 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:55,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1181021581, now seen corresponding path program 1 times [2025-02-05 16:40:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:55,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293838972] [2025-02-05 16:40:55,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:55,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:40:55,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:40:55,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:55,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:55,436 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,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:55,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293838972] [2025-02-05 16:40:55,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293838972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:55,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:55,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307862232] [2025-02-05 16:40:55,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:55,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:55,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:55,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:55,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:55,438 INFO L87 Difference]: Start difference. First operand 261 states and 322 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:55,821 INFO L93 Difference]: Finished difference Result 469 states and 597 transitions. [2025-02-05 16:40:55,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:55,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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 64 [2025-02-05 16:40:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:55,823 INFO L225 Difference]: With dead ends: 469 [2025-02-05 16:40:55,823 INFO L226 Difference]: Without dead ends: 401 [2025-02-05 16:40:55,824 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:55,824 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 1119 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:55,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1075 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-05 16:40:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 261. [2025-02-05 16:40:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.284) internal successors, (321), 260 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:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 321 transitions. [2025-02-05 16:40:55,836 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 321 transitions. Word has length 64 [2025-02-05 16:40:55,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:55,836 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 321 transitions. [2025-02-05 16:40:55,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 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,836 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 321 transitions. [2025-02-05 16:40:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:55,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:55,836 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:55,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:40:55,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:55,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1665658962, now seen corresponding path program 1 times [2025-02-05 16:40:55,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:55,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578881032] [2025-02-05 16:40:55,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:55,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:55,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:55,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:55,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:55,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:56,064 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:56,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:56,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578881032] [2025-02-05 16:40:56,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578881032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:56,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:56,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:56,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967849671] [2025-02-05 16:40:56,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:56,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:56,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:56,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:56,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:56,066 INFO L87 Difference]: Start difference. First operand 261 states and 321 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:56,431 INFO L93 Difference]: Finished difference Result 450 states and 567 transitions. [2025-02-05 16:40:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:56,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:56,433 INFO L225 Difference]: With dead ends: 450 [2025-02-05 16:40:56,433 INFO L226 Difference]: Without dead ends: 393 [2025-02-05 16:40:56,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:40:56,434 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 1742 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:56,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 858 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-02-05 16:40:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 261. [2025-02-05 16:40:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 250 states have (on average 1.28) internal successors, (320), 260 states have internal predecessors, (320), 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,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 320 transitions. [2025-02-05 16:40:56,438 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 320 transitions. Word has length 65 [2025-02-05 16:40:56,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:56,438 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 320 transitions. [2025-02-05 16:40:56,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 320 transitions. [2025-02-05 16:40:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:56,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:56,439 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:56,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:40:56,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:56,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:56,439 INFO L85 PathProgramCache]: Analyzing trace with hash -430531994, now seen corresponding path program 1 times [2025-02-05 16:40:56,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:56,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623118356] [2025-02-05 16:40:56,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:56,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:56,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:56,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:56,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:56,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:57,075 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:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623118356] [2025-02-05 16:40:57,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623118356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:57,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:40:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219537217] [2025-02-05 16:40:57,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:57,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:40:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:57,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:40:57,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:40:57,077 INFO L87 Difference]: Start difference. First operand 261 states and 320 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:57,716 INFO L93 Difference]: Finished difference Result 541 states and 693 transitions. [2025-02-05 16:40:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:40:57,716 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:57,718 INFO L225 Difference]: With dead ends: 541 [2025-02-05 16:40:57,718 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 16:40:57,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:40:57,719 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 2977 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2977 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:57,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2977 Valid, 904 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:40:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 16:40:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 266. [2025-02-05 16:40:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 255 states have (on average 1.2745098039215685) internal successors, (325), 265 states have internal predecessors, (325), 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:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 325 transitions. [2025-02-05 16:40:57,724 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 325 transitions. Word has length 66 [2025-02-05 16:40:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:57,724 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 325 transitions. [2025-02-05 16:40:57,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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:57,724 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 325 transitions. [2025-02-05 16:40:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:57,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:57,725 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:57,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:40:57,725 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:57,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:57,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1783392660, now seen corresponding path program 1 times [2025-02-05 16:40:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:57,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251219610] [2025-02-05 16:40:57,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:57,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:57,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:57,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:57,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:58,058 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:58,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:58,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251219610] [2025-02-05 16:40:58,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251219610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:58,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:58,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:40:58,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880977761] [2025-02-05 16:40:58,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:58,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:40:58,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:58,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:40:58,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:40:58,059 INFO L87 Difference]: Start difference. First operand 266 states and 325 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:58,833 INFO L93 Difference]: Finished difference Result 661 states and 869 transitions. [2025-02-05 16:40:58,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:40:58,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:58,836 INFO L225 Difference]: With dead ends: 661 [2025-02-05 16:40:58,837 INFO L226 Difference]: Without dead ends: 588 [2025-02-05 16:40:58,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:40:58,838 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 2464 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2464 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:58,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2464 Valid, 1197 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:40:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-02-05 16:40:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 271. [2025-02-05 16:40:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 260 states have (on average 1.2692307692307692) internal successors, (330), 270 states have internal predecessors, (330), 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:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 330 transitions. [2025-02-05 16:40:58,844 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 330 transitions. Word has length 66 [2025-02-05 16:40:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:58,844 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 330 transitions. [2025-02-05 16:40:58,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 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:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 330 transitions. [2025-02-05 16:40:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:58,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:58,846 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:58,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:40:58,846 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:58,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:58,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1272981750, now seen corresponding path program 1 times [2025-02-05 16:40:58,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:58,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048086962] [2025-02-05 16:40:58,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:58,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:58,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:58,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:58,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:59,029 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:59,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:59,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048086962] [2025-02-05 16:40:59,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048086962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:59,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:59,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:59,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97111374] [2025-02-05 16:40:59,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:59,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:59,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:59,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:59,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:59,031 INFO L87 Difference]: Start difference. First operand 271 states and 330 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:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:59,365 INFO L93 Difference]: Finished difference Result 458 states and 573 transitions. [2025-02-05 16:40:59,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:59,366 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:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:59,367 INFO L225 Difference]: With dead ends: 458 [2025-02-05 16:40:59,367 INFO L226 Difference]: Without dead ends: 398 [2025-02-05 16:40:59,367 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:59,368 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1715 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:59,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 842 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-05 16:40:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 271. [2025-02-05 16:40:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 260 states have (on average 1.2653846153846153) internal successors, (329), 270 states have internal predecessors, (329), 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:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 329 transitions. [2025-02-05 16:40:59,374 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 329 transitions. Word has length 66 [2025-02-05 16:40:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:59,375 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 329 transitions. [2025-02-05 16:40:59,375 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:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 329 transitions. [2025-02-05 16:40:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:59,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:59,377 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:59,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:40:59,377 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:59,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash 777786182, now seen corresponding path program 1 times [2025-02-05 16:40:59,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:59,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628888607] [2025-02-05 16:40:59,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:59,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:59,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:59,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:59,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:59,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:59,540 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:59,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:59,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628888607] [2025-02-05 16:40:59,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628888607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:59,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:59,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:59,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420873464] [2025-02-05 16:40:59,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:59,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:59,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:59,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:59,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:59,542 INFO L87 Difference]: Start difference. First operand 271 states and 329 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:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:59,926 INFO L93 Difference]: Finished difference Result 513 states and 644 transitions. [2025-02-05 16:40:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:59,926 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:59,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:59,927 INFO L225 Difference]: With dead ends: 513 [2025-02-05 16:40:59,927 INFO L226 Difference]: Without dead ends: 415 [2025-02-05 16:40:59,928 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:59,928 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 1102 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:59,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1094 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-05 16:40:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 271. [2025-02-05 16:40:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 260 states have (on average 1.2615384615384615) internal successors, (328), 270 states have internal predecessors, (328), 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:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 328 transitions. [2025-02-05 16:40:59,933 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 328 transitions. Word has length 66 [2025-02-05 16:40:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:59,933 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 328 transitions. [2025-02-05 16:40:59,933 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:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 328 transitions. [2025-02-05 16:40:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:59,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:59,934 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:59,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:40:59,934 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:59,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:59,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1386197958, now seen corresponding path program 1 times [2025-02-05 16:40:59,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:59,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55383470] [2025-02-05 16:40:59,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:59,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:59,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:59,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:59,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:59,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:00,236 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:41:00,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:00,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55383470] [2025-02-05 16:41:00,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55383470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:00,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:00,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:00,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647613352] [2025-02-05 16:41:00,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:00,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:00,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:00,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:00,242 INFO L87 Difference]: Start difference. First operand 271 states and 328 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:41:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:00,883 INFO L93 Difference]: Finished difference Result 425 states and 521 transitions. [2025-02-05 16:41:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:00,884 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:41:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:00,885 INFO L225 Difference]: With dead ends: 425 [2025-02-05 16:41:00,885 INFO L226 Difference]: Without dead ends: 406 [2025-02-05 16:41:00,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:41:00,886 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 759 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:00,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1032 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:41:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-02-05 16:41:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 271. [2025-02-05 16:41:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 260 states have (on average 1.2576923076923077) internal successors, (327), 270 states have internal predecessors, (327), 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:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 327 transitions. [2025-02-05 16:41:00,891 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 327 transitions. Word has length 66 [2025-02-05 16:41:00,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:00,891 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 327 transitions. [2025-02-05 16:41:00,891 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:41:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 327 transitions. [2025-02-05 16:41:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:41:00,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:00,892 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:41:00,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:41:00,892 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:41:00,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:00,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1900614662, now seen corresponding path program 1 times [2025-02-05 16:41:00,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508165464] [2025-02-05 16:41:00,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:00,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:41:00,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:41:00,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:00,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:01,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:41:01,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508165464] [2025-02-05 16:41:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508165464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:01,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603463073] [2025-02-05 16:41:01,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:01,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:01,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:01,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:01,076 INFO L87 Difference]: Start difference. First operand 271 states and 327 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:41:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:01,516 INFO L93 Difference]: Finished difference Result 404 states and 490 transitions. [2025-02-05 16:41:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:41:01,516 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:41:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:01,518 INFO L225 Difference]: With dead ends: 404 [2025-02-05 16:41:01,518 INFO L226 Difference]: Without dead ends: 398 [2025-02-05 16:41:01,518 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:41:01,519 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 745 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:01,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1015 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-05 16:41:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 271. [2025-02-05 16:41:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 260 states have (on average 1.2538461538461538) internal successors, (326), 270 states have internal predecessors, (326), 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:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 326 transitions. [2025-02-05 16:41:01,525 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 326 transitions. Word has length 66 [2025-02-05 16:41:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:01,525 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 326 transitions. [2025-02-05 16:41:01,525 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:41:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 326 transitions. [2025-02-05 16:41:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:41:01,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:01,526 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] [2025-02-05 16:41:01,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:41:01,526 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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:01,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:01,526 INFO L85 PathProgramCache]: Analyzing trace with hash 184897305, now seen corresponding path program 1 times [2025-02-05 16:41:01,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:01,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907573768] [2025-02-05 16:41:01,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:01,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:41:01,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:41:01,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:01,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:02,684 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:41:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:02,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907573768] [2025-02-05 16:41:02,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907573768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:02,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:02,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-02-05 16:41:02,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669989623] [2025-02-05 16:41:02,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:02,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 16:41:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:02,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 16:41:02,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:41:02,687 INFO L87 Difference]: Start difference. First operand 271 states and 326 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:06,004 INFO L93 Difference]: Finished difference Result 637 states and 791 transitions. [2025-02-05 16:41:06,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 16:41:06,006 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 67 [2025-02-05 16:41:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:06,008 INFO L225 Difference]: With dead ends: 637 [2025-02-05 16:41:06,008 INFO L226 Difference]: Without dead ends: 582 [2025-02-05 16:41:06,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=462, Invalid=1794, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 16:41:06,009 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 2950 mSDsluCounter, 6090 mSDsCounter, 0 mSdLazyCounter, 3041 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2950 SdHoareTripleChecker+Valid, 6523 SdHoareTripleChecker+Invalid, 3055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:06,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2950 Valid, 6523 Invalid, 3055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3041 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 16:41:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-02-05 16:41:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 273. [2025-02-05 16:41:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 262 states have (on average 1.2557251908396947) internal successors, (329), 272 states have internal predecessors, (329), 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,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2025-02-05 16:41:06,025 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 67 [2025-02-05 16:41:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:06,026 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2025-02-05 16:41:06,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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,026 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2025-02-05 16:41:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:41:06,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:06,030 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] [2025-02-05 16:41:06,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:41:06,030 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:06,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash -503598167, now seen corresponding path program 1 times [2025-02-05 16:41:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:06,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830320026] [2025-02-05 16:41:06,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:06,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:41:06,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:41:06,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:06,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:06,419 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:41:06,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:06,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830320026] [2025-02-05 16:41:06,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830320026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:06,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:06,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:41:06,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203339067] [2025-02-05 16:41:06,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:06,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:41:06,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:06,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:41:06,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:41:06,423 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 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,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:06,876 INFO L93 Difference]: Finished difference Result 701 states and 890 transitions. [2025-02-05 16:41:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:41:06,876 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 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 67 [2025-02-05 16:41:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:06,878 INFO L225 Difference]: With dead ends: 701 [2025-02-05 16:41:06,878 INFO L226 Difference]: Without dead ends: 613 [2025-02-05 16:41:06,878 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:41:06,878 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 1669 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 3230 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:06,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 3230 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-02-05 16:41:06,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 239. [2025-02-05 16:41:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 229 states have (on average 1.2532751091703056) internal successors, (287), 238 states have internal predecessors, (287), 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,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 287 transitions. [2025-02-05 16:41:06,883 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 287 transitions. Word has length 67 [2025-02-05 16:41:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:06,884 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 287 transitions. [2025-02-05 16:41:06,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 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,884 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 287 transitions. [2025-02-05 16:41:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:41:06,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:06,884 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] [2025-02-05 16:41:06,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:41:06,886 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:41:06,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:06,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1381031145, now seen corresponding path program 1 times [2025-02-05 16:41:06,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:06,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103386339] [2025-02-05 16:41:06,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:06,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:06,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:41:06,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:41:06,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:06,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:07,023 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:41:07,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103386339] [2025-02-05 16:41:07,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103386339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:07,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:07,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659466626] [2025-02-05 16:41:07,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:07,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:07,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:07,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:07,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:07,025 INFO L87 Difference]: Start difference. First operand 239 states and 287 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 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:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:07,414 INFO L93 Difference]: Finished difference Result 447 states and 560 transitions. [2025-02-05 16:41:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:07,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 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 67 [2025-02-05 16:41:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:07,415 INFO L225 Difference]: With dead ends: 447 [2025-02-05 16:41:07,416 INFO L226 Difference]: Without dead ends: 374 [2025-02-05 16:41:07,416 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:41:07,417 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 856 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:07,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1179 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-05 16:41:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 234. [2025-02-05 16:41:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 224 states have (on average 1.2544642857142858) internal successors, (281), 233 states have internal predecessors, (281), 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:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 281 transitions. [2025-02-05 16:41:07,421 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 281 transitions. Word has length 67 [2025-02-05 16:41:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:07,421 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 281 transitions. [2025-02-05 16:41:07,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 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:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 281 transitions. [2025-02-05 16:41:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:41:07,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:07,422 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] [2025-02-05 16:41:07,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:41:07,422 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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:07,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:07,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1453794186, now seen corresponding path program 1 times [2025-02-05 16:41:07,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:07,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631616458] [2025-02-05 16:41:07,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:07,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:07,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:41:07,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:41:07,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:07,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:08,494 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:41:08,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:08,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631616458] [2025-02-05 16:41:08,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631616458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:08,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:08,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-02-05 16:41:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902428824] [2025-02-05 16:41:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:08,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 16:41:08,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:08,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 16:41:08,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:41:08,496 INFO L87 Difference]: Start difference. First operand 234 states and 281 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:10,813 INFO L93 Difference]: Finished difference Result 699 states and 876 transitions. [2025-02-05 16:41:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 16:41:10,814 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 67 [2025-02-05 16:41:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:10,815 INFO L225 Difference]: With dead ends: 699 [2025-02-05 16:41:10,815 INFO L226 Difference]: Without dead ends: 644 [2025-02-05 16:41:10,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=379, Invalid=1691, Unknown=0, NotChecked=0, Total=2070 [2025-02-05 16:41:10,816 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 2515 mSDsluCounter, 5641 mSDsCounter, 0 mSdLazyCounter, 2663 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 6140 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:10,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2515 Valid, 6140 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2663 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:41:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-05 16:41:10,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 245. [2025-02-05 16:41:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.2553191489361701) internal successors, (295), 244 states have internal predecessors, (295), 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:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 295 transitions. [2025-02-05 16:41:10,829 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 295 transitions. Word has length 67 [2025-02-05 16:41:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:10,829 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 295 transitions. [2025-02-05 16:41:10,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 295 transitions. [2025-02-05 16:41:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:41:10,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:10,830 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] [2025-02-05 16:41:10,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:41:10,830 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:41:10,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash -563711719, now seen corresponding path program 1 times [2025-02-05 16:41:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:10,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982849190] [2025-02-05 16:41:10,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:10,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:41:10,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:41:10,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:10,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:11,896 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:41:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982849190] [2025-02-05 16:41:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982849190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:11,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:11,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-02-05 16:41:11,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297296228] [2025-02-05 16:41:11,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:11,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 16:41:11,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:11,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 16:41:11,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:41:11,897 INFO L87 Difference]: Start difference. First operand 245 states and 295 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:14,336 INFO L93 Difference]: Finished difference Result 785 states and 983 transitions. [2025-02-05 16:41:14,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 16:41:14,336 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 67 [2025-02-05 16:41:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:14,338 INFO L225 Difference]: With dead ends: 785 [2025-02-05 16:41:14,341 INFO L226 Difference]: Without dead ends: 730 [2025-02-05 16:41:14,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=336, Invalid=1920, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 16:41:14,343 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 2504 mSDsluCounter, 6035 mSDsCounter, 0 mSdLazyCounter, 3042 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2504 SdHoareTripleChecker+Valid, 6450 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:14,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2504 Valid, 6450 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3042 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:41:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-02-05 16:41:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 260. [2025-02-05 16:41:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 250 states have (on average 1.26) internal successors, (315), 259 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:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 315 transitions. [2025-02-05 16:41:14,351 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 315 transitions. Word has length 67 [2025-02-05 16:41:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:14,351 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 315 transitions. [2025-02-05 16:41:14,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 315 transitions. [2025-02-05 16:41:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:41:14,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:14,352 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:41:14,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:41:14,353 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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:14,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:14,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1696174985, now seen corresponding path program 1 times [2025-02-05 16:41:14,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:14,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60657487] [2025-02-05 16:41:14,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:14,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:14,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:41:14,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:41:14,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:14,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:14,820 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:41:14,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:14,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60657487] [2025-02-05 16:41:14,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60657487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:14,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:14,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:41:14,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921229840] [2025-02-05 16:41:14,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:14,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:41:14,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:14,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:41:14,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:41:14,821 INFO L87 Difference]: Start difference. First operand 260 states and 315 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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:41:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:15,309 INFO L93 Difference]: Finished difference Result 429 states and 540 transitions. [2025-02-05 16:41:15,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:41:15,310 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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:41:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:15,311 INFO L225 Difference]: With dead ends: 429 [2025-02-05 16:41:15,311 INFO L226 Difference]: Without dead ends: 331 [2025-02-05 16:41:15,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:41:15,311 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 1312 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:15,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 1723 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-02-05 16:41:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 209. [2025-02-05 16:41:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 202 states have (on average 1.2574257425742574) internal successors, (254), 208 states have internal predecessors, (254), 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:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 254 transitions. [2025-02-05 16:41:15,321 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 254 transitions. Word has length 68 [2025-02-05 16:41:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:15,322 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 254 transitions. [2025-02-05 16:41:15,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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:41:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 254 transitions. [2025-02-05 16:41:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:41:15,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:15,322 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:41:15,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:41:15,322 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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:15,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:15,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1865489109, now seen corresponding path program 1 times [2025-02-05 16:41:15,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:15,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132807462] [2025-02-05 16:41:15,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:15,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:15,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:41:15,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:41:15,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:15,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:15,899 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:41:15,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:15,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132807462] [2025-02-05 16:41:15,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132807462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:15,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:15,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 16:41:15,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445709093] [2025-02-05 16:41:15,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:15,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 16:41:15,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:15,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 16:41:15,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:41:15,901 INFO L87 Difference]: Start difference. First operand 209 states and 254 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 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:41:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:16,848 INFO L93 Difference]: Finished difference Result 396 states and 501 transitions. [2025-02-05 16:41:16,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:41:16,848 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 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:41:16,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:16,849 INFO L225 Difference]: With dead ends: 396 [2025-02-05 16:41:16,849 INFO L226 Difference]: Without dead ends: 330 [2025-02-05 16:41:16,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:41:16,850 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1033 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:16,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 3023 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:41:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-05 16:41:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 204. [2025-02-05 16:41:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 197 states have (on average 1.248730964467005) internal successors, (246), 203 states have internal predecessors, (246), 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:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 246 transitions. [2025-02-05 16:41:16,857 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 246 transitions. Word has length 68 [2025-02-05 16:41:16,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:16,857 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 246 transitions. [2025-02-05 16:41:16,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 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:41:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 246 transitions. [2025-02-05 16:41:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:41:16,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:16,858 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:41:16,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:41:16,858 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:41:16,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:16,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1911381427, now seen corresponding path program 1 times [2025-02-05 16:41:16,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:16,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076752145] [2025-02-05 16:41:16,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:16,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:41:16,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:41:16,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:16,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:17,246 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:41:17,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:17,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076752145] [2025-02-05 16:41:17,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076752145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:17,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:17,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:41:17,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990930723] [2025-02-05 16:41:17,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:17,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:41:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:17,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:41:17,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:41:17,248 INFO L87 Difference]: Start difference. First operand 204 states and 246 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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:41:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:17,742 INFO L93 Difference]: Finished difference Result 506 states and 654 transitions. [2025-02-05 16:41:17,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:17,745 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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:41:17,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:17,745 INFO L225 Difference]: With dead ends: 506 [2025-02-05 16:41:17,746 INFO L226 Difference]: Without dead ends: 403 [2025-02-05 16:41:17,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:41:17,747 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 1209 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:17,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 1400 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:17,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-02-05 16:41:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 155. [2025-02-05 16:41:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 154 states have internal predecessors, (189), 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:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2025-02-05 16:41:17,750 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 68 [2025-02-05 16:41:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:17,750 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2025-02-05 16:41:17,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 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:41:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2025-02-05 16:41:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:41:17,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:17,750 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:41:17,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:41:17,751 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:41:17,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:17,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1977547709, now seen corresponding path program 1 times [2025-02-05 16:41:17,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:17,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69852488] [2025-02-05 16:41:17,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:17,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:17,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:41:17,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:41:17,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:17,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:18,773 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:41:18,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:18,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69852488] [2025-02-05 16:41:18,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69852488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:18,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:18,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 16:41:18,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414814015] [2025-02-05 16:41:18,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:18,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 16:41:18,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:18,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 16:41:18,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:41:18,775 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 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:41:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:20,031 INFO L93 Difference]: Finished difference Result 480 states and 629 transitions. [2025-02-05 16:41:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 16:41:20,032 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 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:41:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:20,033 INFO L225 Difference]: With dead ends: 480 [2025-02-05 16:41:20,033 INFO L226 Difference]: Without dead ends: 422 [2025-02-05 16:41:20,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=1099, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 16:41:20,033 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1468 mSDsluCounter, 2424 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:20,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 2595 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:41:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-02-05 16:41:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 172. [2025-02-05 16:41:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 168 states have (on average 1.2619047619047619) internal successors, (212), 171 states have internal predecessors, (212), 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:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 212 transitions. [2025-02-05 16:41:20,036 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 212 transitions. Word has length 68 [2025-02-05 16:41:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:20,036 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 212 transitions. [2025-02-05 16:41:20,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 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:41:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions. [2025-02-05 16:41:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:41:20,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:20,037 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:41:20,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:41:20,038 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:41:20,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:20,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1230924831, now seen corresponding path program 1 times [2025-02-05 16:41:20,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:20,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348501465] [2025-02-05 16:41:20,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:20,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:41:20,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:41:20,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:20,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:20,292 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:41:20,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:20,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348501465] [2025-02-05 16:41:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348501465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:20,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:20,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:41:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842297527] [2025-02-05 16:41:20,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:20,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:41:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:20,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:41:20,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:41:20,294 INFO L87 Difference]: Start difference. First operand 172 states and 212 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:41:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:20,640 INFO L93 Difference]: Finished difference Result 308 states and 403 transitions. [2025-02-05 16:41:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:41:20,641 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:41:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:20,642 INFO L225 Difference]: With dead ends: 308 [2025-02-05 16:41:20,642 INFO L226 Difference]: Without dead ends: 233 [2025-02-05 16:41:20,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:41:20,642 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 758 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:20,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1332 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-05 16:41:20,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 138. [2025-02-05 16:41:20,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 136 states have (on average 1.2426470588235294) internal successors, (169), 137 states have internal predecessors, (169), 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:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 169 transitions. [2025-02-05 16:41:20,645 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 169 transitions. Word has length 69 [2025-02-05 16:41:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:20,645 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 169 transitions. [2025-02-05 16:41:20,645 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:41:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2025-02-05 16:41:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:41:20,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:20,645 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] [2025-02-05 16:41:20,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:41:20,646 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:41:20,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash -577634753, now seen corresponding path program 1 times [2025-02-05 16:41:20,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:20,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280439019] [2025-02-05 16:41:20,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:20,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:20,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:41:20,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:41:20,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:20,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:20,857 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:41:20,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:20,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280439019] [2025-02-05 16:41:20,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280439019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:20,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:20,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:41:20,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911090096] [2025-02-05 16:41:20,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:20,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:41:20,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:20,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:41:20,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:41:20,858 INFO L87 Difference]: Start difference. First operand 138 states and 169 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 11 states have internal predecessors, (70), 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:21,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:21,333 INFO L93 Difference]: Finished difference Result 478 states and 647 transitions. [2025-02-05 16:41:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:41:21,333 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 11 states have internal predecessors, (70), 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 70 [2025-02-05 16:41:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:21,334 INFO L225 Difference]: With dead ends: 478 [2025-02-05 16:41:21,334 INFO L226 Difference]: Without dead ends: 404 [2025-02-05 16:41:21,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:41:21,335 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 2482 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2482 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:21,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2482 Valid, 566 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:41:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-05 16:41:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 143. [2025-02-05 16:41:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 142 states have internal predecessors, (174), 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:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2025-02-05 16:41:21,343 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 70 [2025-02-05 16:41:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:21,343 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2025-02-05 16:41:21,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 11 states have internal predecessors, (70), 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:21,343 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2025-02-05 16:41:21,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:41:21,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:21,343 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] [2025-02-05 16:41:21,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:41:21,344 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:41:21,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:21,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1729258898, now seen corresponding path program 1 times [2025-02-05 16:41:21,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:21,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075136909] [2025-02-05 16:41:21,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:21,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:21,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:41:21,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:41:21,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:21,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:21,477 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:41:21,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:21,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075136909] [2025-02-05 16:41:21,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075136909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:21,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:21,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:21,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947863772] [2025-02-05 16:41:21,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:21,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:21,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:21,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:21,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:21,479 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 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:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:21,745 INFO L93 Difference]: Finished difference Result 296 states and 382 transitions. [2025-02-05 16:41:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:21,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 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 71 [2025-02-05 16:41:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:21,746 INFO L225 Difference]: With dead ends: 296 [2025-02-05 16:41:21,746 INFO L226 Difference]: Without dead ends: 222 [2025-02-05 16:41:21,746 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:41:21,746 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 458 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:21,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 670 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:21,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-05 16:41:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 138. [2025-02-05 16:41:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 136 states have (on average 1.2352941176470589) internal successors, (168), 137 states have internal predecessors, (168), 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:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 168 transitions. [2025-02-05 16:41:21,750 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 168 transitions. Word has length 71 [2025-02-05 16:41:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:21,750 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 168 transitions. [2025-02-05 16:41:21,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 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:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 168 transitions. [2025-02-05 16:41:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:41:21,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:21,750 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] [2025-02-05 16:41:21,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:41:21,750 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:41:21,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1016437089, now seen corresponding path program 1 times [2025-02-05 16:41:21,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:21,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112965401] [2025-02-05 16:41:21,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:21,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:21,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:41:21,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:41:21,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:21,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:22,563 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:41:22,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:22,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112965401] [2025-02-05 16:41:22,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112965401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:22,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:22,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-05 16:41:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079245398] [2025-02-05 16:41:22,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:22,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 16:41:22,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:22,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 16:41:22,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:41:22,566 INFO L87 Difference]: Start difference. First operand 138 states and 168 transitions. Second operand has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 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:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:24,067 INFO L93 Difference]: Finished difference Result 466 states and 608 transitions. [2025-02-05 16:41:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 16:41:24,067 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 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 72 [2025-02-05 16:41:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:24,068 INFO L225 Difference]: With dead ends: 466 [2025-02-05 16:41:24,068 INFO L226 Difference]: Without dead ends: 460 [2025-02-05 16:41:24,069 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:41:24,069 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1029 mSDsluCounter, 3818 mSDsCounter, 0 mSdLazyCounter, 1999 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 4202 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:24,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 4202 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1999 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:41:24,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-02-05 16:41:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 157. [2025-02-05 16:41:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.232258064516129) internal successors, (191), 156 states have internal predecessors, (191), 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:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2025-02-05 16:41:24,072 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 72 [2025-02-05 16:41:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:24,072 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2025-02-05 16:41:24,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 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:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2025-02-05 16:41:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:41:24,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:24,073 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] [2025-02-05 16:41:24,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:41:24,073 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:41:24,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:24,073 INFO L85 PathProgramCache]: Analyzing trace with hash -283716095, now seen corresponding path program 1 times [2025-02-05 16:41:24,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:24,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368207486] [2025-02-05 16:41:24,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:24,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:41:24,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:41:24,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:24,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:24,517 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:41:24,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:24,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368207486] [2025-02-05 16:41:24,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368207486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:24,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:24,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:41:24,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361215025] [2025-02-05 16:41:24,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:24,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:41:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:24,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:41:24,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:41:24,519 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:24,858 INFO L93 Difference]: Finished difference Result 226 states and 288 transitions. [2025-02-05 16:41:24,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:41:24,858 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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 73 [2025-02-05 16:41:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:24,859 INFO L225 Difference]: With dead ends: 226 [2025-02-05 16:41:24,859 INFO L226 Difference]: Without dead ends: 220 [2025-02-05 16:41:24,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:41:24,860 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 657 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:24,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 988 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-05 16:41:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 132. [2025-02-05 16:41:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.2366412213740459) internal successors, (162), 131 states have internal predecessors, (162), 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:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2025-02-05 16:41:24,866 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 73 [2025-02-05 16:41:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:24,866 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2025-02-05 16:41:24,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2025-02-05 16:41:24,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:41:24,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:24,867 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:41:24,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:41:24,867 INFO L396 AbstractCegarLoop]: === Iteration 29 === 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:24,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:24,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1011847137, now seen corresponding path program 1 times [2025-02-05 16:41:24,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:24,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593405615] [2025-02-05 16:41:24,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:24,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:24,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:41:24,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:41:24,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:24,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:24,950 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:41:24,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:24,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593405615] [2025-02-05 16:41:24,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593405615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:24,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:24,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:41:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593994067] [2025-02-05 16:41:24,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:24,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:41:24,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:24,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:41:24,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:41:24,952 INFO L87 Difference]: Start difference. First operand 132 states and 162 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 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:41:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:25,118 INFO L93 Difference]: Finished difference Result 564 states and 794 transitions. [2025-02-05 16:41:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:41:25,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 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:41:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:25,120 INFO L225 Difference]: With dead ends: 564 [2025-02-05 16:41:25,120 INFO L226 Difference]: Without dead ends: 510 [2025-02-05 16:41:25,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:41:25,125 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 769 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:25,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1328 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-02-05 16:41:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 184. [2025-02-05 16:41:25,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.3005464480874316) internal successors, (238), 183 states have internal predecessors, (238), 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:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 238 transitions. [2025-02-05 16:41:25,131 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 238 transitions. Word has length 96 [2025-02-05 16:41:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:25,131 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 238 transitions. [2025-02-05 16:41:25,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 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:41:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 238 transitions. [2025-02-05 16:41:25,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:41:25,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:25,132 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:41:25,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:41:25,132 INFO L396 AbstractCegarLoop]: === Iteration 30 === 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:25,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:25,132 INFO L85 PathProgramCache]: Analyzing trace with hash 738882141, now seen corresponding path program 1 times [2025-02-05 16:41:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:25,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893914004] [2025-02-05 16:41:25,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:25,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:41:25,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:41:25,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:25,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:25,243 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:41:25,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:25,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893914004] [2025-02-05 16:41:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893914004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:25,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:25,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:41:25,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912220082] [2025-02-05 16:41:25,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:25,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:41:25,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:25,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:41:25,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:41:25,245 INFO L87 Difference]: Start difference. First operand 184 states and 238 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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:41:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:25,366 INFO L93 Difference]: Finished difference Result 662 states and 935 transitions. [2025-02-05 16:41:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:41:25,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:41:25,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:25,368 INFO L225 Difference]: With dead ends: 662 [2025-02-05 16:41:25,368 INFO L226 Difference]: Without dead ends: 556 [2025-02-05 16:41:25,369 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:41:25,369 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 572 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:25,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 855 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-02-05 16:41:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 288. [2025-02-05 16:41:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.362369337979094) internal successors, (391), 287 states have internal predecessors, (391), 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:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 391 transitions. [2025-02-05 16:41:25,377 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 391 transitions. Word has length 98 [2025-02-05 16:41:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:25,378 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 391 transitions. [2025-02-05 16:41:25,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 391 transitions. [2025-02-05 16:41:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:41:25,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:25,378 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:41:25,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:41:25,379 INFO L396 AbstractCegarLoop]: === Iteration 31 === 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:25,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:25,379 INFO L85 PathProgramCache]: Analyzing trace with hash 148308445, now seen corresponding path program 1 times [2025-02-05 16:41:25,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:25,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568212074] [2025-02-05 16:41:25,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:25,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:25,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:41:25,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:41:25,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:25,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:25,489 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:41:25,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:25,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568212074] [2025-02-05 16:41:25,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568212074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:25,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:25,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:41:25,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029695655] [2025-02-05 16:41:25,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:25,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:41:25,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:25,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:41:25,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:41:25,491 INFO L87 Difference]: Start difference. First operand 288 states and 391 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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:41:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:25,631 INFO L93 Difference]: Finished difference Result 766 states and 1088 transitions. [2025-02-05 16:41:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:41:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:41:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:25,633 INFO L225 Difference]: With dead ends: 766 [2025-02-05 16:41:25,633 INFO L226 Difference]: Without dead ends: 660 [2025-02-05 16:41:25,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:25,634 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 572 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:25,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 799 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-02-05 16:41:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 444. [2025-02-05 16:41:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.399548532731377) internal successors, (620), 443 states have internal predecessors, (620), 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:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 620 transitions. [2025-02-05 16:41:25,640 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 620 transitions. Word has length 98 [2025-02-05 16:41:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:25,640 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 620 transitions. [2025-02-05 16:41:25,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 620 transitions. [2025-02-05 16:41:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:41:25,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:25,642 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:41:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:41:25,642 INFO L396 AbstractCegarLoop]: === Iteration 32 === 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:25,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:25,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1355862365, now seen corresponding path program 1 times [2025-02-05 16:41:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720444119] [2025-02-05 16:41:25,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:25,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:41:25,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:41:25,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:25,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:25,755 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:41:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720444119] [2025-02-05 16:41:25,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720444119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:25,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:25,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:41:25,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047915003] [2025-02-05 16:41:25,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:25,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:41:25,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:25,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:41:25,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:41:25,757 INFO L87 Difference]: Start difference. First operand 444 states and 620 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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:41:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:25,857 INFO L93 Difference]: Finished difference Result 870 states and 1241 transitions. [2025-02-05 16:41:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:41:25,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:41:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:25,859 INFO L225 Difference]: With dead ends: 870 [2025-02-05 16:41:25,859 INFO L226 Difference]: Without dead ends: 764 [2025-02-05 16:41:25,862 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:41:25,862 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 611 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:25,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 769 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-02-05 16:41:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 548. [2025-02-05 16:41:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.413162705667276) internal successors, (773), 547 states have internal predecessors, (773), 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:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 773 transitions. [2025-02-05 16:41:25,876 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 773 transitions. Word has length 98 [2025-02-05 16:41:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:25,876 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 773 transitions. [2025-02-05 16:41:25,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 773 transitions. [2025-02-05 16:41:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:41:25,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:25,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, 1, 1, 1, 1, 1, 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:25,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:41:25,877 INFO L396 AbstractCegarLoop]: === Iteration 33 === 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:25,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:25,877 INFO L85 PathProgramCache]: Analyzing trace with hash -783324963, now seen corresponding path program 1 times [2025-02-05 16:41:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844075727] [2025-02-05 16:41:25,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:25,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:41:25,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:41:25,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:25,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:25,964 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:41:25,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:25,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844075727] [2025-02-05 16:41:25,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844075727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:25,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:25,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:41:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994583426] [2025-02-05 16:41:25,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:25,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:41:25,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:25,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:41:25,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:41:25,965 INFO L87 Difference]: Start difference. First operand 548 states and 773 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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:41:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:26,070 INFO L93 Difference]: Finished difference Result 974 states and 1394 transitions. [2025-02-05 16:41:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:41:26,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:41:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:26,073 INFO L225 Difference]: With dead ends: 974 [2025-02-05 16:41:26,073 INFO L226 Difference]: Without dead ends: 868 [2025-02-05 16:41:26,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:26,073 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 591 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:26,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 800 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:41:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-02-05 16:41:26,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 652. [2025-02-05 16:41:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 1.422427035330261) internal successors, (926), 651 states have internal predecessors, (926), 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:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 926 transitions. [2025-02-05 16:41:26,081 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 926 transitions. Word has length 98 [2025-02-05 16:41:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:26,081 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 926 transitions. [2025-02-05 16:41:26,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 926 transitions. [2025-02-05 16:41:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:41:26,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:26,082 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:41:26,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:41:26,082 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:41:26,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:26,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1766640761, now seen corresponding path program 1 times [2025-02-05 16:41:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746214689] [2025-02-05 16:41:26,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:26,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:26,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:41:26,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:41:26,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:26,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:26,118 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:41:26,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:26,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746214689] [2025-02-05 16:41:26,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746214689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:26,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:26,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:41:26,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536454327] [2025-02-05 16:41:26,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:26,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:41:26,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:26,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:41:26,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:41:26,121 INFO L87 Difference]: Start difference. First operand 652 states and 926 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:41:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:26,138 INFO L93 Difference]: Finished difference Result 1729 states and 2487 transitions. [2025-02-05 16:41:26,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:41:26,139 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:41:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:26,141 INFO L225 Difference]: With dead ends: 1729 [2025-02-05 16:41:26,141 INFO L226 Difference]: Without dead ends: 1155 [2025-02-05 16:41:26,142 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:41:26,142 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 66 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:26,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 371 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:26,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-02-05 16:41:26,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1153. [2025-02-05 16:41:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.4071180555555556) internal successors, (1621), 1152 states have internal predecessors, (1621), 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:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1621 transitions. [2025-02-05 16:41:26,154 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1621 transitions. Word has length 98 [2025-02-05 16:41:26,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:26,155 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1621 transitions. [2025-02-05 16:41:26,156 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:41:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1621 transitions. [2025-02-05 16:41:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:41:26,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:26,156 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:41:26,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:41:26,156 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:41:26,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:26,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1801734559, now seen corresponding path program 1 times [2025-02-05 16:41:26,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:26,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859566718] [2025-02-05 16:41:26,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:26,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:26,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:41:26,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:41:26,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:26,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:26,283 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:41:26,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859566718] [2025-02-05 16:41:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859566718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:26,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:26,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:41:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129337772] [2025-02-05 16:41:26,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:26,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:41:26,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:26,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:41:26,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:41:26,285 INFO L87 Difference]: Start difference. First operand 1153 states and 1621 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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:41:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:26,354 INFO L93 Difference]: Finished difference Result 2230 states and 3160 transitions. [2025-02-05 16:41:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:41:26,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:41:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:26,357 INFO L225 Difference]: With dead ends: 2230 [2025-02-05 16:41:26,357 INFO L226 Difference]: Without dead ends: 1155 [2025-02-05 16:41:26,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:41:26,358 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 136 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:26,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 380 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-02-05 16:41:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1153. [2025-02-05 16:41:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.4019097222222223) internal successors, (1615), 1152 states have internal predecessors, (1615), 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:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1615 transitions. [2025-02-05 16:41:26,370 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1615 transitions. Word has length 98 [2025-02-05 16:41:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:26,370 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1615 transitions. [2025-02-05 16:41:26,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1615 transitions. [2025-02-05 16:41:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:41:26,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:26,371 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, 1] [2025-02-05 16:41:26,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:41:26,371 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:41:26,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:26,372 INFO L85 PathProgramCache]: Analyzing trace with hash -956278138, now seen corresponding path program 1 times [2025-02-05 16:41:26,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:26,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049147709] [2025-02-05 16:41:26,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:26,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:26,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:41:26,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:41:26,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:26,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:26,437 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:41:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:26,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049147709] [2025-02-05 16:41:26,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049147709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:26,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:41:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077582550] [2025-02-05 16:41:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:26,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:41:26,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:26,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:41:26,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:41:26,438 INFO L87 Difference]: Start difference. First operand 1153 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:26,456 INFO L93 Difference]: Finished difference Result 2885 states and 4062 transitions. [2025-02-05 16:41:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:41:26,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 99 [2025-02-05 16:41:26,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:26,460 INFO L225 Difference]: With dead ends: 2885 [2025-02-05 16:41:26,460 INFO L226 Difference]: Without dead ends: 1810 [2025-02-05 16:41:26,461 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:41:26,461 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 77 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 343 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:41:26,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 343 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-02-05 16:41:26,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1720. [2025-02-05 16:41:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1719 states have (on average 1.3944153577661431) internal successors, (2397), 1719 states have internal predecessors, (2397), 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:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2397 transitions. [2025-02-05 16:41:26,492 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2397 transitions. Word has length 99 [2025-02-05 16:41:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:26,492 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2397 transitions. [2025-02-05 16:41:26,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2397 transitions. [2025-02-05 16:41:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:41:26,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:26,493 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, 1, 1] [2025-02-05 16:41:26,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:41:26,493 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:41:26,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:26,493 INFO L85 PathProgramCache]: Analyzing trace with hash 545288379, now seen corresponding path program 1 times [2025-02-05 16:41:26,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:26,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172266491] [2025-02-05 16:41:26,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:26,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:26,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:41:26,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:41:26,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:26,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:26,533 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:41:26,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:26,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172266491] [2025-02-05 16:41:26,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172266491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:26,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:26,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:41:26,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870456824] [2025-02-05 16:41:26,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:26,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:41:26,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:26,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:41:26,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:41:26,535 INFO L87 Difference]: Start difference. First operand 1720 states and 2397 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:26,555 INFO L93 Difference]: Finished difference Result 3416 states and 4785 transitions. [2025-02-05 16:41:26,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:41:26,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 100 [2025-02-05 16:41:26,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:26,559 INFO L225 Difference]: With dead ends: 3416 [2025-02-05 16:41:26,559 INFO L226 Difference]: Without dead ends: 1774 [2025-02-05 16:41:26,561 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:41:26,561 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 88 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:26,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 260 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-02-05 16:41:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1772. [2025-02-05 16:41:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1771 states have (on average 1.3817052512704686) internal successors, (2447), 1771 states have internal predecessors, (2447), 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:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2447 transitions. [2025-02-05 16:41:26,577 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2447 transitions. Word has length 100 [2025-02-05 16:41:26,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:26,577 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2447 transitions. [2025-02-05 16:41:26,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2447 transitions. [2025-02-05 16:41:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:41:26,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:26,578 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, 1, 1] [2025-02-05 16:41:26,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:41:26,578 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:41:26,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1514985429, now seen corresponding path program 1 times [2025-02-05 16:41:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:26,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257370218] [2025-02-05 16:41:26,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:26,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:26,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:41:26,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:41:26,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:26,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:26,637 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:41:26,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:26,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257370218] [2025-02-05 16:41:26,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257370218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:26,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:26,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:41:26,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821475477] [2025-02-05 16:41:26,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:26,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:41:26,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:26,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:41:26,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:41:26,639 INFO L87 Difference]: Start difference. First operand 1772 states and 2447 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:26,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:26,657 INFO L93 Difference]: Finished difference Result 5024 states and 6937 transitions. [2025-02-05 16:41:26,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:41:26,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 100 [2025-02-05 16:41:26,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:26,664 INFO L225 Difference]: With dead ends: 5024 [2025-02-05 16:41:26,665 INFO L226 Difference]: Without dead ends: 3330 [2025-02-05 16:41:26,666 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:41:26,668 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 70 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 340 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:41:26,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 340 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2025-02-05 16:41:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 3192. [2025-02-05 16:41:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3192 states, 3191 states have (on average 1.3688498903165152) internal successors, (4368), 3191 states have internal predecessors, (4368), 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:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 3192 states and 4368 transitions. [2025-02-05 16:41:26,697 INFO L78 Accepts]: Start accepts. Automaton has 3192 states and 4368 transitions. Word has length 100 [2025-02-05 16:41:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:26,698 INFO L471 AbstractCegarLoop]: Abstraction has 3192 states and 4368 transitions. [2025-02-05 16:41:26,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3192 states and 4368 transitions. [2025-02-05 16:41:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 16:41:26,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:26,698 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, 1, 1, 1] [2025-02-05 16:41:26,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:41:26,699 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:41:26,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1819612876, now seen corresponding path program 1 times [2025-02-05 16:41:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:26,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254822639] [2025-02-05 16:41:26,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:26,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 16:41:26,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 16:41:26,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:26,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:26,779 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:41:26,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:26,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254822639] [2025-02-05 16:41:26,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254822639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:26,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:26,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:41:26,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700818574] [2025-02-05 16:41:26,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:26,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:41:26,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:26,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:41:26,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:41:26,782 INFO L87 Difference]: Start difference. First operand 3192 states and 4368 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:26,808 INFO L93 Difference]: Finished difference Result 9148 states and 12462 transitions. [2025-02-05 16:41:26,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:41:26,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 101 [2025-02-05 16:41:26,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:26,829 INFO L225 Difference]: With dead ends: 9148 [2025-02-05 16:41:26,829 INFO L226 Difference]: Without dead ends: 6034 [2025-02-05 16:41:26,835 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:41:26,836 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 63 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 340 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:41:26,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 340 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2025-02-05 16:41:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 5760. [2025-02-05 16:41:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5760 states, 5759 states have (on average 1.348845285639868) internal successors, (7768), 5759 states have internal predecessors, (7768), 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:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5760 states to 5760 states and 7768 transitions. [2025-02-05 16:41:26,919 INFO L78 Accepts]: Start accepts. Automaton has 5760 states and 7768 transitions. Word has length 101 [2025-02-05 16:41:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:26,919 INFO L471 AbstractCegarLoop]: Abstraction has 5760 states and 7768 transitions. [2025-02-05 16:41:26,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 5760 states and 7768 transitions. [2025-02-05 16:41:26,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 16:41:26,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:26,920 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, 1, 1, 1, 1] [2025-02-05 16:41:26,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:41:26,920 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:41:26,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:26,920 INFO L85 PathProgramCache]: Analyzing trace with hash 801073985, now seen corresponding path program 1 times [2025-02-05 16:41:26,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:26,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670848909] [2025-02-05 16:41:26,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:26,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:26,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:41:26,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:41:26,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:26,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:26,995 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:41:26,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:26,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670848909] [2025-02-05 16:41:26,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670848909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:26,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:26,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:41:26,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133160192] [2025-02-05 16:41:26,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:26,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:41:26,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:26,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:41:26,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:41:26,999 INFO L87 Difference]: Start difference. First operand 5760 states and 7768 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:27,028 INFO L93 Difference]: Finished difference Result 16580 states and 22186 transitions. [2025-02-05 16:41:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:41:27,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 102 [2025-02-05 16:41:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:27,041 INFO L225 Difference]: With dead ends: 16580 [2025-02-05 16:41:27,041 INFO L226 Difference]: Without dead ends: 10898 [2025-02-05 16:41:27,046 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:41:27,046 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 53 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 340 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:41:27,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 340 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10898 states. [2025-02-05 16:41:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10898 to 10352. [2025-02-05 16:41:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10352 states, 10351 states have (on average 1.3219978746014878) internal successors, (13684), 10351 states have internal predecessors, (13684), 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:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10352 states to 10352 states and 13684 transitions. [2025-02-05 16:41:27,146 INFO L78 Accepts]: Start accepts. Automaton has 10352 states and 13684 transitions. Word has length 102 [2025-02-05 16:41:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:27,146 INFO L471 AbstractCegarLoop]: Abstraction has 10352 states and 13684 transitions. [2025-02-05 16:41:27,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 10352 states and 13684 transitions. [2025-02-05 16:41:27,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:41:27,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:27,147 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, 1, 1, 1, 1, 1] [2025-02-05 16:41:27,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:41:27,147 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:41:27,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1516980647, now seen corresponding path program 1 times [2025-02-05 16:41:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961350626] [2025-02-05 16:41:27,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:27,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:41:27,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:41:27,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:27,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:27,319 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:41:27,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:27,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961350626] [2025-02-05 16:41:27,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961350626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:27,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:27,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:41:27,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448769094] [2025-02-05 16:41:27,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:27,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:41:27,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:27,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:41:27,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:41:27,320 INFO L87 Difference]: Start difference. First operand 10352 states and 13684 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:27,354 INFO L93 Difference]: Finished difference Result 10594 states and 14005 transitions. [2025-02-05 16:41:27,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:41:27,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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 103 [2025-02-05 16:41:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:27,369 INFO L225 Difference]: With dead ends: 10594 [2025-02-05 16:41:27,370 INFO L226 Difference]: Without dead ends: 10592 [2025-02-05 16:41:27,372 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:41:27,373 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:27,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 773 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10592 states. [2025-02-05 16:41:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10592 to 10592. [2025-02-05 16:41:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10592 states, 10591 states have (on average 1.3056368614861675) internal successors, (13828), 10591 states have internal predecessors, (13828), 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:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10592 states to 10592 states and 13828 transitions. [2025-02-05 16:41:27,459 INFO L78 Accepts]: Start accepts. Automaton has 10592 states and 13828 transitions. Word has length 103 [2025-02-05 16:41:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:27,459 INFO L471 AbstractCegarLoop]: Abstraction has 10592 states and 13828 transitions. [2025-02-05 16:41:27,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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:27,459 INFO L276 IsEmpty]: Start isEmpty. Operand 10592 states and 13828 transitions. [2025-02-05 16:41:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:41:27,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:27,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:27,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 16:41:27,461 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:41:27,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1052521271, now seen corresponding path program 1 times [2025-02-05 16:41:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:27,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309846455] [2025-02-05 16:41:27,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:27,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:41:27,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:41:27,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:27,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:27,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:27,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309846455] [2025-02-05 16:41:27,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309846455] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:41:27,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116160550] [2025-02-05 16:41:27,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:27,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:27,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:41:27,775 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:41:27,783 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:41:27,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:41:27,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:41:27,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:27,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:27,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:41:27,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:41:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:28,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:41:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116160550] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:41:30,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:41:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2025-02-05 16:41:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531731583] [2025-02-05 16:41:30,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:41:30,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:41:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:30,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:41:30,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:41:30,164 INFO L87 Difference]: Start difference. First operand 10592 states and 13828 transitions. Second operand has 30 states, 30 states have (on average 11.6) internal successors, (348), 29 states have internal predecessors, (348), 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:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:33,518 INFO L93 Difference]: Finished difference Result 99170 states and 129559 transitions. [2025-02-05 16:41:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-02-05 16:41:33,518 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 11.6) internal successors, (348), 29 states have internal predecessors, (348), 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 130 [2025-02-05 16:41:33,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:33,650 INFO L225 Difference]: With dead ends: 99170 [2025-02-05 16:41:33,650 INFO L226 Difference]: Without dead ends: 88656 [2025-02-05 16:41:33,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7124 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3278, Invalid=18478, Unknown=0, NotChecked=0, Total=21756 [2025-02-05 16:41:33,685 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 4143 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 2503 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4143 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:33,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4143 Valid, 2722 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2503 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:41:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88656 states. [2025-02-05 16:41:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88656 to 54997. [2025-02-05 16:41:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54997 states, 54996 states have (on average 1.2963670085097099) internal successors, (71295), 54996 states have internal predecessors, (71295), 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:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54997 states to 54997 states and 71295 transitions. [2025-02-05 16:41:34,662 INFO L78 Accepts]: Start accepts. Automaton has 54997 states and 71295 transitions. Word has length 130 [2025-02-05 16:41:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:34,662 INFO L471 AbstractCegarLoop]: Abstraction has 54997 states and 71295 transitions. [2025-02-05 16:41:34,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.6) internal successors, (348), 29 states have internal predecessors, (348), 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:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 54997 states and 71295 transitions. [2025-02-05 16:41:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 16:41:34,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:34,669 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:34,680 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:34,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:34,871 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:41:34,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:34,871 INFO L85 PathProgramCache]: Analyzing trace with hash -145760853, now seen corresponding path program 1 times [2025-02-05 16:41:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:34,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100778627] [2025-02-05 16:41:34,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:34,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:41:34,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:41:34,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:34,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 16:41:35,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:35,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100778627] [2025-02-05 16:41:35,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100778627] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:41:35,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400507648] [2025-02-05 16:41:35,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:35,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:35,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:41:35,126 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:35,128 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:35,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:41:35,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:41:35,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:35,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:35,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 16:41:35,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:41:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:35,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:41:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400507648] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:41:36,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:41:36,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-02-05 16:41:36,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145028741] [2025-02-05 16:41:36,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:41:36,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 16:41:36,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:36,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 16:41:36,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:41:36,443 INFO L87 Difference]: Start difference. First operand 54997 states and 71295 transitions. Second operand has 20 states, 20 states have (on average 18.0) internal successors, (360), 20 states have internal predecessors, (360), 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:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:38,244 INFO L93 Difference]: Finished difference Result 198413 states and 257606 transitions. [2025-02-05 16:41:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-05 16:41:38,245 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 18.0) internal successors, (360), 20 states have internal predecessors, (360), 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 131 [2025-02-05 16:41:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:38,403 INFO L225 Difference]: With dead ends: 198413 [2025-02-05 16:41:38,403 INFO L226 Difference]: Without dead ends: 143531 [2025-02-05 16:41:38,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=795, Invalid=3627, Unknown=0, NotChecked=0, Total=4422 [2025-02-05 16:41:38,464 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1573 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:38,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 1572 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:41:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143531 states. [2025-02-05 16:41:39,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143531 to 92121. [2025-02-05 16:41:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92121 states, 92120 states have (on average 1.304830655666522) internal successors, (120201), 92120 states have internal predecessors, (120201), 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:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92121 states to 92121 states and 120201 transitions. [2025-02-05 16:41:39,808 INFO L78 Accepts]: Start accepts. Automaton has 92121 states and 120201 transitions. Word has length 131 [2025-02-05 16:41:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:39,808 INFO L471 AbstractCegarLoop]: Abstraction has 92121 states and 120201 transitions. [2025-02-05 16:41:39,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 18.0) internal successors, (360), 20 states have internal predecessors, (360), 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:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 92121 states and 120201 transitions. [2025-02-05 16:41:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 16:41:39,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:39,814 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, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:39,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:41:40,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:40,018 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:41:40,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:40,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1133382518, now seen corresponding path program 1 times [2025-02-05 16:41:40,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:40,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825524123] [2025-02-05 16:41:40,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:40,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:40,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:41:40,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:41:40,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:40,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:40,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:40,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825524123] [2025-02-05 16:41:40,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825524123] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:41:40,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159158541] [2025-02-05 16:41:40,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:40,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:40,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:41:40,736 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:41:40,737 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:40,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:41:40,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:41:40,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:40,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:40,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:41:40,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:41:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:41,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:41:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:42,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159158541] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:41:42,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:41:42,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 30 [2025-02-05 16:41:42,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876536595] [2025-02-05 16:41:42,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:41:42,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:41:42,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:42,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:41:42,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:41:42,115 INFO L87 Difference]: Start difference. First operand 92121 states and 120201 transitions. Second operand has 30 states, 30 states have (on average 11.933333333333334) internal successors, (358), 30 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:42:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:42:02,531 INFO L93 Difference]: Finished difference Result 514403 states and 668752 transitions. [2025-02-05 16:42:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 401 states. [2025-02-05 16:42:02,532 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 11.933333333333334) internal successors, (358), 30 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) Word has length 131 [2025-02-05 16:42:02,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:42:03,133 INFO L225 Difference]: With dead ends: 514403 [2025-02-05 16:42:03,134 INFO L226 Difference]: Without dead ends: 422417 [2025-02-05 16:42:03,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83983 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=19718, Invalid=163894, Unknown=0, NotChecked=0, Total=183612 [2025-02-05 16:42:03,261 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 7079 mSDsluCounter, 3238 mSDsCounter, 0 mSdLazyCounter, 4018 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7079 SdHoareTripleChecker+Valid, 3411 SdHoareTripleChecker+Invalid, 4167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 4018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:42:03,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7079 Valid, 3411 Invalid, 4167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 4018 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 16:42:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422417 states. [2025-02-05 16:42:07,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422417 to 221499. [2025-02-05 16:42:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221499 states, 221498 states have (on average 1.2972893660439373) internal successors, (287347), 221498 states have internal predecessors, (287347), 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:42:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221499 states to 221499 states and 287347 transitions. [2025-02-05 16:42:07,665 INFO L78 Accepts]: Start accepts. Automaton has 221499 states and 287347 transitions. Word has length 131 [2025-02-05 16:42:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:42:07,666 INFO L471 AbstractCegarLoop]: Abstraction has 221499 states and 287347 transitions. [2025-02-05 16:42:07,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.933333333333334) internal successors, (358), 30 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:42:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 221499 states and 287347 transitions. [2025-02-05 16:42:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 16:42:07,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:42:07,678 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:42:07,686 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:42:07,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:42:07,879 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:42:07,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:42:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash 385738324, now seen corresponding path program 1 times [2025-02-05 16:42:07,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:42:07,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479304360] [2025-02-05 16:42:07,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:42:07,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 16:42:07,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 16:42:07,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:07,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:42:08,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479304360] [2025-02-05 16:42:08,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479304360] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:42:08,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594361600] [2025-02-05 16:42:08,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:42:08,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:42:08,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:42:08,413 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:42:08,414 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:42:08,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 16:42:08,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 16:42:08,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:42:08,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:42:08,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 16:42:08,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:42:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:09,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:42:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:42:10,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594361600] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:42:10,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:42:10,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 32 [2025-02-05 16:42:10,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793670268] [2025-02-05 16:42:10,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:42:10,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 16:42:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:42:10,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 16:42:10,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:42:10,132 INFO L87 Difference]: Start difference. First operand 221499 states and 287347 transitions. Second operand has 32 states, 32 states have (on average 11.40625) internal successors, (365), 32 states have internal predecessors, (365), 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)