./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_opt-floodmax.4.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 f0b874f952b04bd552cf5193202432516bc7223f89ff9f8a5e56321d84de32c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:21:41,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:21:41,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:21:41,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:21:41,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:21:41,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:21:41,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:21:41,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:21:41,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:21:41,652 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:21:41,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:21:41,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:21:41,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:21:41,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:21:41,654 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:21:41,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:21:41,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:21:41,654 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:21:41,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:21:41,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:21:41,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:21:41,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:21:41,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:21:41,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:21:41,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:21:41,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:21:41,655 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:21:41,655 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:21:41,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:21:41,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:21:41,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:21:41,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:21:41,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:21:41,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:21:41,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:21:41,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:21:41,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:21:41,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:21:41,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:21:41,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:21:41,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:21:41,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:21:41,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:21:41,656 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 -> f0b874f952b04bd552cf5193202432516bc7223f89ff9f8a5e56321d84de32c2 [2025-03-03 15:21:41,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:21:41,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:21:41,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:21:41,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:21:41,895 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:21:41,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-03 15:21:43,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e0edc4e/8b267c7769f544e789fa551088da4380/FLAGc58dc6371 [2025-03-03 15:21:43,529 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:21:43,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-03 15:21:43,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e0edc4e/8b267c7769f544e789fa551088da4380/FLAGc58dc6371 [2025-03-03 15:21:43,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e0edc4e/8b267c7769f544e789fa551088da4380 [2025-03-03 15:21:43,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:21:43,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:21:43,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:21:43,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:21:43,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:21:43,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:21:43" (1/1) ... [2025-03-03 15:21:43,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9fcaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:43, skipping insertion in model container [2025-03-03 15:21:43,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:21:43" (1/1) ... [2025-03-03 15:21:43,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:21:44,139 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34347,34360] [2025-03-03 15:21:44,151 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35237,35250] [2025-03-03 15:21:44,166 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37067,37080] [2025-03-03 15:21:44,175 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37957,37970] [2025-03-03 15:21:44,195 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[40730,40743] [2025-03-03 15:21:44,204 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41623,41636] [2025-03-03 15:21:44,219 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[43456,43469] [2025-03-03 15:21:44,231 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[44733,44746] [2025-03-03 15:21:44,321 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60386,60399] [2025-03-03 15:21:44,330 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61279,61292] [2025-03-03 15:21:44,344 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[63112,63125] [2025-03-03 15:21:44,376 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67569,67582] [2025-03-03 15:21:44,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:21:44,466 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:21:44,608 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34347,34360] [2025-03-03 15:21:44,616 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35237,35250] [2025-03-03 15:21:44,629 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37067,37080] [2025-03-03 15:21:44,637 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37957,37970] [2025-03-03 15:21:44,655 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[40730,40743] [2025-03-03 15:21:44,663 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41623,41636] [2025-03-03 15:21:44,676 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[43456,43469] [2025-03-03 15:21:44,686 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[44733,44746] [2025-03-03 15:21:44,771 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60386,60399] [2025-03-03 15:21:44,779 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61279,61292] [2025-03-03 15:21:44,792 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[63112,63125] [2025-03-03 15:21:44,819 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_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67569,67582] [2025-03-03 15:21:44,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:21:44,916 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:21:44,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44 WrapperNode [2025-03-03 15:21:44,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:21:44,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:21:44,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:21:44,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:21:44,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (1/1) ... [2025-03-03 15:21:44,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (1/1) ... [2025-03-03 15:21:45,031 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4294 [2025-03-03 15:21:45,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:21:45,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:21:45,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:21:45,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:21:45,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (1/1) ... [2025-03-03 15:21:45,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (1/1) ... [2025-03-03 15:21:45,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (1/1) ... [2025-03-03 15:21:45,093 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-03 15:21:45,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (1/1) ... [2025-03-03 15:21:45,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (1/1) ... [2025-03-03 15:21:45,134 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (1/1) ... [2025-03-03 15:21:45,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (1/1) ... [2025-03-03 15:21:45,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (1/1) ... [2025-03-03 15:21:45,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (1/1) ... [2025-03-03 15:21:45,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:21:45,188 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:21:45,188 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:21:45,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:21:45,189 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (1/1) ... [2025-03-03 15:21:45,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:21:45,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:21:45,216 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-03 15:21:45,221 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-03 15:21:45,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:21:45,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:21:45,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:21:45,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:21:45,398 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:21:45,400 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:21:47,617 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5126: havoc main_~check__tmp~21#1; [2025-03-03 15:21:47,617 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5000: havoc main_~check__tmp~20#1; [2025-03-03 15:21:47,617 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2228: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-03 15:21:47,617 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4739: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~18#1; [2025-03-03 15:21:47,617 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3022: havoc main_~check__tmp~13#1; [2025-03-03 15:21:47,618 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3552: havoc main_~node2____CPAchecker_TMP_2~3#1;havoc main_~node2____CPAchecker_TMP_1~3#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-03 15:21:47,618 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4612: havoc main_~node3__newmax~9#1; [2025-03-03 15:21:47,618 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4094: havoc main_~node4__newmax~10#1; [2025-03-03 15:21:47,619 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2906: havoc main_~node3__newmax~7#1; [2025-03-03 15:21:47,619 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2642: havoc main_~node4__newmax~8#1; [2025-03-03 15:21:47,619 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1852: havoc main_~node2__newmax~5#1; [2025-03-03 15:21:47,619 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4232: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2025-03-03 15:21:47,619 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2520: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1; [2025-03-03 15:21:47,619 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2393: havoc main_~node3__newmax~6#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3717: havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4785: havoc main_~check__tmp~19#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2147: havoc main_~node4__newmax~6#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4658: havoc main_~node4__newmax~12#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4002: havoc main_~node2__newmax~7#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2814: havoc main_~node1__newmax~6#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4930: havoc main_~node4__newmax~13#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2025: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2952: havoc main_~node4__newmax~9#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898: havoc main_~node3__newmax~5#1; [2025-03-03 15:21:47,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3222: havoc main_~node4____CPAchecker_TMP_2~3#1;havoc main_~node4____CPAchecker_TMP_1~3#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:21:47,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2439: havoc main_~node4__newmax~7#1; [2025-03-03 15:21:47,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4424: havoc main_~check__tmp~17#1; [2025-03-03 15:21:47,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2577: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-03-03 15:21:47,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4297: havoc main_~node4__newmax~11#1; [2025-03-03 15:21:47,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4175: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-03-03 15:21:47,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1; [2025-03-03 15:21:47,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3387: havoc main_~node3____CPAchecker_TMP_2~3#1;havoc main_~node3____CPAchecker_TMP_1~3#1;havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:21:47,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4048: havoc main_~node3__newmax~8#1; [2025-03-03 15:21:47,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2860: havoc main_~node2__newmax~6#1; [2025-03-03 15:21:47,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806: havoc main_~node1__newmax~5#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__newmax~4#1;havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__newmax~4#1;havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__newmax~4#1;havoc main_~node1__newmax~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node4__newmax~3#1;havoc main_~node3__newmax~3#1;havoc main_~node2__newmax~3#1;havoc main_~node1__newmax~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__newmax~2#1;havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__newmax~2#1;havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__newmax~2#1;havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__newmax~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__newmax~1#1;havoc main_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__newmax~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__newmax~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__newmax~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-03-03 15:21:47,622 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1944: havoc main_~node4__newmax~5#1; [2025-03-03 15:21:47,622 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2082: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-03 15:21:47,879 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-03 15:21:47,879 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:21:47,903 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:21:47,903 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:21:47,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:21:47 BoogieIcfgContainer [2025-03-03 15:21:47,904 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:21:47,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:21:47,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:21:47,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:21:47,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:21:43" (1/3) ... [2025-03-03 15:21:47,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f7d82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:21:47, skipping insertion in model container [2025-03-03 15:21:47,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:21:44" (2/3) ... [2025-03-03 15:21:47,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f7d82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:21:47, skipping insertion in model container [2025-03-03 15:21:47,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:21:47" (3/3) ... [2025-03-03 15:21:47,912 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-03 15:21:47,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:21:47,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 992 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-03 15:21:47,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:21:47,997 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;@34ea7920, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:21:47,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-03 15:21:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 992 states, 979 states have (on average 1.8181818181818181) internal successors, (1780), 991 states have internal predecessors, (1780), 0 states have call successors, (0), 0 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-03 15:21:48,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-03 15:21:48,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:48,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:21:48,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:21:48,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:48,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1219003841, now seen corresponding path program 1 times [2025-03-03 15:21:48,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:48,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926253617] [2025-03-03 15:21:48,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:48,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:48,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 15:21:48,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 15:21:48,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:48,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:48,922 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-03 15:21:48,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:48,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926253617] [2025-03-03 15:21:48,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926253617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:48,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:48,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:21:48,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172329359] [2025-03-03 15:21:48,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:48,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:21:48,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:48,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:21:48,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:21:48,950 INFO L87 Difference]: Start difference. First operand has 992 states, 979 states have (on average 1.8181818181818181) internal successors, (1780), 991 states have internal predecessors, (1780), 0 states have call successors, (0), 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 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 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-03 15:21:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:49,177 INFO L93 Difference]: Finished difference Result 1730 states and 3076 transitions. [2025-03-03 15:21:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:21:49,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 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) Word has length 316 [2025-03-03 15:21:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:49,198 INFO L225 Difference]: With dead ends: 1730 [2025-03-03 15:21:49,199 INFO L226 Difference]: Without dead ends: 1427 [2025-03-03 15:21:49,202 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-03 15:21:49,205 INFO L435 NwaCegarLoop]: 1975 mSDtfsCounter, 964 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 3268 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:49,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 3268 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:21:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-03-03 15:21:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1425. [2025-03-03 15:21:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1413 states have (on average 1.5435244161358812) internal successors, (2181), 1424 states have internal predecessors, (2181), 0 states have call successors, (0), 0 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-03 15:21:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2181 transitions. [2025-03-03 15:21:49,316 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 2181 transitions. Word has length 316 [2025-03-03 15:21:49,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:49,317 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 2181 transitions. [2025-03-03 15:21:49,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 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-03 15:21:49,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 2181 transitions. [2025-03-03 15:21:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-03 15:21:49,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:49,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:21:49,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:21:49,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:21:49,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1650101695, now seen corresponding path program 1 times [2025-03-03 15:21:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:49,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154093937] [2025-03-03 15:21:49,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:49,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 15:21:49,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 15:21:49,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:49,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:49,692 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-03 15:21:49,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:49,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154093937] [2025-03-03 15:21:49,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154093937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:49,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:49,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:21:49,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054266660] [2025-03-03 15:21:49,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:49,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:21:49,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:49,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:21:49,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:21:49,696 INFO L87 Difference]: Start difference. First operand 1425 states and 2181 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 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-03 15:21:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:49,866 INFO L93 Difference]: Finished difference Result 2738 states and 4241 transitions. [2025-03-03 15:21:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:21:49,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 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) Word has length 316 [2025-03-03 15:21:49,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:49,875 INFO L225 Difference]: With dead ends: 2738 [2025-03-03 15:21:49,875 INFO L226 Difference]: Without dead ends: 2325 [2025-03-03 15:21:49,877 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-03 15:21:49,878 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 814 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 2789 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:49,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 2789 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:21:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2025-03-03 15:21:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2323. [2025-03-03 15:21:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 2311 states have (on average 1.5469493725659889) internal successors, (3575), 2322 states have internal predecessors, (3575), 0 states have call successors, (0), 0 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-03 15:21:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3575 transitions. [2025-03-03 15:21:49,942 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3575 transitions. Word has length 316 [2025-03-03 15:21:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:49,942 INFO L471 AbstractCegarLoop]: Abstraction has 2323 states and 3575 transitions. [2025-03-03 15:21:49,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 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-03 15:21:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3575 transitions. [2025-03-03 15:21:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-03 15:21:49,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:49,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:21:49,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:21:49,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:21:49,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:49,950 INFO L85 PathProgramCache]: Analyzing trace with hash -816485119, now seen corresponding path program 1 times [2025-03-03 15:21:49,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:49,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887299035] [2025-03-03 15:21:49,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:49,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:49,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 15:21:50,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 15:21:50,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:50,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:50,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-03 15:21:50,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887299035] [2025-03-03 15:21:50,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887299035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:50,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:50,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:21:50,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388017217] [2025-03-03 15:21:50,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:50,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:21:50,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:50,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:21:50,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:50,880 INFO L87 Difference]: Start difference. First operand 2323 states and 3575 transitions. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 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-03 15:21:51,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:51,142 INFO L93 Difference]: Finished difference Result 11439 states and 17572 transitions. [2025-03-03 15:21:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:21:51,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 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) Word has length 316 [2025-03-03 15:21:51,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:51,171 INFO L225 Difference]: With dead ends: 11439 [2025-03-03 15:21:51,172 INFO L226 Difference]: Without dead ends: 9127 [2025-03-03 15:21:51,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:21:51,177 INFO L435 NwaCegarLoop]: 2463 mSDtfsCounter, 4670 mSDsluCounter, 3875 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4670 SdHoareTripleChecker+Valid, 6338 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:51,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4670 Valid, 6338 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:21:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2025-03-03 15:21:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 4460. [2025-03-03 15:21:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4460 states, 4448 states have (on average 1.54181654676259) internal successors, (6858), 4459 states have internal predecessors, (6858), 0 states have call successors, (0), 0 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-03 15:21:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4460 states to 4460 states and 6858 transitions. [2025-03-03 15:21:51,301 INFO L78 Accepts]: Start accepts. Automaton has 4460 states and 6858 transitions. Word has length 316 [2025-03-03 15:21:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:51,301 INFO L471 AbstractCegarLoop]: Abstraction has 4460 states and 6858 transitions. [2025-03-03 15:21:51,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 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-03 15:21:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4460 states and 6858 transitions. [2025-03-03 15:21:51,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-03 15:21:51,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:51,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:21:51,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:21:51,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:21:51,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:51,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2008238979, now seen corresponding path program 1 times [2025-03-03 15:21:51,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:51,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021860096] [2025-03-03 15:21:51,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:51,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:51,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-03 15:21:51,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-03 15:21:51,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:51,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:21:51,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:51,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021860096] [2025-03-03 15:21:51,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021860096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:51,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:51,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:21:51,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275487091] [2025-03-03 15:21:51,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:51,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:21:51,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:51,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:21:51,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:21:51,498 INFO L87 Difference]: Start difference. First operand 4460 states and 6858 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 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-03 15:21:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:51,650 INFO L93 Difference]: Finished difference Result 13087 states and 20070 transitions. [2025-03-03 15:21:51,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:21:51,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 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) Word has length 318 [2025-03-03 15:21:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:51,681 INFO L225 Difference]: With dead ends: 13087 [2025-03-03 15:21:51,681 INFO L226 Difference]: Without dead ends: 8752 [2025-03-03 15:21:51,689 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-03 15:21:51,692 INFO L435 NwaCegarLoop]: 2923 mSDtfsCounter, 1359 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 4357 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:51,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 4357 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:21:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8752 states. [2025-03-03 15:21:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8752 to 8634. [2025-03-03 15:21:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8634 states, 8622 states have (on average 1.5343307817211784) internal successors, (13229), 8633 states have internal predecessors, (13229), 0 states have call successors, (0), 0 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-03 15:21:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8634 states to 8634 states and 13229 transitions. [2025-03-03 15:21:51,896 INFO L78 Accepts]: Start accepts. Automaton has 8634 states and 13229 transitions. Word has length 318 [2025-03-03 15:21:51,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:51,898 INFO L471 AbstractCegarLoop]: Abstraction has 8634 states and 13229 transitions. [2025-03-03 15:21:51,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 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-03 15:21:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 8634 states and 13229 transitions. [2025-03-03 15:21:51,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-03 15:21:51,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:51,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:21:51,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:21:51,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:21:51,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash -500454408, now seen corresponding path program 1 times [2025-03-03 15:21:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:51,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289580191] [2025-03-03 15:21:51,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:51,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:51,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-03 15:21:51,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-03 15:21:51,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:51,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:52,043 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-03 15:21:52,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:52,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289580191] [2025-03-03 15:21:52,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289580191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:52,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:52,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:21:52,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433235962] [2025-03-03 15:21:52,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:52,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:21:52,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:52,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:21:52,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:21:52,045 INFO L87 Difference]: Start difference. First operand 8634 states and 13229 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 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-03 15:21:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:52,224 INFO L93 Difference]: Finished difference Result 25835 states and 39571 transitions. [2025-03-03 15:21:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:21:52,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 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) Word has length 318 [2025-03-03 15:21:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:52,263 INFO L225 Difference]: With dead ends: 25835 [2025-03-03 15:21:52,264 INFO L226 Difference]: Without dead ends: 17239 [2025-03-03 15:21:52,272 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-03 15:21:52,273 INFO L435 NwaCegarLoop]: 2982 mSDtfsCounter, 1488 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 4471 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:52,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 4471 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:21:52,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17239 states. [2025-03-03 15:21:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17239 to 8653. [2025-03-03 15:21:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8653 states, 8641 states have (on average 1.5341974308529105) internal successors, (13257), 8652 states have internal predecessors, (13257), 0 states have call successors, (0), 0 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-03 15:21:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8653 states to 8653 states and 13257 transitions. [2025-03-03 15:21:52,487 INFO L78 Accepts]: Start accepts. Automaton has 8653 states and 13257 transitions. Word has length 318 [2025-03-03 15:21:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:52,487 INFO L471 AbstractCegarLoop]: Abstraction has 8653 states and 13257 transitions. [2025-03-03 15:21:52,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 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-03 15:21:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 8653 states and 13257 transitions. [2025-03-03 15:21:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-03 15:21:52,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:52,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:21:52,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:21:52,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:21:52,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash -890273011, now seen corresponding path program 1 times [2025-03-03 15:21:52,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:52,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987529727] [2025-03-03 15:21:52,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:52,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:52,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-03 15:21:52,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-03 15:21:52,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:52,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:52,623 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-03 15:21:52,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:52,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987529727] [2025-03-03 15:21:52,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987529727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:52,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:52,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:21:52,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587273438] [2025-03-03 15:21:52,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:52,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:21:52,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:52,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:21:52,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:21:52,626 INFO L87 Difference]: Start difference. First operand 8653 states and 13257 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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-03 15:21:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:52,733 INFO L93 Difference]: Finished difference Result 17268 states and 26447 transitions. [2025-03-03 15:21:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:21:52,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 319 [2025-03-03 15:21:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:52,749 INFO L225 Difference]: With dead ends: 17268 [2025-03-03 15:21:52,749 INFO L226 Difference]: Without dead ends: 8671 [2025-03-03 15:21:52,756 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-03 15:21:52,757 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 5 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:52,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3009 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:21:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8671 states. [2025-03-03 15:21:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8671 to 8671. [2025-03-03 15:21:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8671 states, 8659 states have (on average 1.5334334218731955) internal successors, (13278), 8670 states have internal predecessors, (13278), 0 states have call successors, (0), 0 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-03 15:21:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8671 states to 8671 states and 13278 transitions. [2025-03-03 15:21:52,911 INFO L78 Accepts]: Start accepts. Automaton has 8671 states and 13278 transitions. Word has length 319 [2025-03-03 15:21:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:52,911 INFO L471 AbstractCegarLoop]: Abstraction has 8671 states and 13278 transitions. [2025-03-03 15:21:52,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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-03 15:21:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 8671 states and 13278 transitions. [2025-03-03 15:21:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-03 15:21:52,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:52,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:21:52,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:21:52,922 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:21:52,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash 616034490, now seen corresponding path program 1 times [2025-03-03 15:21:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:52,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496623467] [2025-03-03 15:21:52,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:52,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-03 15:21:52,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-03 15:21:52,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:52,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:53,081 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-03 15:21:53,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:53,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496623467] [2025-03-03 15:21:53,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496623467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:53,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:53,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:21:53,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157175754] [2025-03-03 15:21:53,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:53,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:21:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:53,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:21:53,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:21:53,082 INFO L87 Difference]: Start difference. First operand 8671 states and 13278 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 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-03 15:21:53,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:53,289 INFO L93 Difference]: Finished difference Result 25342 states and 38699 transitions. [2025-03-03 15:21:53,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:21:53,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 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) Word has length 320 [2025-03-03 15:21:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:53,321 INFO L225 Difference]: With dead ends: 25342 [2025-03-03 15:21:53,321 INFO L226 Difference]: Without dead ends: 16912 [2025-03-03 15:21:53,333 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-03 15:21:53,333 INFO L435 NwaCegarLoop]: 2930 mSDtfsCounter, 1353 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 4364 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:53,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 4364 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:21:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16912 states. [2025-03-03 15:21:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16912 to 16794. [2025-03-03 15:21:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16794 states, 16782 states have (on average 1.5236562984149684) internal successors, (25570), 16793 states have internal predecessors, (25570), 0 states have call successors, (0), 0 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-03 15:21:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16794 states to 16794 states and 25570 transitions. [2025-03-03 15:21:53,595 INFO L78 Accepts]: Start accepts. Automaton has 16794 states and 25570 transitions. Word has length 320 [2025-03-03 15:21:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:53,595 INFO L471 AbstractCegarLoop]: Abstraction has 16794 states and 25570 transitions. [2025-03-03 15:21:53,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 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-03 15:21:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 16794 states and 25570 transitions. [2025-03-03 15:21:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-03 15:21:53,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:53,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:21:53,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:21:53,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:21:53,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash -347185416, now seen corresponding path program 1 times [2025-03-03 15:21:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:53,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685336673] [2025-03-03 15:21:53,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:53,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-03 15:21:53,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-03 15:21:53,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:53,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:54,314 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-03 15:21:54,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:54,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685336673] [2025-03-03 15:21:54,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685336673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:54,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:54,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:21:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697824862] [2025-03-03 15:21:54,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:54,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:21:54,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:54,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:21:54,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:54,316 INFO L87 Difference]: Start difference. First operand 16794 states and 25570 transitions. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 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-03 15:21:54,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:54,610 INFO L93 Difference]: Finished difference Result 65502 states and 99420 transitions. [2025-03-03 15:21:54,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:21:54,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 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) Word has length 320 [2025-03-03 15:21:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:54,683 INFO L225 Difference]: With dead ends: 65502 [2025-03-03 15:21:54,683 INFO L226 Difference]: Without dead ends: 48884 [2025-03-03 15:21:54,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:54,702 INFO L435 NwaCegarLoop]: 2868 mSDtfsCounter, 3595 mSDsluCounter, 2830 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3595 SdHoareTripleChecker+Valid, 5698 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:54,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3595 Valid, 5698 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:21:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48884 states. [2025-03-03 15:21:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48884 to 32750. [2025-03-03 15:21:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32750 states, 32738 states have (on average 1.5126153094263548) internal successors, (49520), 32749 states have internal predecessors, (49520), 0 states have call successors, (0), 0 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-03 15:21:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32750 states to 32750 states and 49520 transitions. [2025-03-03 15:21:55,400 INFO L78 Accepts]: Start accepts. Automaton has 32750 states and 49520 transitions. Word has length 320 [2025-03-03 15:21:55,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:55,400 INFO L471 AbstractCegarLoop]: Abstraction has 32750 states and 49520 transitions. [2025-03-03 15:21:55,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 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-03 15:21:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 32750 states and 49520 transitions. [2025-03-03 15:21:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-03 15:21:55,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:21:55,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:21:55,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:21:55,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash -315500378, now seen corresponding path program 1 times [2025-03-03 15:21:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179595102] [2025-03-03 15:21:55,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:55,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-03 15:21:55,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-03 15:21:55,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:55,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:56,057 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-03 15:21:56,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:56,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179595102] [2025-03-03 15:21:56,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179595102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:56,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:56,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:21:56,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55211403] [2025-03-03 15:21:56,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:56,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:21:56,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:56,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:21:56,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:56,060 INFO L87 Difference]: Start difference. First operand 32750 states and 49520 transitions. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:56,213 INFO L93 Difference]: Finished difference Result 65454 states and 98986 transitions. [2025-03-03 15:21:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:21:56,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2025-03-03 15:21:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:56,273 INFO L225 Difference]: With dead ends: 65454 [2025-03-03 15:21:56,273 INFO L226 Difference]: Without dead ends: 33554 [2025-03-03 15:21:56,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:56,311 INFO L435 NwaCegarLoop]: 1617 mSDtfsCounter, 93 mSDsluCounter, 3106 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 4723 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:56,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 4723 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:21:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33554 states. [2025-03-03 15:21:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33554 to 33554. [2025-03-03 15:21:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33554 states, 33542 states have (on average 1.5171725001490668) internal successors, (50889), 33553 states have internal predecessors, (50889), 0 states have call successors, (0), 0 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-03 15:21:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33554 states to 33554 states and 50889 transitions. [2025-03-03 15:21:56,834 INFO L78 Accepts]: Start accepts. Automaton has 33554 states and 50889 transitions. Word has length 322 [2025-03-03 15:21:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:56,834 INFO L471 AbstractCegarLoop]: Abstraction has 33554 states and 50889 transitions. [2025-03-03 15:21:56,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 33554 states and 50889 transitions. [2025-03-03 15:21:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-03 15:21:56,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:56,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:21:56,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:21:56,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:21:56,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:56,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1492527019, now seen corresponding path program 1 times [2025-03-03 15:21:56,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:56,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480367393] [2025-03-03 15:21:56,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:56,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-03 15:21:56,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-03 15:21:56,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:56,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:57,034 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-03 15:21:57,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:57,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480367393] [2025-03-03 15:21:57,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480367393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:57,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:57,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:21:57,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470609663] [2025-03-03 15:21:57,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:57,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:21:57,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:57,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:21:57,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:21:57,036 INFO L87 Difference]: Start difference. First operand 33554 states and 50889 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:57,307 INFO L93 Difference]: Finished difference Result 98821 states and 149568 transitions. [2025-03-03 15:21:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:21:57,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2025-03-03 15:21:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:57,429 INFO L225 Difference]: With dead ends: 98821 [2025-03-03 15:21:57,429 INFO L226 Difference]: Without dead ends: 65665 [2025-03-03 15:21:57,470 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-03 15:21:57,471 INFO L435 NwaCegarLoop]: 2908 mSDtfsCounter, 1336 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 4334 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:57,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 4334 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:21:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65665 states. [2025-03-03 15:21:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65665 to 65563. [2025-03-03 15:21:58,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65563 states, 65551 states have (on average 1.505453768821223) internal successors, (98684), 65562 states have internal predecessors, (98684), 0 states have call successors, (0), 0 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-03 15:21:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65563 states to 65563 states and 98684 transitions. [2025-03-03 15:21:58,608 INFO L78 Accepts]: Start accepts. Automaton has 65563 states and 98684 transitions. Word has length 322 [2025-03-03 15:21:58,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:58,608 INFO L471 AbstractCegarLoop]: Abstraction has 65563 states and 98684 transitions. [2025-03-03 15:21:58,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 65563 states and 98684 transitions. [2025-03-03 15:21:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-03 15:21:58,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:58,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:21:58,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:21:58,657 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:21:58,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash -666714605, now seen corresponding path program 1 times [2025-03-03 15:21:58,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:58,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153154897] [2025-03-03 15:21:58,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:58,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:58,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-03 15:21:58,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-03 15:21:58,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:58,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:59,259 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-03 15:21:59,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153154897] [2025-03-03 15:21:59,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153154897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:59,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:59,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:21:59,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036390699] [2025-03-03 15:21:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:59,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:21:59,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:59,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:21:59,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:59,261 INFO L87 Difference]: Start difference. First operand 65563 states and 98684 transitions. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:59,737 INFO L93 Difference]: Finished difference Result 192928 states and 289537 transitions. [2025-03-03 15:21:59,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:21:59,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2025-03-03 15:21:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:59,904 INFO L225 Difference]: With dead ends: 192928 [2025-03-03 15:21:59,905 INFO L226 Difference]: Without dead ends: 130256 [2025-03-03 15:21:59,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:59,953 INFO L435 NwaCegarLoop]: 2960 mSDtfsCounter, 1447 mSDsluCounter, 4449 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 7409 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:59,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 7409 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130256 states. [2025-03-03 15:22:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130256 to 68304. [2025-03-03 15:22:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68304 states, 68292 states have (on average 1.5120804779476367) internal successors, (103263), 68303 states have internal predecessors, (103263), 0 states have call successors, (0), 0 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-03 15:22:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68304 states to 68304 states and 103263 transitions. [2025-03-03 15:22:01,356 INFO L78 Accepts]: Start accepts. Automaton has 68304 states and 103263 transitions. Word has length 322 [2025-03-03 15:22:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:01,356 INFO L471 AbstractCegarLoop]: Abstraction has 68304 states and 103263 transitions. [2025-03-03 15:22:01,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 68304 states and 103263 transitions. [2025-03-03 15:22:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-03 15:22:01,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:01,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:22:01,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:22:01,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:22:01,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:01,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1420001909, now seen corresponding path program 1 times [2025-03-03 15:22:01,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:01,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024772906] [2025-03-03 15:22:01,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:01,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:01,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-03 15:22:01,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-03 15:22:01,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:01,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:01,520 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-03 15:22:01,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:01,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024772906] [2025-03-03 15:22:01,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024772906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:01,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:01,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102353628] [2025-03-03 15:22:01,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:01,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:01,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:01,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:01,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:01,523 INFO L87 Difference]: Start difference. First operand 68304 states and 103263 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:02,064 INFO L93 Difference]: Finished difference Result 153050 states and 232749 transitions. [2025-03-03 15:22:02,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:02,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2025-03-03 15:22:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:02,171 INFO L225 Difference]: With dead ends: 153050 [2025-03-03 15:22:02,171 INFO L226 Difference]: Without dead ends: 94642 [2025-03-03 15:22:02,205 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-03 15:22:02,206 INFO L435 NwaCegarLoop]: 1859 mSDtfsCounter, 547 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 3146 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:02,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 3146 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94642 states. [2025-03-03 15:22:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94642 to 83568. [2025-03-03 15:22:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83568 states, 83556 states have (on average 1.5349585906457945) internal successors, (128255), 83567 states have internal predecessors, (128255), 0 states have call successors, (0), 0 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-03 15:22:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83568 states to 83568 states and 128255 transitions. [2025-03-03 15:22:03,638 INFO L78 Accepts]: Start accepts. Automaton has 83568 states and 128255 transitions. Word has length 323 [2025-03-03 15:22:03,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:03,639 INFO L471 AbstractCegarLoop]: Abstraction has 83568 states and 128255 transitions. [2025-03-03 15:22:03,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 83568 states and 128255 transitions. [2025-03-03 15:22:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-03 15:22:03,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:03,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:22:03,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:22:03,702 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:22:03,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash -448265905, now seen corresponding path program 1 times [2025-03-03 15:22:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:03,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772669889] [2025-03-03 15:22:03,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:03,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-03 15:22:03,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-03 15:22:03,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:03,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:22:03,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:03,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772669889] [2025-03-03 15:22:03,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772669889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:03,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:03,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:03,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863732902] [2025-03-03 15:22:03,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:03,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:03,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:03,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:03,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:03,864 INFO L87 Difference]: Start difference. First operand 83568 states and 128255 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:04,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:04,421 INFO L93 Difference]: Finished difference Result 229725 states and 350201 transitions. [2025-03-03 15:22:04,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:04,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2025-03-03 15:22:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:04,582 INFO L225 Difference]: With dead ends: 229725 [2025-03-03 15:22:04,582 INFO L226 Difference]: Without dead ends: 151577 [2025-03-03 15:22:04,651 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-03 15:22:04,652 INFO L435 NwaCegarLoop]: 2843 mSDtfsCounter, 1368 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 4266 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:04,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 4266 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:22:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151577 states. [2025-03-03 15:22:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151577 to 151469. [2025-03-03 15:22:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151469 states, 151457 states have (on average 1.5169388011118667) internal successors, (229751), 151468 states have internal predecessors, (229751), 0 states have call successors, (0), 0 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-03 15:22:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151469 states to 151469 states and 229751 transitions. [2025-03-03 15:22:06,756 INFO L78 Accepts]: Start accepts. Automaton has 151469 states and 229751 transitions. Word has length 324 [2025-03-03 15:22:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:06,756 INFO L471 AbstractCegarLoop]: Abstraction has 151469 states and 229751 transitions. [2025-03-03 15:22:06,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 151469 states and 229751 transitions. [2025-03-03 15:22:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-03 15:22:07,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:07,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:22:07,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:22:07,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:22:07,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:07,143 INFO L85 PathProgramCache]: Analyzing trace with hash 199482506, now seen corresponding path program 1 times [2025-03-03 15:22:07,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:07,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506478970] [2025-03-03 15:22:07,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:07,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:07,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-03 15:22:07,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-03 15:22:07,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:07,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:22:07,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:07,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506478970] [2025-03-03 15:22:07,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506478970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:07,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:07,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:07,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302316429] [2025-03-03 15:22:07,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:07,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:07,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:07,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:07,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:07,281 INFO L87 Difference]: Start difference. First operand 151469 states and 229751 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:08,458 INFO L93 Difference]: Finished difference Result 439463 states and 664029 transitions. [2025-03-03 15:22:08,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:08,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2025-03-03 15:22:08,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:08,866 INFO L225 Difference]: With dead ends: 439463 [2025-03-03 15:22:08,866 INFO L226 Difference]: Without dead ends: 295582 [2025-03-03 15:22:08,988 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-03 15:22:08,988 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 1346 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:08,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 2990 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295582 states. [2025-03-03 15:22:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295582 to 152913. [2025-03-03 15:22:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152913 states, 152901 states have (on average 1.5140188749583063) internal successors, (231495), 152912 states have internal predecessors, (231495), 0 states have call successors, (0), 0 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-03 15:22:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152913 states to 152913 states and 231495 transitions. [2025-03-03 15:22:12,386 INFO L78 Accepts]: Start accepts. Automaton has 152913 states and 231495 transitions. Word has length 324 [2025-03-03 15:22:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:12,386 INFO L471 AbstractCegarLoop]: Abstraction has 152913 states and 231495 transitions. [2025-03-03 15:22:12,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand 152913 states and 231495 transitions. [2025-03-03 15:22:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-03 15:22:12,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:22:12,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:22:12,473 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:22:12,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:12,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1508726565, now seen corresponding path program 1 times [2025-03-03 15:22:12,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:12,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093918289] [2025-03-03 15:22:12,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:12,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:12,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-03 15:22:12,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-03 15:22:12,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:12,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:12,621 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-03 15:22:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093918289] [2025-03-03 15:22:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093918289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:12,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:12,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665906803] [2025-03-03 15:22:12,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:12,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:12,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:12,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:12,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:12,623 INFO L87 Difference]: Start difference. First operand 152913 states and 231495 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:13,503 INFO L93 Difference]: Finished difference Result 298150 states and 450560 transitions. [2025-03-03 15:22:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:13,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2025-03-03 15:22:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:13,696 INFO L225 Difference]: With dead ends: 298150 [2025-03-03 15:22:13,696 INFO L226 Difference]: Without dead ends: 154509 [2025-03-03 15:22:13,764 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-03 15:22:13,764 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 7 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3002 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-03 15:22:13,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3002 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154509 states. [2025-03-03 15:22:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154509 to 152913. [2025-03-03 15:22:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152913 states, 152901 states have (on average 1.5140188749583063) internal successors, (231495), 152912 states have internal predecessors, (231495), 0 states have call successors, (0), 0 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-03 15:22:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152913 states to 152913 states and 231495 transitions. [2025-03-03 15:22:16,001 INFO L78 Accepts]: Start accepts. Automaton has 152913 states and 231495 transitions. Word has length 325 [2025-03-03 15:22:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:16,002 INFO L471 AbstractCegarLoop]: Abstraction has 152913 states and 231495 transitions. [2025-03-03 15:22:16,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 152913 states and 231495 transitions. [2025-03-03 15:22:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-03 15:22:16,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:16,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:22:16,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:22:16,082 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:22:16,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:16,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1439778742, now seen corresponding path program 1 times [2025-03-03 15:22:16,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:16,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444670048] [2025-03-03 15:22:16,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:16,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:16,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-03 15:22:16,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-03 15:22:16,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:16,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:16,835 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-03 15:22:16,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:16,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444670048] [2025-03-03 15:22:16,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444670048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:16,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:16,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:22:16,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614363136] [2025-03-03 15:22:16,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:16,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:22:16,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:16,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:22:16,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:22:16,839 INFO L87 Difference]: Start difference. First operand 152913 states and 231495 transitions. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:17,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:17,939 INFO L93 Difference]: Finished difference Result 444304 states and 671115 transitions. [2025-03-03 15:22:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:22:17,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 326 [2025-03-03 15:22:17,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:18,289 INFO L225 Difference]: With dead ends: 444304 [2025-03-03 15:22:18,289 INFO L226 Difference]: Without dead ends: 299675 [2025-03-03 15:22:18,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:22:18,374 INFO L435 NwaCegarLoop]: 2975 mSDtfsCounter, 1451 mSDsluCounter, 4461 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 7436 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:18,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 7436 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299675 states. [2025-03-03 15:22:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299675 to 157006. [2025-03-03 15:22:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157006 states, 156994 states have (on average 1.5133635680344473) internal successors, (237589), 157005 states have internal predecessors, (237589), 0 states have call successors, (0), 0 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-03 15:22:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157006 states to 157006 states and 237589 transitions. [2025-03-03 15:22:21,541 INFO L78 Accepts]: Start accepts. Automaton has 157006 states and 237589 transitions. Word has length 326 [2025-03-03 15:22:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:21,541 INFO L471 AbstractCegarLoop]: Abstraction has 157006 states and 237589 transitions. [2025-03-03 15:22:21,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 157006 states and 237589 transitions. [2025-03-03 15:22:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 15:22:21,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:21,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:22:21,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:22:21,620 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:22:21,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:21,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1886839947, now seen corresponding path program 1 times [2025-03-03 15:22:21,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:21,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785669664] [2025-03-03 15:22:21,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:21,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:21,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 15:22:21,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 15:22:21,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:21,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:22,301 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-03 15:22:22,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:22,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785669664] [2025-03-03 15:22:22,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785669664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:22,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:22,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:22:22,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163979425] [2025-03-03 15:22:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:22,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:22:22,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:22,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:22:22,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:22:22,305 INFO L87 Difference]: Start difference. First operand 157006 states and 237589 transitions. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:23,048 INFO L93 Difference]: Finished difference Result 286502 states and 432647 transitions. [2025-03-03 15:22:23,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:22:23,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 328 [2025-03-03 15:22:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:23,215 INFO L225 Difference]: With dead ends: 286502 [2025-03-03 15:22:23,215 INFO L226 Difference]: Without dead ends: 141134 [2025-03-03 15:22:23,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:22:23,337 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 88 mSDsluCounter, 3117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 4743 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:22:23,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 4743 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141134 states. [2025-03-03 15:22:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141134 to 139871. [2025-03-03 15:22:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139871 states, 139859 states have (on average 1.513288383300324) internal successors, (211647), 139870 states have internal predecessors, (211647), 0 states have call successors, (0), 0 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-03 15:22:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139871 states to 139871 states and 211647 transitions. [2025-03-03 15:22:25,319 INFO L78 Accepts]: Start accepts. Automaton has 139871 states and 211647 transitions. Word has length 328 [2025-03-03 15:22:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:22:25,320 INFO L471 AbstractCegarLoop]: Abstraction has 139871 states and 211647 transitions. [2025-03-03 15:22:25,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:22:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 139871 states and 211647 transitions. [2025-03-03 15:22:25,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-03 15:22:25,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:22:25,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:22:25,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:22:25,392 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:22:25,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:22:25,392 INFO L85 PathProgramCache]: Analyzing trace with hash -786639692, now seen corresponding path program 1 times [2025-03-03 15:22:25,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:22:25,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135525262] [2025-03-03 15:22:25,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:22:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:22:25,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-03 15:22:25,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-03 15:22:25,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:22:25,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:22:25,480 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-03 15:22:25,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:22:25,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135525262] [2025-03-03 15:22:25,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135525262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:22:25,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:22:25,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:22:25,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564948992] [2025-03-03 15:22:25,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:22:25,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:22:25,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:22:25,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:22:25,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:22:25,482 INFO L87 Difference]: Start difference. First operand 139871 states and 211647 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 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-03 15:22:26,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:22:26,473 INFO L93 Difference]: Finished difference Result 373781 states and 563804 transitions. [2025-03-03 15:22:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:22:26,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 331 [2025-03-03 15:22:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:22:26,773 INFO L225 Difference]: With dead ends: 373781 [2025-03-03 15:22:26,774 INFO L226 Difference]: Without dead ends: 248895 [2025-03-03 15:22:26,880 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-03 15:22:26,880 INFO L435 NwaCegarLoop]: 2842 mSDtfsCounter, 1350 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 4327 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-03 15:22:26,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 4327 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:22:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248895 states.