./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 6fcbb6774587cda7a5d573623a9a47b3e351563c8bea7eebdf86bc25d20b8061 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:25:01,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:25:01,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:25:01,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:25:01,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:25:01,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:25:01,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:25:01,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:25:01,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:25:01,215 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:25:01,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:25:01,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:25:01,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:25:01,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:25:01,216 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:25:01,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:25:01,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:25:01,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:25:01,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:25:01,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:25:01,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:25:01,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:25:01,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:25:01,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:25:01,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:25:01,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:25:01,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:25:01,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:25:01,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:25:01,218 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/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 -> 6fcbb6774587cda7a5d573623a9a47b3e351563c8bea7eebdf86bc25d20b8061 [2025-03-08 06:25:01,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:25:01,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:25:01,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:25:01,457 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:25:01,458 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:25:01,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:25:02,658 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8167c25f/0335a5623539451ca7fa229c3a649c18/FLAGf18ae7665 [2025-03-08 06:25:02,974 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:25:02,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:25:02,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8167c25f/0335a5623539451ca7fa229c3a649c18/FLAGf18ae7665 [2025-03-08 06:25:03,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8167c25f/0335a5623539451ca7fa229c3a649c18 [2025-03-08 06:25:03,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:25:03,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:25:03,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:25:03,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:25:03,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:25:03,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e4d55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03, skipping insertion in model container [2025-03-08 06:25:03,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:25:03,487 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8891,8904] [2025-03-08 06:25:03,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12143,12156] [2025-03-08 06:25:03,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13299,13312] [2025-03-08 06:25:03,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13955,13968] [2025-03-08 06:25:03,524 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15434,15447] [2025-03-08 06:25:03,528 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16090,16103] [2025-03-08 06:25:03,534 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17074,17087] [2025-03-08 06:25:03,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19370,19383] [2025-03-08 06:25:03,547 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20029,20042] [2025-03-08 06:25:03,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21011,21024] [2025-03-08 06:25:03,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22802,22815] [2025-03-08 06:25:03,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:25:03,653 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:25:03,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8891,8904] [2025-03-08 06:25:03,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12143,12156] [2025-03-08 06:25:03,709 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13299,13312] [2025-03-08 06:25:03,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13955,13968] [2025-03-08 06:25:03,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15434,15447] [2025-03-08 06:25:03,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16090,16103] [2025-03-08 06:25:03,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17074,17087] [2025-03-08 06:25:03,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19370,19383] [2025-03-08 06:25:03,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20029,20042] [2025-03-08 06:25:03,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21011,21024] [2025-03-08 06:25:03,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22802,22815] [2025-03-08 06:25:03,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:25:03,773 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:25:03,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03 WrapperNode [2025-03-08 06:25:03,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:25:03,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:25:03,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:25:03,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:25:03,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,834 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1922 [2025-03-08 06:25:03,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:25:03,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:25:03,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:25:03,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:25:03,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,875 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-03-08 06:25:03,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:25:03,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:25:03,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:25:03,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:25:03,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (1/1) ... [2025-03-08 06:25:03,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:25:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:25:03,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:25:03,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:25:03,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:25:03,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:25:03,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:25:03,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:25:04,077 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:25:04,079 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:25:05,074 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-08 06:25:05,075 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1623: havoc main_~check__tmp~15#1; [2025-03-08 06:25:05,076 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1557: havoc main_~node4__m4~8#1; [2025-03-08 06:25:05,076 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2053: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-08 06:25:05,076 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-03-08 06:25:05,076 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1591: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-08 06:25:05,076 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2384: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-08 06:25:05,076 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2418: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1328: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2452: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L338: havoc main_~node4__m4~1#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L768: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2519: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L967: havoc main_~node3__m3~3#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: havoc main_~node4__m4~2#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2__m2~1#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2224: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-08 06:25:05,077 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2258: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-03-08 06:25:05,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:25:05,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2325: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-03-08 06:25:05,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-08 06:25:05,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: havoc main_~node2__m2~2#1; [2025-03-08 06:25:05,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-08 06:25:05,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1997: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-08 06:25:05,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L907: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-08 06:25:05,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1271: havoc main_~node3__m3~4#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1073: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2729: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L550: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2070: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1542: havoc main_~node3__m3~5#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1377: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2401: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2104: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L816: havoc main_~node4__m4~3#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2171: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc main_~node4__m4~4#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L223: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1181: havoc main_~check__tmp~9#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1115: havoc main_~node4__m4~5#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: havoc main_~node3__m3~1#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1149: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2900: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1843: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L390: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3001: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2572: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L425: havoc main_~node3__m3~2#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2673: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-03-08 06:25:05,079 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1286: havoc main_~node4__m4~6#1; [2025-03-08 06:25:05,080 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1485: havoc main_~check__tmp~13#1; [2025-03-08 06:25:05,080 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1419: havoc main_~node4__m4~7#1; [2025-03-08 06:25:05,080 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L858: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-08 06:25:05,080 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1453: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-08 06:25:05,080 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-08 06:25:05,080 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1685: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-03-08 06:25:05,080 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L595: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:25:05,080 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256: havoc main_~node2__m2~3#1; [2025-03-08 06:25:05,135 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2025-03-08 06:25:05,136 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:25:05,152 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:25:05,154 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:25:05,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:25:05 BoogieIcfgContainer [2025-03-08 06:25:05,157 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:25:05,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:25:05,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:25:05,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:25:05,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:25:03" (1/3) ... [2025-03-08 06:25:05,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e8c774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:25:05, skipping insertion in model container [2025-03-08 06:25:05,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:25:03" (2/3) ... [2025-03-08 06:25:05,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e8c774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:25:05, skipping insertion in model container [2025-03-08 06:25:05,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:25:05" (3/3) ... [2025-03-08 06:25:05,163 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:25:05,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:25:05,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 357 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-03-08 06:25:05,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:25:05,241 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;@71d927ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:25:05,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-08 06:25:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 345 states have (on average 1.8376811594202898) internal successors, (634), 356 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 06:25:05,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:05,256 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] [2025-03-08 06:25:05,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:05,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:05,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1636711810, now seen corresponding path program 1 times [2025-03-08 06:25:05,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:05,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510965593] [2025-03-08 06:25:05,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:05,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:05,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 06:25:05,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 06:25:05,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:05,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:05,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:05,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510965593] [2025-03-08 06:25:05,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510965593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:05,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:05,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:25:05,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651270645] [2025-03-08 06:25:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:05,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:25:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:05,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:25:05,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:25:05,768 INFO L87 Difference]: Start difference. First operand has 357 states, 345 states have (on average 1.8376811594202898) internal successors, (634), 356 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:05,989 INFO L93 Difference]: Finished difference Result 569 states and 972 transitions. [2025-03-08 06:25:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:25:05,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-08 06:25:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:05,997 INFO L225 Difference]: With dead ends: 569 [2025-03-08 06:25:05,997 INFO L226 Difference]: Without dead ends: 293 [2025-03-08 06:25:06,000 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-03-08 06:25:06,002 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 1454 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:06,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1454 Valid, 362 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-08 06:25:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-08 06:25:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 282 states have (on average 1.301418439716312) internal successors, (367), 292 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 367 transitions. [2025-03-08 06:25:06,034 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 367 transitions. Word has length 58 [2025-03-08 06:25:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:06,035 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 367 transitions. [2025-03-08 06:25:06,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 367 transitions. [2025-03-08 06:25:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 06:25:06,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:06,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:06,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:25:06,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:06,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:06,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1042698575, now seen corresponding path program 1 times [2025-03-08 06:25:06,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:06,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16135540] [2025-03-08 06:25:06,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:06,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:06,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 06:25:06,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 06:25:06,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:06,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:06,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:06,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16135540] [2025-03-08 06:25:06,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16135540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:06,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:06,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:25:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010444744] [2025-03-08 06:25:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:06,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:25:06,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:06,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:25:06,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:25:06,221 INFO L87 Difference]: Start difference. First operand 293 states and 367 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:06,408 INFO L93 Difference]: Finished difference Result 496 states and 637 transitions. [2025-03-08 06:25:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:25:06,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-08 06:25:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:06,410 INFO L225 Difference]: With dead ends: 496 [2025-03-08 06:25:06,410 INFO L226 Difference]: Without dead ends: 273 [2025-03-08 06:25:06,411 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-03-08 06:25:06,411 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 951 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:06,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 211 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-08 06:25:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-03-08 06:25:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 262 states have (on average 1.3053435114503817) internal successors, (342), 272 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 342 transitions. [2025-03-08 06:25:06,424 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 342 transitions. Word has length 59 [2025-03-08 06:25:06,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:06,424 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 342 transitions. [2025-03-08 06:25:06,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 342 transitions. [2025-03-08 06:25:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 06:25:06,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:06,431 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-03-08 06:25:06,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:25:06,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:06,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1090760522, now seen corresponding path program 1 times [2025-03-08 06:25:06,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:06,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540634934] [2025-03-08 06:25:06,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:06,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:06,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:25:06,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:25:06,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:06,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:06,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:06,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540634934] [2025-03-08 06:25:06,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540634934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:06,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:06,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:25:06,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216529894] [2025-03-08 06:25:06,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:06,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:25:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:06,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:25:06,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:25:06,603 INFO L87 Difference]: Start difference. First operand 273 states and 342 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-03-08 06:25:06,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:06,740 INFO L93 Difference]: Finished difference Result 476 states and 611 transitions. [2025-03-08 06:25:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:25:06,741 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-03-08 06:25:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:06,742 INFO L225 Difference]: With dead ends: 476 [2025-03-08 06:25:06,742 INFO L226 Difference]: Without dead ends: 254 [2025-03-08 06:25:06,742 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-03-08 06:25:06,743 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 911 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:06,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 200 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:06,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-08 06:25:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-03-08 06:25:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 243 states have (on average 1.316872427983539) internal successors, (320), 253 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-03-08 06:25:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 320 transitions. [2025-03-08 06:25:06,754 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 320 transitions. Word has length 60 [2025-03-08 06:25:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:06,755 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 320 transitions. [2025-03-08 06:25:06,755 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-03-08 06:25:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 320 transitions. [2025-03-08 06:25:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 06:25:06,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:06,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:06,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:25:06,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:06,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1934057823, now seen corresponding path program 1 times [2025-03-08 06:25:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:06,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334662338] [2025-03-08 06:25:06,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:06,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:06,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 06:25:06,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 06:25:06,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:06,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:06,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:06,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334662338] [2025-03-08 06:25:06,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334662338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:06,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:06,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:25:06,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867171078] [2025-03-08 06:25:06,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:06,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:25:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:06,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:25:06,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:25:06,877 INFO L87 Difference]: Start difference. First operand 254 states and 320 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:07,020 INFO L93 Difference]: Finished difference Result 457 states and 588 transitions. [2025-03-08 06:25:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:25:07,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-08 06:25:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:07,022 INFO L225 Difference]: With dead ends: 457 [2025-03-08 06:25:07,022 INFO L226 Difference]: Without dead ends: 246 [2025-03-08 06:25:07,022 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-03-08 06:25:07,023 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 868 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:07,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 196 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-08 06:25:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-03-08 06:25:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3191489361702127) internal successors, (310), 245 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 310 transitions. [2025-03-08 06:25:07,033 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 310 transitions. Word has length 61 [2025-03-08 06:25:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:07,033 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 310 transitions. [2025-03-08 06:25:07,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 310 transitions. [2025-03-08 06:25:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:25:07,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:07,034 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-03-08 06:25:07,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:25:07,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:07,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash -313296833, now seen corresponding path program 1 times [2025-03-08 06:25:07,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:07,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663065414] [2025-03-08 06:25:07,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:07,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:07,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:25:07,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:25:07,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:07,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:07,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663065414] [2025-03-08 06:25:07,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663065414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:07,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:07,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:25:07,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919407658] [2025-03-08 06:25:07,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:07,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:25:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:07,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:25:07,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:25:07,379 INFO L87 Difference]: Start difference. First operand 246 states and 310 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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-03-08 06:25:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:07,788 INFO L93 Difference]: Finished difference Result 485 states and 612 transitions. [2025-03-08 06:25:07,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:25:07,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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-03-08 06:25:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:07,792 INFO L225 Difference]: With dead ends: 485 [2025-03-08 06:25:07,792 INFO L226 Difference]: Without dead ends: 352 [2025-03-08 06:25:07,793 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-03-08 06:25:07,794 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1284 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:07,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 764 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-08 06:25:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 246. [2025-03-08 06:25:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.3148936170212766) internal successors, (309), 245 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 309 transitions. [2025-03-08 06:25:07,802 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 309 transitions. Word has length 62 [2025-03-08 06:25:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:07,802 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 309 transitions. [2025-03-08 06:25:07,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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-03-08 06:25:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 309 transitions. [2025-03-08 06:25:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:25:07,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:07,805 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-03-08 06:25:07,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:25:07,805 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-03-08 06:25:07,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:07,805 INFO L85 PathProgramCache]: Analyzing trace with hash -733190650, now seen corresponding path program 1 times [2025-03-08 06:25:07,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:07,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445699771] [2025-03-08 06:25:07,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:07,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:07,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:25:07,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:25:07,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:07,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:08,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:08,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445699771] [2025-03-08 06:25:08,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445699771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:08,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:08,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:25:08,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425662907] [2025-03-08 06:25:08,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:08,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:25:08,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:08,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:25:08,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:25:08,154 INFO L87 Difference]: Start difference. First operand 246 states and 309 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 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-03-08 06:25:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:08,651 INFO L93 Difference]: Finished difference Result 454 states and 587 transitions. [2025-03-08 06:25:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:25:08,651 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 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-03-08 06:25:08,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:08,652 INFO L225 Difference]: With dead ends: 454 [2025-03-08 06:25:08,652 INFO L226 Difference]: Without dead ends: 383 [2025-03-08 06:25:08,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:25:08,653 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 2051 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:08,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2051 Valid, 934 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-08 06:25:08,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 249. [2025-03-08 06:25:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 238 states have (on average 1.3109243697478992) internal successors, (312), 248 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:08,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 312 transitions. [2025-03-08 06:25:08,662 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 312 transitions. Word has length 62 [2025-03-08 06:25:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:08,663 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 312 transitions. [2025-03-08 06:25:08,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 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-03-08 06:25:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 312 transitions. [2025-03-08 06:25:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:25:08,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:08,664 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-03-08 06:25:08,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:25:08,664 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:08,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:08,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1327760392, now seen corresponding path program 1 times [2025-03-08 06:25:08,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:08,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774201562] [2025-03-08 06:25:08,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:08,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:25:08,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:25:08,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:08,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:08,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:08,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774201562] [2025-03-08 06:25:08,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774201562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:08,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:08,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:25:08,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940839613] [2025-03-08 06:25:08,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:08,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:25:08,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:08,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:25:08,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:25:08,986 INFO L87 Difference]: Start difference. First operand 249 states and 312 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 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-03-08 06:25:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:09,482 INFO L93 Difference]: Finished difference Result 444 states and 569 transitions. [2025-03-08 06:25:09,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:25:09,482 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 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-03-08 06:25:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:09,484 INFO L225 Difference]: With dead ends: 444 [2025-03-08 06:25:09,484 INFO L226 Difference]: Without dead ends: 385 [2025-03-08 06:25:09,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:25:09,486 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 1565 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:09,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 968 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-08 06:25:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 253. [2025-03-08 06:25:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 242 states have (on average 1.3140495867768596) internal successors, (318), 252 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 318 transitions. [2025-03-08 06:25:09,494 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 318 transitions. Word has length 62 [2025-03-08 06:25:09,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:09,495 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 318 transitions. [2025-03-08 06:25:09,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 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-03-08 06:25:09,495 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 318 transitions. [2025-03-08 06:25:09,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 06:25:09,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:09,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:09,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:25:09,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:09,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:09,498 INFO L85 PathProgramCache]: Analyzing trace with hash -506769422, now seen corresponding path program 1 times [2025-03-08 06:25:09,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:09,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873070476] [2025-03-08 06:25:09,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:09,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:09,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 06:25:09,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 06:25:09,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:09,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:09,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:09,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873070476] [2025-03-08 06:25:09,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873070476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:09,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:09,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:25:09,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008644138] [2025-03-08 06:25:09,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:09,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:25:09,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:09,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:25:09,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:25:09,751 INFO L87 Difference]: Start difference. First operand 253 states and 318 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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-03-08 06:25:10,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:10,174 INFO L93 Difference]: Finished difference Result 451 states and 585 transitions. [2025-03-08 06:25:10,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:25:10,175 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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-03-08 06:25:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:10,176 INFO L225 Difference]: With dead ends: 451 [2025-03-08 06:25:10,176 INFO L226 Difference]: Without dead ends: 385 [2025-03-08 06:25:10,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:25:10,178 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1414 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:10,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 992 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:10,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-08 06:25:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 253. [2025-03-08 06:25:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 242 states have (on average 1.3099173553719008) internal successors, (317), 252 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 317 transitions. [2025-03-08 06:25:10,187 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 317 transitions. Word has length 62 [2025-03-08 06:25:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:10,187 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 317 transitions. [2025-03-08 06:25:10,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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-03-08 06:25:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 317 transitions. [2025-03-08 06:25:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:25:10,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:10,188 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-03-08 06:25:10,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:25:10,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:10,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:10,188 INFO L85 PathProgramCache]: Analyzing trace with hash 990894559, now seen corresponding path program 1 times [2025-03-08 06:25:10,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:10,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449521901] [2025-03-08 06:25:10,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:10,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:25:10,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:25:10,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:10,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:10,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:10,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449521901] [2025-03-08 06:25:10,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449521901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:10,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:10,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 06:25:10,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958878130] [2025-03-08 06:25:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:10,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:25:10,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:10,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:25:10,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:25:10,546 INFO L87 Difference]: Start difference. First operand 253 states and 317 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 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-03-08 06:25:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:11,218 INFO L93 Difference]: Finished difference Result 537 states and 700 transitions. [2025-03-08 06:25:11,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:25:11,218 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 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-03-08 06:25:11,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:11,219 INFO L225 Difference]: With dead ends: 537 [2025-03-08 06:25:11,219 INFO L226 Difference]: Without dead ends: 443 [2025-03-08 06:25:11,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:25:11,223 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1266 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:11,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 1304 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:25:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-08 06:25:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 253. [2025-03-08 06:25:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 242 states have (on average 1.3057851239669422) internal successors, (316), 252 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 316 transitions. [2025-03-08 06:25:11,231 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 316 transitions. Word has length 64 [2025-03-08 06:25:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:11,231 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 316 transitions. [2025-03-08 06:25:11,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 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-03-08 06:25:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 316 transitions. [2025-03-08 06:25:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:25:11,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:11,232 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-03-08 06:25:11,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:25:11,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:11,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1621076992, now seen corresponding path program 1 times [2025-03-08 06:25:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:11,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089950189] [2025-03-08 06:25:11,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:11,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:11,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:25:11,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:25:11,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:11,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:11,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:11,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089950189] [2025-03-08 06:25:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089950189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:11,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:11,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:25:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610964083] [2025-03-08 06:25:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:11,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:25:11,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:11,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:25:11,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:25:11,451 INFO L87 Difference]: Start difference. First operand 253 states and 316 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-03-08 06:25:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:11,905 INFO L93 Difference]: Finished difference Result 402 states and 507 transitions. [2025-03-08 06:25:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:25:11,906 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-03-08 06:25:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:11,907 INFO L225 Difference]: With dead ends: 402 [2025-03-08 06:25:11,907 INFO L226 Difference]: Without dead ends: 385 [2025-03-08 06:25:11,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:25:11,908 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1356 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:11,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 1116 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:25:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-08 06:25:11,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 253. [2025-03-08 06:25:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 252 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-03-08 06:25:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 315 transitions. [2025-03-08 06:25:11,917 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 315 transitions. Word has length 64 [2025-03-08 06:25:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:11,917 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 315 transitions. [2025-03-08 06:25:11,917 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-03-08 06:25:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 315 transitions. [2025-03-08 06:25:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:25:11,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:11,918 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-03-08 06:25:11,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:25:11,918 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-03-08 06:25:11,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:11,918 INFO L85 PathProgramCache]: Analyzing trace with hash -612939262, now seen corresponding path program 1 times [2025-03-08 06:25:11,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:11,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890527572] [2025-03-08 06:25:11,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:11,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:11,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:25:11,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:25:11,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:11,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:12,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:12,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890527572] [2025-03-08 06:25:12,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890527572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:12,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:12,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:25:12,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795710061] [2025-03-08 06:25:12,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:12,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:25:12,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:12,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:25:12,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:25:12,106 INFO L87 Difference]: Start difference. First operand 253 states and 315 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-03-08 06:25:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:12,572 INFO L93 Difference]: Finished difference Result 382 states and 476 transitions. [2025-03-08 06:25:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:25:12,573 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-03-08 06:25:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:12,574 INFO L225 Difference]: With dead ends: 382 [2025-03-08 06:25:12,574 INFO L226 Difference]: Without dead ends: 377 [2025-03-08 06:25:12,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:25:12,575 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 1362 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:12,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 1004 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:25:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-08 06:25:12,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 253. [2025-03-08 06:25:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 242 states have (on average 1.2975206611570247) internal successors, (314), 252 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 314 transitions. [2025-03-08 06:25:12,583 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 314 transitions. Word has length 64 [2025-03-08 06:25:12,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:12,583 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 314 transitions. [2025-03-08 06:25:12,583 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-03-08 06:25:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 314 transitions. [2025-03-08 06:25:12,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:25:12,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:12,584 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-03-08 06:25:12,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:25:12,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:12,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1056410118, now seen corresponding path program 1 times [2025-03-08 06:25:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:12,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541373854] [2025-03-08 06:25:12,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:12,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:25:12,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:25:12,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:12,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541373854] [2025-03-08 06:25:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541373854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:12,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:25:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793991301] [2025-03-08 06:25:12,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:12,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:25:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:12,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:25:12,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:25:12,803 INFO L87 Difference]: Start difference. First operand 253 states and 314 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-03-08 06:25:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:13,299 INFO L93 Difference]: Finished difference Result 470 states and 600 transitions. [2025-03-08 06:25:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:25:13,299 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-03-08 06:25:13,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:13,300 INFO L225 Difference]: With dead ends: 470 [2025-03-08 06:25:13,300 INFO L226 Difference]: Without dead ends: 382 [2025-03-08 06:25:13,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:25:13,301 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 1309 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:13,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 1236 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:25:13,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-08 06:25:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 246. [2025-03-08 06:25:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2936170212765958) internal successors, (304), 245 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 304 transitions. [2025-03-08 06:25:13,308 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 304 transitions. Word has length 64 [2025-03-08 06:25:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:13,308 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 304 transitions. [2025-03-08 06:25:13,308 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-03-08 06:25:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 304 transitions. [2025-03-08 06:25:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:25:13,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:13,311 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-03-08 06:25:13,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:25:13,312 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:13,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:13,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2071658386, now seen corresponding path program 1 times [2025-03-08 06:25:13,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:13,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254894783] [2025-03-08 06:25:13,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:13,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:13,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:25:13,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:25:13,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:13,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:13,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:13,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254894783] [2025-03-08 06:25:13,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254894783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:13,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:13,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:25:13,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235475947] [2025-03-08 06:25:13,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:13,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:25:13,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:13,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:25:13,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:25:13,467 INFO L87 Difference]: Start difference. First operand 246 states and 304 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-03-08 06:25:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:13,895 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2025-03-08 06:25:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:25:13,898 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-03-08 06:25:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:13,900 INFO L225 Difference]: With dead ends: 375 [2025-03-08 06:25:13,900 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 06:25:13,900 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-03-08 06:25:13,900 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 931 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:13,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 815 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 06:25:13,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 246. [2025-03-08 06:25:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2893617021276595) internal successors, (303), 245 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 303 transitions. [2025-03-08 06:25:13,906 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 303 transitions. Word has length 64 [2025-03-08 06:25:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:13,907 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 303 transitions. [2025-03-08 06:25:13,907 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-03-08 06:25:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 303 transitions. [2025-03-08 06:25:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:25:13,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:13,908 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-03-08 06:25:13,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:25:13,908 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-03-08 06:25:13,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:13,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1845369059, now seen corresponding path program 1 times [2025-03-08 06:25:13,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:13,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228758227] [2025-03-08 06:25:13,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:13,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:13,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:25:13,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:25:13,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:13,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:14,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:14,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228758227] [2025-03-08 06:25:14,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228758227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:14,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:25:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800986373] [2025-03-08 06:25:14,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:14,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:25:14,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:14,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:25:14,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:25:14,097 INFO L87 Difference]: Start difference. First operand 246 states and 303 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-03-08 06:25:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:14,486 INFO L93 Difference]: Finished difference Result 426 states and 541 transitions. [2025-03-08 06:25:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:25:14,486 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-03-08 06:25:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:14,488 INFO L225 Difference]: With dead ends: 426 [2025-03-08 06:25:14,488 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 06:25:14,488 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-03-08 06:25:14,488 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1601 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 830 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-03-08 06:25:14,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 830 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 06:25:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 246. [2025-03-08 06:25:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2851063829787235) internal successors, (302), 245 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 302 transitions. [2025-03-08 06:25:14,494 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 302 transitions. Word has length 64 [2025-03-08 06:25:14,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:14,494 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 302 transitions. [2025-03-08 06:25:14,494 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-03-08 06:25:14,494 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 302 transitions. [2025-03-08 06:25:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:25:14,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:14,495 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-03-08 06:25:14,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:25:14,495 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:14,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:14,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1450346746, now seen corresponding path program 1 times [2025-03-08 06:25:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:14,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512797732] [2025-03-08 06:25:14,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:14,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:25:14,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:25:14,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:14,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:14,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:14,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512797732] [2025-03-08 06:25:14,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512797732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:14,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:14,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:25:14,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721582624] [2025-03-08 06:25:14,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:14,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:25:14,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:14,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:25:14,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:25:14,640 INFO L87 Difference]: Start difference. First operand 246 states and 302 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-03-08 06:25:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:15,066 INFO L93 Difference]: Finished difference Result 449 states and 574 transitions. [2025-03-08 06:25:15,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:25:15,066 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-03-08 06:25:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:15,067 INFO L225 Difference]: With dead ends: 449 [2025-03-08 06:25:15,067 INFO L226 Difference]: Without dead ends: 378 [2025-03-08 06:25:15,068 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-03-08 06:25:15,068 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 1121 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:15,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 1112 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-08 06:25:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 246. [2025-03-08 06:25:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2808510638297872) internal successors, (301), 245 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 301 transitions. [2025-03-08 06:25:15,074 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 301 transitions. Word has length 64 [2025-03-08 06:25:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:15,074 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 301 transitions. [2025-03-08 06:25:15,074 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-03-08 06:25:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 301 transitions. [2025-03-08 06:25:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:25:15,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:15,075 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-03-08 06:25:15,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:25:15,075 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:15,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:15,075 INFO L85 PathProgramCache]: Analyzing trace with hash 610604296, now seen corresponding path program 1 times [2025-03-08 06:25:15,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:15,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847271794] [2025-03-08 06:25:15,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:15,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:15,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:25:15,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:25:15,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:15,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:15,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:15,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847271794] [2025-03-08 06:25:15,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847271794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:15,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:15,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:25:15,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300802612] [2025-03-08 06:25:15,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:15,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:25:15,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:15,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:25:15,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:25:15,246 INFO L87 Difference]: Start difference. First operand 246 states and 301 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-03-08 06:25:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:15,616 INFO L93 Difference]: Finished difference Result 429 states and 542 transitions. [2025-03-08 06:25:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:25:15,617 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-03-08 06:25:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:15,618 INFO L225 Difference]: With dead ends: 429 [2025-03-08 06:25:15,618 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 06:25:15,618 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-03-08 06:25:15,619 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1039 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:15,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1087 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 06:25:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 246. [2025-03-08 06:25:15,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2765957446808511) internal successors, (300), 245 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 300 transitions. [2025-03-08 06:25:15,623 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 300 transitions. Word has length 64 [2025-03-08 06:25:15,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:15,624 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 300 transitions. [2025-03-08 06:25:15,624 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-03-08 06:25:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 300 transitions. [2025-03-08 06:25:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:25:15,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:15,625 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-03-08 06:25:15,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:25:15,625 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:15,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash 59816032, now seen corresponding path program 1 times [2025-03-08 06:25:15,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:15,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050608510] [2025-03-08 06:25:15,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:15,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:15,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:25:15,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:25:15,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:15,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:16,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:16,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050608510] [2025-03-08 06:25:16,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050608510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:16,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:16,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:25:16,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27175692] [2025-03-08 06:25:16,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:16,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:25:16,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:16,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:25:16,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:25:16,053 INFO L87 Difference]: Start difference. First operand 246 states and 300 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:16,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:16,687 INFO L93 Difference]: Finished difference Result 553 states and 684 transitions. [2025-03-08 06:25:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:25:16,690 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:25:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:16,691 INFO L225 Difference]: With dead ends: 553 [2025-03-08 06:25:16,691 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 06:25:16,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:25:16,692 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 1822 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1822 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:16,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1822 Valid, 1933 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 06:25:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 242. [2025-03-08 06:25:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 232 states have (on average 1.2758620689655173) internal successors, (296), 241 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 296 transitions. [2025-03-08 06:25:16,697 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 296 transitions. Word has length 66 [2025-03-08 06:25:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:16,697 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 296 transitions. [2025-03-08 06:25:16,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 296 transitions. [2025-03-08 06:25:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:25:16,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:16,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] [2025-03-08 06:25:16,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:25:16,698 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:16,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash 587583427, now seen corresponding path program 1 times [2025-03-08 06:25:16,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:16,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070521255] [2025-03-08 06:25:16,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:16,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:16,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:25:16,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:25:16,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:16,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:17,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:17,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070521255] [2025-03-08 06:25:17,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070521255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:17,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:17,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:25:17,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293019705] [2025-03-08 06:25:17,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:17,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:25:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:17,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:25:17,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:25:17,051 INFO L87 Difference]: Start difference. First operand 242 states and 296 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 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-03-08 06:25:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:17,503 INFO L93 Difference]: Finished difference Result 426 states and 545 transitions. [2025-03-08 06:25:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:25:17,504 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 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-03-08 06:25:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:17,505 INFO L225 Difference]: With dead ends: 426 [2025-03-08 06:25:17,505 INFO L226 Difference]: Without dead ends: 361 [2025-03-08 06:25:17,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:25:17,505 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 1131 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:17,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 1856 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-08 06:25:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 231. [2025-03-08 06:25:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 222 states have (on average 1.2747747747747749) internal successors, (283), 230 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 283 transitions. [2025-03-08 06:25:17,510 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 283 transitions. Word has length 66 [2025-03-08 06:25:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:17,510 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 283 transitions. [2025-03-08 06:25:17,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 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-03-08 06:25:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 283 transitions. [2025-03-08 06:25:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:25:17,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:17,511 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-03-08 06:25:17,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:25:17,511 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:17,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1317814465, now seen corresponding path program 1 times [2025-03-08 06:25:17,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:17,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263077148] [2025-03-08 06:25:17,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:17,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:17,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:25:17,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:25:17,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:17,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:18,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:18,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263077148] [2025-03-08 06:25:18,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263077148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:18,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:18,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-08 06:25:18,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826088170] [2025-03-08 06:25:18,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:18,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 06:25:18,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:18,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 06:25:18,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2025-03-08 06:25:18,413 INFO L87 Difference]: Start difference. First operand 231 states and 283 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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-03-08 06:25:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:20,586 INFO L93 Difference]: Finished difference Result 766 states and 980 transitions. [2025-03-08 06:25:20,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 06:25:20,587 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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-03-08 06:25:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:20,589 INFO L225 Difference]: With dead ends: 766 [2025-03-08 06:25:20,589 INFO L226 Difference]: Without dead ends: 708 [2025-03-08 06:25:20,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=315, Invalid=1577, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 06:25:20,590 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 2370 mSDsluCounter, 5136 mSDsCounter, 0 mSdLazyCounter, 2966 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 5572 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:20,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2370 Valid, 5572 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2966 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:25:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-03-08 06:25:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 246. [2025-03-08 06:25:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 245 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 304 transitions. [2025-03-08 06:25:20,602 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 304 transitions. Word has length 66 [2025-03-08 06:25:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:20,602 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 304 transitions. [2025-03-08 06:25:20,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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-03-08 06:25:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 304 transitions. [2025-03-08 06:25:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:25:20,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:20,603 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-03-08 06:25:20,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:25:20,603 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:20,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash -789563969, now seen corresponding path program 1 times [2025-03-08 06:25:20,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:20,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163091765] [2025-03-08 06:25:20,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:20,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:25:20,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:25:20,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:20,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:21,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:21,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163091765] [2025-03-08 06:25:21,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163091765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:21,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:21,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-08 06:25:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093577065] [2025-03-08 06:25:21,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:21,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 06:25:21,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:21,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 06:25:21,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:25:21,677 INFO L87 Difference]: Start difference. First operand 246 states and 304 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 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-03-08 06:25:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:24,133 INFO L93 Difference]: Finished difference Result 576 states and 733 transitions. [2025-03-08 06:25:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 06:25:24,137 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 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-03-08 06:25:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:24,138 INFO L225 Difference]: With dead ends: 576 [2025-03-08 06:25:24,138 INFO L226 Difference]: Without dead ends: 521 [2025-03-08 06:25:24,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=462, Invalid=1794, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 06:25:24,139 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 2560 mSDsluCounter, 4748 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2560 SdHoareTripleChecker+Valid, 5165 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:24,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2560 Valid, 5165 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:25:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-08 06:25:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 252. [2025-03-08 06:25:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 243 states have (on average 1.2798353909465021) internal successors, (311), 251 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 311 transitions. [2025-03-08 06:25:24,143 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 311 transitions. Word has length 66 [2025-03-08 06:25:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:24,143 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 311 transitions. [2025-03-08 06:25:24,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 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-03-08 06:25:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 311 transitions. [2025-03-08 06:25:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:25:24,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:24,144 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-03-08 06:25:24,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:25:24,144 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:24,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1053475470, now seen corresponding path program 1 times [2025-03-08 06:25:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:24,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875811973] [2025-03-08 06:25:24,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:24,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:24,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:25:24,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:25:24,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:24,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:24,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:24,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875811973] [2025-03-08 06:25:24,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875811973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:24,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:24,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:25:24,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452794334] [2025-03-08 06:25:24,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:24,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:25:24,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:24,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:25:24,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:25:24,509 INFO L87 Difference]: Start difference. First operand 252 states and 311 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:25,142 INFO L93 Difference]: Finished difference Result 631 states and 818 transitions. [2025-03-08 06:25:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:25:25,143 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:25:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:25,144 INFO L225 Difference]: With dead ends: 631 [2025-03-08 06:25:25,144 INFO L226 Difference]: Without dead ends: 547 [2025-03-08 06:25:25,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:25:25,145 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 1190 mSDsluCounter, 3894 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 4446 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:25,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 4446 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:25,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-08 06:25:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 222. [2025-03-08 06:25:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 214 states have (on average 1.280373831775701) internal successors, (274), 221 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 274 transitions. [2025-03-08 06:25:25,148 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 274 transitions. Word has length 66 [2025-03-08 06:25:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:25,149 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 274 transitions. [2025-03-08 06:25:25,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 274 transitions. [2025-03-08 06:25:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:25:25,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:25,149 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-03-08 06:25:25,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:25:25,150 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-03-08 06:25:25,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash -935830778, now seen corresponding path program 1 times [2025-03-08 06:25:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713304156] [2025-03-08 06:25:25,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:25,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:25:25,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:25:25,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:25,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:25,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:25,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713304156] [2025-03-08 06:25:25,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713304156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:25,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:25,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:25:25,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126244273] [2025-03-08 06:25:25,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:25,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:25:25,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:25,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:25:25,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:25:25,480 INFO L87 Difference]: Start difference. First operand 222 states and 274 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:25,996 INFO L93 Difference]: Finished difference Result 545 states and 701 transitions. [2025-03-08 06:25:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:25:25,997 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 06:25:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:26,001 INFO L225 Difference]: With dead ends: 545 [2025-03-08 06:25:26,001 INFO L226 Difference]: Without dead ends: 487 [2025-03-08 06:25:26,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:25:26,003 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 1390 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:26,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 2113 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:26,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-08 06:25:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 218. [2025-03-08 06:25:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 211 states have (on average 1.2748815165876777) internal successors, (269), 217 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 269 transitions. [2025-03-08 06:25:26,007 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 269 transitions. Word has length 66 [2025-03-08 06:25:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:26,008 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 269 transitions. [2025-03-08 06:25:26,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 269 transitions. [2025-03-08 06:25:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:25:26,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:26,008 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-03-08 06:25:26,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:25:26,009 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:26,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash -672121848, now seen corresponding path program 1 times [2025-03-08 06:25:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:26,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363838011] [2025-03-08 06:25:26,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:26,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:26,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:25:26,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:25:26,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:26,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:26,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:26,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363838011] [2025-03-08 06:25:26,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363838011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:26,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:26,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:25:26,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335081065] [2025-03-08 06:25:26,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:26,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:25:26,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:26,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:25:26,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:25:26,287 INFO L87 Difference]: Start difference. First operand 218 states and 269 transitions. Second operand has 11 states, 11 states have (on average 6.0) 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-03-08 06:25:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:26,638 INFO L93 Difference]: Finished difference Result 540 states and 701 transitions. [2025-03-08 06:25:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:25:26,639 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) 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-03-08 06:25:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:26,640 INFO L225 Difference]: With dead ends: 540 [2025-03-08 06:25:26,640 INFO L226 Difference]: Without dead ends: 451 [2025-03-08 06:25:26,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:25:26,641 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 855 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:26,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1568 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-08 06:25:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 183. [2025-03-08 06:25:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 178 states have (on average 1.2752808988764044) internal successors, (227), 182 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 227 transitions. [2025-03-08 06:25:26,644 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 227 transitions. Word has length 66 [2025-03-08 06:25:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:26,644 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 227 transitions. [2025-03-08 06:25:26,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) 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-03-08 06:25:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 227 transitions. [2025-03-08 06:25:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:25:26,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:26,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] [2025-03-08 06:25:26,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:25:26,645 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:26,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash 435214982, now seen corresponding path program 1 times [2025-03-08 06:25:26,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:26,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992146005] [2025-03-08 06:25:26,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:26,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:26,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:25:26,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:25:26,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:26,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:26,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:26,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992146005] [2025-03-08 06:25:26,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992146005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:26,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:26,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:25:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722416419] [2025-03-08 06:25:26,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:26,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:25:26,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:26,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:25:26,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:25:26,877 INFO L87 Difference]: Start difference. First operand 183 states and 227 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 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-03-08 06:25:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:27,415 INFO L93 Difference]: Finished difference Result 421 states and 557 transitions. [2025-03-08 06:25:27,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:25:27,416 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 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-03-08 06:25:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:27,417 INFO L225 Difference]: With dead ends: 421 [2025-03-08 06:25:27,417 INFO L226 Difference]: Without dead ends: 414 [2025-03-08 06:25:27,417 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-03-08 06:25:27,418 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 2210 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2210 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:27,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2210 Valid, 693 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-08 06:25:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 187. [2025-03-08 06:25:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.2692307692307692) internal successors, (231), 186 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 231 transitions. [2025-03-08 06:25:27,422 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 231 transitions. Word has length 67 [2025-03-08 06:25:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:27,422 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 231 transitions. [2025-03-08 06:25:27,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 11 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-03-08 06:25:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 231 transitions. [2025-03-08 06:25:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:25:27,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:27,423 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-03-08 06:25:27,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:25:27,423 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:27,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash -716845461, now seen corresponding path program 1 times [2025-03-08 06:25:27,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:27,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619987155] [2025-03-08 06:25:27,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:27,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:27,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:25:27,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:25:27,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:27,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:28,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619987155] [2025-03-08 06:25:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619987155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:28,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:28,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 06:25:28,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558158481] [2025-03-08 06:25:28,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:28,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 06:25:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:28,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 06:25:28,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:25:28,099 INFO L87 Difference]: Start difference. First operand 187 states and 231 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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-03-08 06:25:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:29,008 INFO L93 Difference]: Finished difference Result 432 states and 562 transitions. [2025-03-08 06:25:29,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:25:29,009 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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-03-08 06:25:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:29,010 INFO L225 Difference]: With dead ends: 432 [2025-03-08 06:25:29,010 INFO L226 Difference]: Without dead ends: 374 [2025-03-08 06:25:29,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-03-08 06:25:29,010 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1618 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:29,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 1774 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-08 06:25:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 188. [2025-03-08 06:25:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 183 states have (on average 1.273224043715847) internal successors, (233), 187 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 233 transitions. [2025-03-08 06:25:29,013 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 233 transitions. Word has length 67 [2025-03-08 06:25:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:29,013 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 233 transitions. [2025-03-08 06:25:29,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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-03-08 06:25:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 233 transitions. [2025-03-08 06:25:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:25:29,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:29,014 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-03-08 06:25:29,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:25:29,014 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:29,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash 354249932, now seen corresponding path program 1 times [2025-03-08 06:25:29,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:29,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770807883] [2025-03-08 06:25:29,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:29,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:29,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:25:29,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:25:29,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:29,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:29,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:29,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770807883] [2025-03-08 06:25:29,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770807883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:29,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:29,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:25:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746593774] [2025-03-08 06:25:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:29,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:25:29,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:29,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:25:29,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:25:29,152 INFO L87 Difference]: Start difference. First operand 188 states and 233 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-03-08 06:25:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:29,517 INFO L93 Difference]: Finished difference Result 367 states and 478 transitions. [2025-03-08 06:25:29,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:25:29,517 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-03-08 06:25:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:29,518 INFO L225 Difference]: With dead ends: 367 [2025-03-08 06:25:29,518 INFO L226 Difference]: Without dead ends: 295 [2025-03-08 06:25:29,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:25:29,519 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 626 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:29,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1000 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-08 06:25:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 188. [2025-03-08 06:25:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 187 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 231 transitions. [2025-03-08 06:25:29,522 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 231 transitions. Word has length 67 [2025-03-08 06:25:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:29,522 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 231 transitions. [2025-03-08 06:25:29,522 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-03-08 06:25:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 231 transitions. [2025-03-08 06:25:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:25:29,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:29,523 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-03-08 06:25:29,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:25:29,523 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:29,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash 678343438, now seen corresponding path program 1 times [2025-03-08 06:25:29,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:29,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615166852] [2025-03-08 06:25:29,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:29,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:29,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:25:29,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:25:29,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:29,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:29,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615166852] [2025-03-08 06:25:29,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615166852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:29,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:29,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:25:29,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718793579] [2025-03-08 06:25:29,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:29,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:25:29,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:29,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:25:29,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:25:29,661 INFO L87 Difference]: Start difference. First operand 188 states and 231 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-03-08 06:25:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:29,985 INFO L93 Difference]: Finished difference Result 280 states and 350 transitions. [2025-03-08 06:25:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:25:29,986 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-03-08 06:25:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:29,987 INFO L225 Difference]: With dead ends: 280 [2025-03-08 06:25:29,987 INFO L226 Difference]: Without dead ends: 273 [2025-03-08 06:25:29,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:25:29,988 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1080 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:29,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 588 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-08 06:25:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 188. [2025-03-08 06:25:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 183 states have (on average 1.2513661202185793) internal successors, (229), 187 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 229 transitions. [2025-03-08 06:25:29,991 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 229 transitions. Word has length 67 [2025-03-08 06:25:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:29,991 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 229 transitions. [2025-03-08 06:25:29,991 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-03-08 06:25:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 229 transitions. [2025-03-08 06:25:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:25:29,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:29,992 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-03-08 06:25:29,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:25:29,992 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:29,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash -741941333, now seen corresponding path program 1 times [2025-03-08 06:25:29,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:29,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037094318] [2025-03-08 06:25:29,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:30,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:25:30,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:25:30,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:30,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:30,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:30,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037094318] [2025-03-08 06:25:30,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037094318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:30,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:30,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:25:30,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178622876] [2025-03-08 06:25:30,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:30,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:25:30,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:30,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:25:30,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:25:30,341 INFO L87 Difference]: Start difference. First operand 188 states and 229 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 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-03-08 06:25:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:30,746 INFO L93 Difference]: Finished difference Result 325 states and 420 transitions. [2025-03-08 06:25:30,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:25:30,746 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 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-03-08 06:25:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:30,747 INFO L225 Difference]: With dead ends: 325 [2025-03-08 06:25:30,747 INFO L226 Difference]: Without dead ends: 267 [2025-03-08 06:25:30,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:25:30,748 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 907 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:30,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 1355 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-08 06:25:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 168. [2025-03-08 06:25:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 164 states have (on average 1.2378048780487805) internal successors, (203), 167 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 203 transitions. [2025-03-08 06:25:30,751 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 203 transitions. Word has length 67 [2025-03-08 06:25:30,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:30,751 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 203 transitions. [2025-03-08 06:25:30,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 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-03-08 06:25:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 203 transitions. [2025-03-08 06:25:30,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:25:30,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:30,752 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-03-08 06:25:30,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:25:30,752 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-03-08 06:25:30,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash 857910498, now seen corresponding path program 1 times [2025-03-08 06:25:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:30,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691819144] [2025-03-08 06:25:30,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:30,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:25:30,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:25:30,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:30,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691819144] [2025-03-08 06:25:30,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691819144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:30,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:30,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:25:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171392948] [2025-03-08 06:25:30,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:30,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:25:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:30,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:25:30,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:25:30,916 INFO L87 Difference]: Start difference. First operand 168 states and 203 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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-03-08 06:25:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:31,284 INFO L93 Difference]: Finished difference Result 260 states and 322 transitions. [2025-03-08 06:25:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:25:31,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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-03-08 06:25:31,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:31,285 INFO L225 Difference]: With dead ends: 260 [2025-03-08 06:25:31,285 INFO L226 Difference]: Without dead ends: 253 [2025-03-08 06:25:31,286 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-03-08 06:25:31,286 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 597 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:31,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 763 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:31,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-08 06:25:31,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 164. [2025-03-08 06:25:31,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 160 states have (on average 1.2375) internal successors, (198), 163 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2025-03-08 06:25:31,290 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 68 [2025-03-08 06:25:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:31,290 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2025-03-08 06:25:31,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 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-03-08 06:25:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2025-03-08 06:25:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:25:31,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:31,291 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-03-08 06:25:31,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:25:31,293 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-03-08 06:25:31,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1822392198, now seen corresponding path program 1 times [2025-03-08 06:25:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:31,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692736207] [2025-03-08 06:25:31,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:31,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:25:31,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:25:31,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:31,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:31,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:31,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692736207] [2025-03-08 06:25:31,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692736207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:31,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:31,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:25:31,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388086574] [2025-03-08 06:25:31,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:31,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:25:31,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:31,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:25:31,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:25:31,617 INFO L87 Difference]: Start difference. First operand 164 states and 198 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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-03-08 06:25:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:32,117 INFO L93 Difference]: Finished difference Result 443 states and 569 transitions. [2025-03-08 06:25:32,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:25:32,118 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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-03-08 06:25:32,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:32,119 INFO L225 Difference]: With dead ends: 443 [2025-03-08 06:25:32,119 INFO L226 Difference]: Without dead ends: 425 [2025-03-08 06:25:32,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:25:32,120 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 827 mSDsluCounter, 3059 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 3552 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:32,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 3552 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:25:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-08 06:25:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 146. [2025-03-08 06:25:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 143 states have (on average 1.2447552447552448) internal successors, (178), 145 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 178 transitions. [2025-03-08 06:25:32,123 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 178 transitions. Word has length 69 [2025-03-08 06:25:32,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:32,123 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 178 transitions. [2025-03-08 06:25:32,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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-03-08 06:25:32,123 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 178 transitions. [2025-03-08 06:25:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:25:32,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:32,124 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-03-08 06:25:32,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:25:32,124 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:32,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:32,124 INFO L85 PathProgramCache]: Analyzing trace with hash 934143180, now seen corresponding path program 1 times [2025-03-08 06:25:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:32,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488614791] [2025-03-08 06:25:32,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:32,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:32,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:25:32,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:25:32,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:32,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:32,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488614791] [2025-03-08 06:25:32,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488614791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:32,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:32,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:25:32,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82351828] [2025-03-08 06:25:32,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:32,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:25:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:32,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:25:32,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:25:32,444 INFO L87 Difference]: Start difference. First operand 146 states and 178 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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-03-08 06:25:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:32,911 INFO L93 Difference]: Finished difference Result 240 states and 310 transitions. [2025-03-08 06:25:32,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:25:32,912 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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-03-08 06:25:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:32,913 INFO L225 Difference]: With dead ends: 240 [2025-03-08 06:25:32,913 INFO L226 Difference]: Without dead ends: 234 [2025-03-08 06:25:32,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:25:32,913 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 504 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:32,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1665 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:25:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-08 06:25:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 152. [2025-03-08 06:25:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 149 states have (on average 1.2483221476510067) internal successors, (186), 151 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 186 transitions. [2025-03-08 06:25:32,917 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 186 transitions. Word has length 69 [2025-03-08 06:25:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:32,917 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 186 transitions. [2025-03-08 06:25:32,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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-03-08 06:25:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 186 transitions. [2025-03-08 06:25:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:25:32,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:32,918 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-03-08 06:25:32,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:25:32,918 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:32,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:32,919 INFO L85 PathProgramCache]: Analyzing trace with hash -754364722, now seen corresponding path program 1 times [2025-03-08 06:25:32,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:32,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923691713] [2025-03-08 06:25:32,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:32,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:25:32,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:25:32,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:32,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:33,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:33,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923691713] [2025-03-08 06:25:33,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923691713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:33,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:33,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 06:25:33,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127253599] [2025-03-08 06:25:33,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:33,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 06:25:33,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:33,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 06:25:33,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:25:33,648 INFO L87 Difference]: Start difference. First operand 152 states and 186 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 23 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-03-08 06:25:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:35,485 INFO L93 Difference]: Finished difference Result 500 states and 652 transitions. [2025-03-08 06:25:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 06:25:35,485 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 23 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-03-08 06:25:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:35,486 INFO L225 Difference]: With dead ends: 500 [2025-03-08 06:25:35,486 INFO L226 Difference]: Without dead ends: 492 [2025-03-08 06:25:35,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 06:25:35,487 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 1078 mSDsluCounter, 5571 mSDsCounter, 0 mSdLazyCounter, 2855 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 5982 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:35,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 5982 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2855 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:25:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-08 06:25:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 166. [2025-03-08 06:25:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 163 states have (on average 1.2453987730061349) internal successors, (203), 165 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 203 transitions. [2025-03-08 06:25:35,491 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 203 transitions. Word has length 69 [2025-03-08 06:25:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:35,491 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 203 transitions. [2025-03-08 06:25:35,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 23 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-03-08 06:25:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 203 transitions. [2025-03-08 06:25:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:25:35,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:35,491 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-03-08 06:25:35,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:25:35,491 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:35,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:35,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1289543714, now seen corresponding path program 1 times [2025-03-08 06:25:35,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:35,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771099772] [2025-03-08 06:25:35,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:35,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:35,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:25:35,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:25:35,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:35,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:35,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:35,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771099772] [2025-03-08 06:25:35,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771099772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:35,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:35,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:25:35,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596658576] [2025-03-08 06:25:35,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:35,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:25:35,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:35,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:25:35,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:25:35,780 INFO L87 Difference]: Start difference. First operand 166 states and 203 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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-03-08 06:25:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:36,142 INFO L93 Difference]: Finished difference Result 251 states and 320 transitions. [2025-03-08 06:25:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:25:36,142 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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-03-08 06:25:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:36,143 INFO L225 Difference]: With dead ends: 251 [2025-03-08 06:25:36,143 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 06:25:36,143 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-03-08 06:25:36,143 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 736 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:36,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1504 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 06:25:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 140. [2025-03-08 06:25:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 139 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2025-03-08 06:25:36,146 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 173 transitions. Word has length 70 [2025-03-08 06:25:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:36,146 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 173 transitions. [2025-03-08 06:25:36,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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-03-08 06:25:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2025-03-08 06:25:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 06:25:36,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:36,146 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-03-08 06:25:36,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:25:36,146 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:36,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:36,147 INFO L85 PathProgramCache]: Analyzing trace with hash -941683411, now seen corresponding path program 1 times [2025-03-08 06:25:36,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:36,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318105647] [2025-03-08 06:25:36,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:36,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:36,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 06:25:36,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 06:25:36,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:36,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:36,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:36,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318105647] [2025-03-08 06:25:36,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318105647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:36,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:36,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:25:36,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431109578] [2025-03-08 06:25:36,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:36,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:25:36,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:36,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:25:36,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:25:36,402 INFO L87 Difference]: Start difference. First operand 140 states and 173 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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-03-08 06:25:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:36,690 INFO L93 Difference]: Finished difference Result 201 states and 260 transitions. [2025-03-08 06:25:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:25:36,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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-03-08 06:25:36,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:36,691 INFO L225 Difference]: With dead ends: 201 [2025-03-08 06:25:36,691 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 06:25:36,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:25:36,691 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 546 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:36,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1357 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 06:25:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 128. [2025-03-08 06:25:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.2519685039370079) internal successors, (159), 127 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 159 transitions. [2025-03-08 06:25:36,693 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 159 transitions. Word has length 70 [2025-03-08 06:25:36,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:36,693 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 159 transitions. [2025-03-08 06:25:36,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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-03-08 06:25:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2025-03-08 06:25:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:25:36,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:36,694 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] [2025-03-08 06:25:36,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:25:36,694 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:36,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:36,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1779431181, now seen corresponding path program 1 times [2025-03-08 06:25:36,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:36,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339261630] [2025-03-08 06:25:36,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:36,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:36,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:25:36,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:25:36,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:36,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:36,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:36,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339261630] [2025-03-08 06:25:36,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339261630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:36,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:36,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:25:36,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831857831] [2025-03-08 06:25:36,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:36,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:25:36,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:36,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:25:36,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:25:36,760 INFO L87 Difference]: Start difference. First operand 128 states and 159 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:36,878 INFO L93 Difference]: Finished difference Result 560 states and 799 transitions. [2025-03-08 06:25:36,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:25:36,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-08 06:25:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:36,880 INFO L225 Difference]: With dead ends: 560 [2025-03-08 06:25:36,880 INFO L226 Difference]: Without dead ends: 506 [2025-03-08 06:25:36,881 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-03-08 06:25:36,881 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 822 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:36,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1016 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:25:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-08 06:25:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 180. [2025-03-08 06:25:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.318435754189944) internal successors, (236), 179 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 236 transitions. [2025-03-08 06:25:36,885 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 236 transitions. Word has length 92 [2025-03-08 06:25:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:36,885 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 236 transitions. [2025-03-08 06:25:36,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 236 transitions. [2025-03-08 06:25:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:25:36,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:36,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:36,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:25:36,886 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:36,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1762348105, now seen corresponding path program 1 times [2025-03-08 06:25:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:36,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521062305] [2025-03-08 06:25:36,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:36,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:25:36,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:25:36,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:36,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:36,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:36,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521062305] [2025-03-08 06:25:36,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521062305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:36,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:36,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:25:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206844918] [2025-03-08 06:25:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:36,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:25:36,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:36,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:25:36,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:25:36,988 INFO L87 Difference]: Start difference. First operand 180 states and 236 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:37,056 INFO L93 Difference]: Finished difference Result 658 states and 942 transitions. [2025-03-08 06:25:37,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:25:37,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:25:37,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:37,058 INFO L225 Difference]: With dead ends: 658 [2025-03-08 06:25:37,058 INFO L226 Difference]: Without dead ends: 552 [2025-03-08 06:25:37,058 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-03-08 06:25:37,058 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 573 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:37,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 729 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-08 06:25:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 284. [2025-03-08 06:25:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.3816254416961131) internal successors, (391), 283 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-03-08 06:25:37,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 391 transitions. [2025-03-08 06:25:37,062 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 391 transitions. Word has length 94 [2025-03-08 06:25:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:37,062 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 391 transitions. [2025-03-08 06:25:37,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 391 transitions. [2025-03-08 06:25:37,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:25:37,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:37,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:37,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:25:37,064 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:37,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash -609122327, now seen corresponding path program 1 times [2025-03-08 06:25:37,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:37,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509161729] [2025-03-08 06:25:37,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:37,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:37,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:25:37,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:25:37,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:37,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:37,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:37,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509161729] [2025-03-08 06:25:37,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509161729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:37,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:37,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:25:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533395726] [2025-03-08 06:25:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:37,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:25:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:37,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:25:37,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:25:37,154 INFO L87 Difference]: Start difference. First operand 284 states and 391 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:37,220 INFO L93 Difference]: Finished difference Result 762 states and 1097 transitions. [2025-03-08 06:25:37,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:25:37,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:25:37,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:37,222 INFO L225 Difference]: With dead ends: 762 [2025-03-08 06:25:37,222 INFO L226 Difference]: Without dead ends: 656 [2025-03-08 06:25:37,223 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-03-08 06:25:37,223 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 613 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:37,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 676 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-03-08 06:25:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 440. [2025-03-08 06:25:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.419134396355353) internal successors, (623), 439 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 623 transitions. [2025-03-08 06:25:37,229 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 623 transitions. Word has length 94 [2025-03-08 06:25:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:37,229 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 623 transitions. [2025-03-08 06:25:37,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 623 transitions. [2025-03-08 06:25:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:25:37,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:37,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:37,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:25:37,230 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:37,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1560712073, now seen corresponding path program 1 times [2025-03-08 06:25:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:37,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229773539] [2025-03-08 06:25:37,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:37,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:37,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:25:37,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:25:37,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:37,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:37,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:37,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229773539] [2025-03-08 06:25:37,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229773539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:37,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:37,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:25:37,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894827819] [2025-03-08 06:25:37,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:37,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:25:37,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:37,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:25:37,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:25:37,301 INFO L87 Difference]: Start difference. First operand 440 states and 623 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:37,370 INFO L93 Difference]: Finished difference Result 866 states and 1252 transitions. [2025-03-08 06:25:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:25:37,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:25:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:37,372 INFO L225 Difference]: With dead ends: 866 [2025-03-08 06:25:37,372 INFO L226 Difference]: Without dead ends: 760 [2025-03-08 06:25:37,372 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-03-08 06:25:37,373 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 588 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:37,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 735 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-03-08 06:25:37,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 544. [2025-03-08 06:25:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.432780847145488) internal successors, (778), 543 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 778 transitions. [2025-03-08 06:25:37,381 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 778 transitions. Word has length 94 [2025-03-08 06:25:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:37,381 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 778 transitions. [2025-03-08 06:25:37,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 778 transitions. [2025-03-08 06:25:37,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:25:37,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:37,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:37,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:25:37,383 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:37,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1840747204, now seen corresponding path program 1 times [2025-03-08 06:25:37,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:37,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508996955] [2025-03-08 06:25:37,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:37,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:37,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:25:37,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:25:37,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:37,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:37,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:37,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508996955] [2025-03-08 06:25:37,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508996955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:37,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:37,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:25:37,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096091221] [2025-03-08 06:25:37,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:37,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:25:37,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:37,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:25:37,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:25:37,433 INFO L87 Difference]: Start difference. First operand 544 states and 778 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:37,458 INFO L93 Difference]: Finished difference Result 1426 states and 2074 transitions. [2025-03-08 06:25:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:25:37,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:25:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:37,461 INFO L225 Difference]: With dead ends: 1426 [2025-03-08 06:25:37,461 INFO L226 Difference]: Without dead ends: 956 [2025-03-08 06:25:37,462 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-03-08 06:25:37,462 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 89 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:37,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 252 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-03-08 06:25:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 945. [2025-03-08 06:25:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 1.4216101694915255) internal successors, (1342), 944 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1342 transitions. [2025-03-08 06:25:37,475 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1342 transitions. Word has length 94 [2025-03-08 06:25:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:37,475 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1342 transitions. [2025-03-08 06:25:37,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1342 transitions. [2025-03-08 06:25:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:25:37,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:37,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:37,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:25:37,477 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:37,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:37,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1876764523, now seen corresponding path program 1 times [2025-03-08 06:25:37,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:37,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372694508] [2025-03-08 06:25:37,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:37,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:25:37,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:25:37,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:37,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:37,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:37,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372694508] [2025-03-08 06:25:37,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372694508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:37,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:37,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:25:37,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71949553] [2025-03-08 06:25:37,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:37,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:25:37,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:37,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:25:37,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:25:37,615 INFO L87 Difference]: Start difference. First operand 945 states and 1342 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:37,698 INFO L93 Difference]: Finished difference Result 1818 states and 2606 transitions. [2025-03-08 06:25:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:25:37,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:25:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:37,701 INFO L225 Difference]: With dead ends: 1818 [2025-03-08 06:25:37,701 INFO L226 Difference]: Without dead ends: 947 [2025-03-08 06:25:37,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:25:37,702 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 264 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:37,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 378 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:37,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-08 06:25:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 945. [2025-03-08 06:25:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 1.416313559322034) internal successors, (1337), 944 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1337 transitions. [2025-03-08 06:25:37,710 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1337 transitions. Word has length 94 [2025-03-08 06:25:37,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:37,710 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1337 transitions. [2025-03-08 06:25:37,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1337 transitions. [2025-03-08 06:25:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:25:37,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:37,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:37,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 06:25:37,711 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:37,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:37,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1920257440, now seen corresponding path program 1 times [2025-03-08 06:25:37,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:37,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427701768] [2025-03-08 06:25:37,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:37,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:37,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:25:37,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:25:37,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:37,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:37,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:37,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427701768] [2025-03-08 06:25:37,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427701768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:37,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:37,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:25:37,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913348422] [2025-03-08 06:25:37,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:37,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:25:37,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:37,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:25:37,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:25:37,779 INFO L87 Difference]: Start difference. First operand 945 states and 1337 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:37,797 INFO L93 Difference]: Finished difference Result 2615 states and 3727 transitions. [2025-03-08 06:25:37,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:25:37,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:25:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:37,802 INFO L225 Difference]: With dead ends: 2615 [2025-03-08 06:25:37,802 INFO L226 Difference]: Without dead ends: 1744 [2025-03-08 06:25:37,803 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-03-08 06:25:37,804 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 72 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:37,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2025-03-08 06:25:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1670. [2025-03-08 06:25:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 1.4140203714799282) internal successors, (2360), 1669 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2360 transitions. [2025-03-08 06:25:37,820 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2360 transitions. Word has length 95 [2025-03-08 06:25:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:37,820 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2360 transitions. [2025-03-08 06:25:37,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2360 transitions. [2025-03-08 06:25:37,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:25:37,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:37,821 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-03-08 06:25:37,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 06:25:37,821 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:37,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:37,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1341386876, now seen corresponding path program 1 times [2025-03-08 06:25:37,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:37,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269498073] [2025-03-08 06:25:37,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:37,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:37,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:25:37,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:25:37,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:37,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:37,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:37,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269498073] [2025-03-08 06:25:37,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269498073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:37,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:37,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:25:37,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984845389] [2025-03-08 06:25:37,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:37,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:25:37,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:37,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:25:37,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:25:37,911 INFO L87 Difference]: Start difference. First operand 1670 states and 2360 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:37,934 INFO L93 Difference]: Finished difference Result 4718 states and 6670 transitions. [2025-03-08 06:25:37,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:25:37,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:25:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:37,970 INFO L225 Difference]: With dead ends: 4718 [2025-03-08 06:25:37,971 INFO L226 Difference]: Without dead ends: 3122 [2025-03-08 06:25:37,977 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-03-08 06:25:37,977 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 65 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:37,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2025-03-08 06:25:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 2976. [2025-03-08 06:25:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2975 states have (on average 1.4023529411764706) internal successors, (4172), 2975 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 4172 transitions. [2025-03-08 06:25:38,009 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 4172 transitions. Word has length 96 [2025-03-08 06:25:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:38,009 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 4172 transitions. [2025-03-08 06:25:38,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 4172 transitions. [2025-03-08 06:25:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:25:38,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:38,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:38,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 06:25:38,010 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:38,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:38,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1272713517, now seen corresponding path program 1 times [2025-03-08 06:25:38,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:38,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488360206] [2025-03-08 06:25:38,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:38,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:38,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:25:38,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:25:38,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:38,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:38,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:38,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488360206] [2025-03-08 06:25:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488360206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:38,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:38,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:25:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28385483] [2025-03-08 06:25:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:38,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:25:38,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:38,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:25:38,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:25:38,072 INFO L87 Difference]: Start difference. First operand 2976 states and 4172 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:38,115 INFO L93 Difference]: Finished difference Result 8492 states and 11854 transitions. [2025-03-08 06:25:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:25:38,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:25:38,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:38,128 INFO L225 Difference]: With dead ends: 8492 [2025-03-08 06:25:38,128 INFO L226 Difference]: Without dead ends: 5590 [2025-03-08 06:25:38,131 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-03-08 06:25:38,131 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 55 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:38,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 333 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5590 states. [2025-03-08 06:25:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5590 to 5300. [2025-03-08 06:25:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5300 states, 5299 states have (on average 1.382902434421589) internal successors, (7328), 5299 states have internal predecessors, (7328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:38,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5300 states to 5300 states and 7328 transitions. [2025-03-08 06:25:38,178 INFO L78 Accepts]: Start accepts. Automaton has 5300 states and 7328 transitions. Word has length 97 [2025-03-08 06:25:38,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:38,179 INFO L471 AbstractCegarLoop]: Abstraction has 5300 states and 7328 transitions. [2025-03-08 06:25:38,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 5300 states and 7328 transitions. [2025-03-08 06:25:38,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:25:38,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:38,179 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-03-08 06:25:38,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 06:25:38,179 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:38,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:38,180 INFO L85 PathProgramCache]: Analyzing trace with hash 870655439, now seen corresponding path program 1 times [2025-03-08 06:25:38,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:38,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132011114] [2025-03-08 06:25:38,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:38,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:38,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:25:38,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:25:38,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:38,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:38,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:38,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132011114] [2025-03-08 06:25:38,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132011114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:38,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:38,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:25:38,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787448529] [2025-03-08 06:25:38,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:38,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:25:38,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:38,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:25:38,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:25:38,336 INFO L87 Difference]: Start difference. First operand 5300 states and 7328 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-03-08 06:25:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:38,364 INFO L93 Difference]: Finished difference Result 5494 states and 7585 transitions. [2025-03-08 06:25:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:25:38,365 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-03-08 06:25:38,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:38,373 INFO L225 Difference]: With dead ends: 5494 [2025-03-08 06:25:38,373 INFO L226 Difference]: Without dead ends: 5492 [2025-03-08 06:25:38,374 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-03-08 06:25:38,375 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:38,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 764 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:38,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5492 states. [2025-03-08 06:25:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5492 to 5492. [2025-03-08 06:25:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5492 states, 5491 states have (on average 1.3622291021671826) internal successors, (7480), 5491 states have internal predecessors, (7480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5492 states to 5492 states and 7480 transitions. [2025-03-08 06:25:38,471 INFO L78 Accepts]: Start accepts. Automaton has 5492 states and 7480 transitions. Word has length 98 [2025-03-08 06:25:38,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:38,472 INFO L471 AbstractCegarLoop]: Abstraction has 5492 states and 7480 transitions. [2025-03-08 06:25:38,472 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-03-08 06:25:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5492 states and 7480 transitions. [2025-03-08 06:25:38,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:25:38,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:38,473 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-03-08 06:25:38,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 06:25:38,473 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:38,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:38,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1942643465, now seen corresponding path program 1 times [2025-03-08 06:25:38,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:38,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932658156] [2025-03-08 06:25:38,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:38,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:38,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:25:38,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:25:38,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:38,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:38,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:38,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932658156] [2025-03-08 06:25:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932658156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:38,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:38,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:25:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051288854] [2025-03-08 06:25:38,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:38,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:25:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:38,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:25:38,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:25:38,597 INFO L87 Difference]: Start difference. First operand 5492 states and 7480 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-03-08 06:25:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:38,665 INFO L93 Difference]: Finished difference Result 10334 states and 14141 transitions. [2025-03-08 06:25:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:25:38,666 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-03-08 06:25:38,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:38,679 INFO L225 Difference]: With dead ends: 10334 [2025-03-08 06:25:38,679 INFO L226 Difference]: Without dead ends: 9124 [2025-03-08 06:25:38,683 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-03-08 06:25:38,684 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 586 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:38,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 791 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9124 states. [2025-03-08 06:25:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9124 to 6700. [2025-03-08 06:25:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.3625914315569487) internal successors, (9128), 6699 states have internal predecessors, (9128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 9128 transitions. [2025-03-08 06:25:38,785 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 9128 transitions. Word has length 98 [2025-03-08 06:25:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:38,785 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 9128 transitions. [2025-03-08 06:25:38,785 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-03-08 06:25:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 9128 transitions. [2025-03-08 06:25:38,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:25:38,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:38,786 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-03-08 06:25:38,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 06:25:38,786 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:38,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1536114337, now seen corresponding path program 1 times [2025-03-08 06:25:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:38,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918683415] [2025-03-08 06:25:38,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:38,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:38,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:25:38,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:25:38,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:38,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:38,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:38,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918683415] [2025-03-08 06:25:38,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918683415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:38,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:38,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:25:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285442834] [2025-03-08 06:25:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:38,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:25:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:38,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:25:38,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:25:38,881 INFO L87 Difference]: Start difference. First operand 6700 states and 9128 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-03-08 06:25:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:38,916 INFO L93 Difference]: Finished difference Result 17400 states and 23654 transitions. [2025-03-08 06:25:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:25:38,917 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-03-08 06:25:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:38,930 INFO L225 Difference]: With dead ends: 17400 [2025-03-08 06:25:38,931 INFO L226 Difference]: Without dead ends: 10774 [2025-03-08 06:25:38,938 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-03-08 06:25:38,938 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 76 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:38,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 336 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10774 states. [2025-03-08 06:25:39,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10774 to 10068. [2025-03-08 06:25:39,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10068 states, 10067 states have (on average 1.3457832522101918) internal successors, (13548), 10067 states have internal predecessors, (13548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10068 states to 10068 states and 13548 transitions. [2025-03-08 06:25:39,095 INFO L78 Accepts]: Start accepts. Automaton has 10068 states and 13548 transitions. Word has length 99 [2025-03-08 06:25:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:39,095 INFO L471 AbstractCegarLoop]: Abstraction has 10068 states and 13548 transitions. [2025-03-08 06:25:39,098 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-03-08 06:25:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 10068 states and 13548 transitions. [2025-03-08 06:25:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:25:39,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:39,105 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:39,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 06:25:39,105 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:39,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash 343834162, now seen corresponding path program 1 times [2025-03-08 06:25:39,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:39,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610452005] [2025-03-08 06:25:39,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:39,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:39,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:25:39,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:25:39,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:39,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:39,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:39,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610452005] [2025-03-08 06:25:39,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610452005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:25:39,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:25:39,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:25:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028982052] [2025-03-08 06:25:39,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:25:39,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:25:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:39,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:25:39,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:25:39,248 INFO L87 Difference]: Start difference. First operand 10068 states and 13548 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:39,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:39,297 INFO L93 Difference]: Finished difference Result 20064 states and 27018 transitions. [2025-03-08 06:25:39,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:25:39,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-08 06:25:39,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:39,319 INFO L225 Difference]: With dead ends: 20064 [2025-03-08 06:25:39,319 INFO L226 Difference]: Without dead ends: 10070 [2025-03-08 06:25:39,328 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-03-08 06:25:39,328 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 69 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:39,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 309 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:25:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10070 states. [2025-03-08 06:25:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10070 to 10068. [2025-03-08 06:25:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10068 states, 10067 states have (on average 1.3283003874043906) internal successors, (13372), 10067 states have internal predecessors, (13372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10068 states to 10068 states and 13372 transitions. [2025-03-08 06:25:39,453 INFO L78 Accepts]: Start accepts. Automaton has 10068 states and 13372 transitions. Word has length 125 [2025-03-08 06:25:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:39,453 INFO L471 AbstractCegarLoop]: Abstraction has 10068 states and 13372 transitions. [2025-03-08 06:25:39,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 10068 states and 13372 transitions. [2025-03-08 06:25:39,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:25:39,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:39,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:39,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 06:25:39,456 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:39,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash 781934089, now seen corresponding path program 1 times [2025-03-08 06:25:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:39,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493780704] [2025-03-08 06:25:39,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:39,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:39,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:25:39,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:25:39,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:39,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493780704] [2025-03-08 06:25:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493780704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:25:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135114170] [2025-03-08 06:25:39,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:39,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:25:39,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:25:39,820 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:25:39,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:25:39,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:25:40,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:25:40,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:40,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:40,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 06:25:40,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:25:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:40,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:25:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:42,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135114170] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:25:42,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:25:42,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2025-03-08 06:25:42,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794424026] [2025-03-08 06:25:42,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:25:42,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 06:25:42,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:42,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 06:25:42,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2025-03-08 06:25:42,068 INFO L87 Difference]: Start difference. First operand 10068 states and 13372 transitions. Second operand has 31 states, 31 states have (on average 11.387096774193548) internal successors, (353), 30 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:25:49,711 INFO L93 Difference]: Finished difference Result 93509 states and 125202 transitions. [2025-03-08 06:25:49,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2025-03-08 06:25:49,712 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 11.387096774193548) internal successors, (353), 30 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-08 06:25:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:25:49,830 INFO L225 Difference]: With dead ends: 93509 [2025-03-08 06:25:49,830 INFO L226 Difference]: Without dead ends: 83515 [2025-03-08 06:25:49,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11101 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=4436, Invalid=28144, Unknown=0, NotChecked=0, Total=32580 [2025-03-08 06:25:49,857 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 7595 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7595 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:25:49,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7595 Valid, 1784 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:25:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83515 states. [2025-03-08 06:25:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83515 to 56470. [2025-03-08 06:25:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56470 states, 56469 states have (on average 1.3226017815084383) internal successors, (74686), 56469 states have internal predecessors, (74686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56470 states to 56470 states and 74686 transitions. [2025-03-08 06:25:50,753 INFO L78 Accepts]: Start accepts. Automaton has 56470 states and 74686 transitions. Word has length 125 [2025-03-08 06:25:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:25:50,753 INFO L471 AbstractCegarLoop]: Abstraction has 56470 states and 74686 transitions. [2025-03-08 06:25:50,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.387096774193548) internal successors, (353), 30 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:25:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 56470 states and 74686 transitions. [2025-03-08 06:25:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 06:25:50,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:25:50,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:25:50,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:25:50,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-08 06:25:50,965 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:25:50,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:25:50,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1075677859, now seen corresponding path program 1 times [2025-03-08 06:25:50,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:25:50,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068724305] [2025-03-08 06:25:50,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:50,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:25:50,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:25:51,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:25:51,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:51,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:51,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:25:51,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068724305] [2025-03-08 06:25:51,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068724305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:25:51,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242912553] [2025-03-08 06:25:51,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:25:51,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:25:51,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:25:51,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:25:51,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:25:51,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:25:51,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:25:51,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:25:51,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:25:51,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 06:25:51,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:25:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:52,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:25:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:25:53,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242912553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:25:53,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:25:53,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 29 [2025-03-08 06:25:53,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771073848] [2025-03-08 06:25:53,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:25:53,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 06:25:53,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:25:53,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 06:25:53,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:25:53,235 INFO L87 Difference]: Start difference. First operand 56470 states and 74686 transitions. Second operand has 30 states, 30 states have (on average 11.233333333333333) internal successors, (337), 29 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:00,420 INFO L93 Difference]: Finished difference Result 518107 states and 681146 transitions. [2025-03-08 06:26:00,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-03-08 06:26:00,421 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 11.233333333333333) internal successors, (337), 29 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-03-08 06:26:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:01,188 INFO L225 Difference]: With dead ends: 518107 [2025-03-08 06:26:01,188 INFO L226 Difference]: Without dead ends: 461762 [2025-03-08 06:26:01,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10562 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4582, Invalid=27280, Unknown=0, NotChecked=0, Total=31862 [2025-03-08 06:26:01,328 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 3990 mSDsluCounter, 2588 mSDsCounter, 0 mSdLazyCounter, 3392 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3990 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 3468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 3392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:01,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3990 Valid, 2793 Invalid, 3468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 3392 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:26:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461762 states. [2025-03-08 06:26:05,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461762 to 295900. [2025-03-08 06:26:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295900 states, 295899 states have (on average 1.3107208878705234) internal successors, (387841), 295899 states have internal predecessors, (387841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295900 states to 295900 states and 387841 transitions. [2025-03-08 06:26:06,482 INFO L78 Accepts]: Start accepts. Automaton has 295900 states and 387841 transitions. Word has length 126 [2025-03-08 06:26:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:06,483 INFO L471 AbstractCegarLoop]: Abstraction has 295900 states and 387841 transitions. [2025-03-08 06:26:06,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.233333333333333) internal successors, (337), 29 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 295900 states and 387841 transitions. [2025-03-08 06:26:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 06:26:06,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:06,501 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:26:06,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:26:06,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-08 06:26:06,702 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:26:06,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:06,703 INFO L85 PathProgramCache]: Analyzing trace with hash 732312751, now seen corresponding path program 1 times [2025-03-08 06:26:06,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:06,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232072214] [2025-03-08 06:26:06,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:06,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:06,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 06:26:06,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 06:26:06,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:06,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:26:06,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232072214] [2025-03-08 06:26:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232072214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:26:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517119453] [2025-03-08 06:26:06,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:06,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:26:06,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:26:06,902 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:26:06,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:26:07,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 06:26:07,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 06:26:07,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:07,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:07,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 06:26:07,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:26:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:26:08,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:26:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:26:08,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517119453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:26:08,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:26:08,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 27 [2025-03-08 06:26:08,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029296233] [2025-03-08 06:26:08,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:26:08,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 06:26:08,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:08,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 06:26:08,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:26:08,764 INFO L87 Difference]: Start difference. First operand 295900 states and 387841 transitions. Second operand has 27 states, 27 states have (on average 12.88888888888889) internal successors, (348), 27 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-03-08 06:26:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:11,222 INFO L93 Difference]: Finished difference Result 504173 states and 662132 transitions. [2025-03-08 06:26:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 06:26:11,223 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 12.88888888888889) internal successors, (348), 27 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 127 [2025-03-08 06:26:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:12,139 INFO L225 Difference]: With dead ends: 504173 [2025-03-08 06:26:12,139 INFO L226 Difference]: Without dead ends: 446494 [2025-03-08 06:26:12,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=430, Invalid=2020, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 06:26:12,196 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1241 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:12,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 1340 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:26:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446494 states. [2025-03-08 06:26:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446494 to 295928. [2025-03-08 06:26:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295928 states, 295927 states have (on average 1.310691488103485) internal successors, (387869), 295927 states have internal predecessors, (387869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295928 states to 295928 states and 387869 transitions. [2025-03-08 06:26:16,774 INFO L78 Accepts]: Start accepts. Automaton has 295928 states and 387869 transitions. Word has length 127 [2025-03-08 06:26:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:16,774 INFO L471 AbstractCegarLoop]: Abstraction has 295928 states and 387869 transitions. [2025-03-08 06:26:16,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.88888888888889) internal successors, (348), 27 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-03-08 06:26:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 295928 states and 387869 transitions. [2025-03-08 06:26:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 06:26:16,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:16,796 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:26:16,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:26:16,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:26:16,997 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-08 06:26:16,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:16,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1888874894, now seen corresponding path program 1 times [2025-03-08 06:26:16,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:16,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585978571] [2025-03-08 06:26:16,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:16,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:17,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 06:26:17,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 06:26:17,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:17,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat