./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.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 c7aa3cc4b1f15d564db90712e4f440d0f111d49f542d9eda58173576bb757792 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:31:29,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:31:29,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:31:29,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:31:29,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:31:29,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:31:29,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:31:29,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:31:29,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:31:29,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:31:29,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:31:29,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:31:29,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:31:29,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:31:29,951 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:31:29,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:31:29,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:31:29,951 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:31:29,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:31:29,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:31:29,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:31:29,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:31:29,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:31:29,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:31:29,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:31:29,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:31:29,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:31:29,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:31:29,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:31:29,954 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 -> c7aa3cc4b1f15d564db90712e4f440d0f111d49f542d9eda58173576bb757792 [2025-03-16 19:31:30,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:31:30,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:31:30,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:31:30,198 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:31:30,199 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:31:30,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-16 19:31:31,398 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d145b3c7/33f8a4472be9451cb2029ab9d5b65bc7/FLAGe5568e476 [2025-03-16 19:31:31,699 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:31:31,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-16 19:31:31,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d145b3c7/33f8a4472be9451cb2029ab9d5b65bc7/FLAGe5568e476 [2025-03-16 19:31:31,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d145b3c7/33f8a4472be9451cb2029ab9d5b65bc7 [2025-03-16 19:31:31,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:31:31,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:31:31,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:31:31,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:31:31,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:31:31,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:31:31" (1/1) ... [2025-03-16 19:31:31,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7729889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:31, skipping insertion in model container [2025-03-16 19:31:31,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:31:31" (1/1) ... [2025-03-16 19:31:31,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:31:32,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9421,9434] [2025-03-16 19:31:32,190 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12913,12926] [2025-03-16 19:31:32,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14069,14082] [2025-03-16 19:31:32,198 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14725,14738] [2025-03-16 19:31:32,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16246,16259] [2025-03-16 19:31:32,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16902,16915] [2025-03-16 19:31:32,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_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17886,17899] [2025-03-16 19:31:32,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20224,20237] [2025-03-16 19:31:32,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20883,20896] [2025-03-16 19:31:32,232 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21907,21920] [2025-03-16 19:31:32,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23782,23795] [2025-03-16 19:31:32,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:31:32,316 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:31:32,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9421,9434] [2025-03-16 19:31:32,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12913,12926] [2025-03-16 19:31:32,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14069,14082] [2025-03-16 19:31:32,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_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14725,14738] [2025-03-16 19:31:32,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16246,16259] [2025-03-16 19:31:32,381 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16902,16915] [2025-03-16 19:31:32,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17886,17899] [2025-03-16 19:31:32,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20224,20237] [2025-03-16 19:31:32,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20883,20896] [2025-03-16 19:31:32,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21907,21920] [2025-03-16 19:31:32,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23782,23795] [2025-03-16 19:31:32,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:31:32,447 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:31:32,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32 WrapperNode [2025-03-16 19:31:32,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:31:32,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:31:32,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:31:32,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:31:32,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (1/1) ... [2025-03-16 19:31:32,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (1/1) ... [2025-03-16 19:31:32,521 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2022 [2025-03-16 19:31:32,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:31:32,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:31:32,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:31:32,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:31:32,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (1/1) ... [2025-03-16 19:31:32,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (1/1) ... [2025-03-16 19:31:32,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (1/1) ... [2025-03-16 19:31:32,564 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-16 19:31:32,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (1/1) ... [2025-03-16 19:31:32,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (1/1) ... [2025-03-16 19:31:32,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (1/1) ... [2025-03-16 19:31:32,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (1/1) ... [2025-03-16 19:31:32,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (1/1) ... [2025-03-16 19:31:32,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (1/1) ... [2025-03-16 19:31:32,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:31:32,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:31:32,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:31:32,619 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:31:32,619 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (1/1) ... [2025-03-16 19:31:32,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:31:32,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:31:32,646 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-16 19:31:32,652 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-16 19:31:32,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:31:32,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:31:32,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:31:32,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:31:32,815 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:31:32,817 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:31:33,924 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L927: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-16 19:31:33,925 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1886: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-16 19:31:33,926 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2316: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-03-16 19:31:33,926 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1094: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-16 19:31:33,926 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2812: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-16 19:31:33,926 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-03-16 19:31:33,926 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L434: havoc main_~node3__m3~2#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1293: havoc main_~node3__m3~4#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L403: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2386: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L504: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2156: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2586: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3016: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L836: havoc main_~node4__m4~3#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L704: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2455: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-16 19:31:33,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1399: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-16 19:31:33,928 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003: havoc main_~node4__m4~4#1; [2025-03-16 19:31:33,928 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2226: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-03-16 19:31:33,928 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1202: havoc main_~check__tmp~9#1; [2025-03-16 19:31:33,928 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1136: havoc main_~node4__m4~5#1; [2025-03-16 19:31:33,928 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1170: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-16 19:31:33,928 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3086: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-03-16 19:31:33,928 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2095: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: havoc main_~node3__m3~5#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L345: havoc main_~node4__m4~1#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2856: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1932: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L315: havoc main_~node2__m2~1#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L878: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc main_~node4__m4~2#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1308: havoc main_~node4__m4~6#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2795: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-16 19:31:33,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1442: havoc main_~node4__m4~7#1; [2025-03-16 19:31:33,930 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2632: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-16 19:31:33,930 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1509: havoc main_~check__tmp~13#1; [2025-03-16 19:31:33,930 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1476: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-16 19:31:33,930 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: havoc main_~node2__m2~2#1; [2025-03-16 19:31:33,930 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1278: havoc main_~node2__m2~3#1; [2025-03-16 19:31:33,930 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2272: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-16 19:31:33,930 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1711: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-03-16 19:31:33,930 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-16 19:31:33,930 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-16 19:31:33,930 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2472: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L788: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1350: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1648: havoc main_~check__tmp~15#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1582: havoc main_~node4__m4~8#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L988: havoc main_~node3__m3~3#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1616: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L196: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2112: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2046: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L230: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: havoc main_~node3__m3~1#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2676: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2025-03-16 19:31:33,931 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L299: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:31:33,991 INFO L? ?]: Removed 326 outVars from TransFormulas that were not future-live. [2025-03-16 19:31:33,992 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:31:34,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:31:34,014 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:31:34,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:31:34 BoogieIcfgContainer [2025-03-16 19:31:34,014 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:31:34,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:31:34,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:31:34,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:31:34,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:31:31" (1/3) ... [2025-03-16 19:31:34,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cb995e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:31:34, skipping insertion in model container [2025-03-16 19:31:34,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:31:32" (2/3) ... [2025-03-16 19:31:34,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cb995e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:31:34, skipping insertion in model container [2025-03-16 19:31:34,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:31:34" (3/3) ... [2025-03-16 19:31:34,021 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-16 19:31:34,033 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:31:34,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 357 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-03-16 19:31:34,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:31:34,093 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;@47fea45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:31:34,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-16 19:31:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 345 states have (on average 1.8405797101449275) internal successors, (635), 356 states have internal predecessors, (635), 0 states have call successors, (0), 0 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-16 19:31:34,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 19:31:34,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:34,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:34,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:34,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:34,125 INFO L85 PathProgramCache]: Analyzing trace with hash -800036927, now seen corresponding path program 1 times [2025-03-16 19:31:34,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:34,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103554003] [2025-03-16 19:31:34,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:34,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 19:31:34,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 19:31:34,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:34,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:34,603 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-16 19:31:34,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:34,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103554003] [2025-03-16 19:31:34,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103554003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:34,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:34,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:31:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244965760] [2025-03-16 19:31:34,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:34,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:31:34,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:34,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:31:34,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:31:34,628 INFO L87 Difference]: Start difference. First operand has 357 states, 345 states have (on average 1.8405797101449275) internal successors, (635), 356 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:34,966 INFO L93 Difference]: Finished difference Result 569 states and 973 transitions. [2025-03-16 19:31:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:31:34,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 19:31:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:34,980 INFO L225 Difference]: With dead ends: 569 [2025-03-16 19:31:34,981 INFO L226 Difference]: Without dead ends: 314 [2025-03-16 19:31:34,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:31:34,985 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 1503 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:34,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 403 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:34,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-16 19:31:35,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-16 19:31:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 303 states have (on average 1.2772277227722773) internal successors, (387), 313 states have internal predecessors, (387), 0 states have call successors, (0), 0 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-16 19:31:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 387 transitions. [2025-03-16 19:31:35,016 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 387 transitions. Word has length 58 [2025-03-16 19:31:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:35,016 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 387 transitions. [2025-03-16 19:31:35,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 387 transitions. [2025-03-16 19:31:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 19:31:35,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:35,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] [2025-03-16 19:31:35,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:31:35,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:35,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:35,024 INFO L85 PathProgramCache]: Analyzing trace with hash 124523992, now seen corresponding path program 1 times [2025-03-16 19:31:35,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:35,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817487722] [2025-03-16 19:31:35,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:35,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:35,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 19:31:35,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 19:31:35,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:35,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:35,208 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-16 19:31:35,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:35,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817487722] [2025-03-16 19:31:35,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817487722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:35,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:35,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:31:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322495346] [2025-03-16 19:31:35,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:35,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:31:35,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:35,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:31:35,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:31:35,211 INFO L87 Difference]: Start difference. First operand 314 states and 387 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:35,459 INFO L93 Difference]: Finished difference Result 651 states and 834 transitions. [2025-03-16 19:31:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:31:35,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 19:31:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:35,463 INFO L225 Difference]: With dead ends: 651 [2025-03-16 19:31:35,464 INFO L226 Difference]: Without dead ends: 407 [2025-03-16 19:31:35,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:31:35,465 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1342 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:35,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 312 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-16 19:31:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 365. [2025-03-16 19:31:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 354 states have (on average 1.3587570621468927) internal successors, (481), 364 states have internal predecessors, (481), 0 states have call successors, (0), 0 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-16 19:31:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 481 transitions. [2025-03-16 19:31:35,482 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 481 transitions. Word has length 59 [2025-03-16 19:31:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:35,482 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 481 transitions. [2025-03-16 19:31:35,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 481 transitions. [2025-03-16 19:31:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:31:35,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:35,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:35,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:31:35,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:35,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1475893657, now seen corresponding path program 1 times [2025-03-16 19:31:35,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209541854] [2025-03-16 19:31:35,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:35,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:35,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:31:35,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:31:35,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:35,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:35,649 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-16 19:31:35,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:35,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209541854] [2025-03-16 19:31:35,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209541854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:35,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:35,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:31:35,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532211407] [2025-03-16 19:31:35,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:35,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:31:35,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:35,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:31:35,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:31:35,651 INFO L87 Difference]: Start difference. First operand 365 states and 481 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:35,824 INFO L93 Difference]: Finished difference Result 660 states and 889 transitions. [2025-03-16 19:31:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:31:35,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 19:31:35,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:35,826 INFO L225 Difference]: With dead ends: 660 [2025-03-16 19:31:35,826 INFO L226 Difference]: Without dead ends: 346 [2025-03-16 19:31:35,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:31:35,828 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 913 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:35,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 198 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:31:35,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-16 19:31:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-03-16 19:31:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 335 states have (on average 1.3671641791044775) internal successors, (458), 345 states have internal predecessors, (458), 0 states have call successors, (0), 0 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-16 19:31:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 458 transitions. [2025-03-16 19:31:35,847 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 458 transitions. Word has length 60 [2025-03-16 19:31:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:35,847 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 458 transitions. [2025-03-16 19:31:35,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 458 transitions. [2025-03-16 19:31:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:31:35,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:35,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:35,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:31:35,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:35,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:35,849 INFO L85 PathProgramCache]: Analyzing trace with hash -817415056, now seen corresponding path program 1 times [2025-03-16 19:31:35,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:35,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015067595] [2025-03-16 19:31:35,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:35,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:35,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:31:35,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:31:35,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:35,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:35,989 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-16 19:31:35,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:35,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015067595] [2025-03-16 19:31:35,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015067595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:35,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:35,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:31:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487730482] [2025-03-16 19:31:35,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:35,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:31:35,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:35,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:31:35,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:31:35,993 INFO L87 Difference]: Start difference. First operand 346 states and 458 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:36,154 INFO L93 Difference]: Finished difference Result 641 states and 864 transitions. [2025-03-16 19:31:36,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:31:36,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 19:31:36,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:36,156 INFO L225 Difference]: With dead ends: 641 [2025-03-16 19:31:36,156 INFO L226 Difference]: Without dead ends: 338 [2025-03-16 19:31:36,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:31:36,157 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 870 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:36,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 194 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:31:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-16 19:31:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-03-16 19:31:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 337 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 447 transitions. [2025-03-16 19:31:36,165 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 447 transitions. Word has length 61 [2025-03-16 19:31:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:36,165 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 447 transitions. [2025-03-16 19:31:36,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 447 transitions. [2025-03-16 19:31:36,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:31:36,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:36,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:36,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:31:36,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:36,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1688435377, now seen corresponding path program 1 times [2025-03-16 19:31:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:36,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695766866] [2025-03-16 19:31:36,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:36,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:36,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:31:36,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:31:36,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:36,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:36,444 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-16 19:31:36,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:36,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695766866] [2025-03-16 19:31:36,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695766866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:36,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:36,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:31:36,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951352611] [2025-03-16 19:31:36,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:36,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:31:36,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:36,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:31:36,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:31:36,446 INFO L87 Difference]: Start difference. First operand 338 states and 447 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:36,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:36,836 INFO L93 Difference]: Finished difference Result 688 states and 912 transitions. [2025-03-16 19:31:36,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:31:36,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:31:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:36,838 INFO L225 Difference]: With dead ends: 688 [2025-03-16 19:31:36,840 INFO L226 Difference]: Without dead ends: 503 [2025-03-16 19:31:36,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:31:36,843 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 572 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:36,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 675 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:36,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-16 19:31:36,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 338. [2025-03-16 19:31:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.363914373088685) internal successors, (446), 337 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 446 transitions. [2025-03-16 19:31:36,854 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 446 transitions. Word has length 62 [2025-03-16 19:31:36,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:36,855 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 446 transitions. [2025-03-16 19:31:36,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 446 transitions. [2025-03-16 19:31:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:31:36,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:36,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:36,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:31:36,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:36,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:36,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1268541560, now seen corresponding path program 1 times [2025-03-16 19:31:36,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:36,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760078900] [2025-03-16 19:31:36,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:36,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:36,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:31:36,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:31:36,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:36,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:37,134 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-16 19:31:37,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:37,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760078900] [2025-03-16 19:31:37,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760078900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:37,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:37,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:37,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837016789] [2025-03-16 19:31:37,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:37,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:37,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:37,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:37,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:37,136 INFO L87 Difference]: Start difference. First operand 338 states and 446 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:37,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:37,592 INFO L93 Difference]: Finished difference Result 536 states and 729 transitions. [2025-03-16 19:31:37,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:31:37,592 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:31:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:37,595 INFO L225 Difference]: With dead ends: 536 [2025-03-16 19:31:37,595 INFO L226 Difference]: Without dead ends: 396 [2025-03-16 19:31:37,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:31:37,596 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 641 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:37,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1029 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-16 19:31:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 338. [2025-03-16 19:31:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3608562691131498) internal successors, (445), 337 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 445 transitions. [2025-03-16 19:31:37,607 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 445 transitions. Word has length 62 [2025-03-16 19:31:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:37,607 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 445 transitions. [2025-03-16 19:31:37,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 445 transitions. [2025-03-16 19:31:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:31:37,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:37,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:37,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:31:37,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:37,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1494962757, now seen corresponding path program 1 times [2025-03-16 19:31:37,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:37,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403067028] [2025-03-16 19:31:37,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:37,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:37,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:31:37,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:31:37,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:37,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:37,834 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-16 19:31:37,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:37,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403067028] [2025-03-16 19:31:37,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403067028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:37,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:37,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:37,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422033056] [2025-03-16 19:31:37,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:37,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:37,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:37,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:37,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:37,835 INFO L87 Difference]: Start difference. First operand 338 states and 445 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:38,233 INFO L93 Difference]: Finished difference Result 534 states and 702 transitions. [2025-03-16 19:31:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:31:38,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 19:31:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:38,236 INFO L225 Difference]: With dead ends: 534 [2025-03-16 19:31:38,236 INFO L226 Difference]: Without dead ends: 529 [2025-03-16 19:31:38,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:31:38,236 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1263 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:38,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 741 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:38,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-16 19:31:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2025-03-16 19:31:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3577981651376148) internal successors, (444), 337 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 444 transitions. [2025-03-16 19:31:38,245 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 444 transitions. Word has length 62 [2025-03-16 19:31:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:38,246 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 444 transitions. [2025-03-16 19:31:38,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 444 transitions. [2025-03-16 19:31:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:31:38,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:38,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:38,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:31:38,247 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:38,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:38,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1931071208, now seen corresponding path program 1 times [2025-03-16 19:31:38,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:38,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150383275] [2025-03-16 19:31:38,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:38,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:38,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:31:38,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:31:38,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:38,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:38,447 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-16 19:31:38,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:38,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150383275] [2025-03-16 19:31:38,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150383275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:38,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:38,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:38,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126225537] [2025-03-16 19:31:38,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:38,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:38,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:38,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:38,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:38,448 INFO L87 Difference]: Start difference. First operand 338 states and 444 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:38,879 INFO L93 Difference]: Finished difference Result 672 states and 909 transitions. [2025-03-16 19:31:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:38,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:31:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:38,881 INFO L225 Difference]: With dead ends: 672 [2025-03-16 19:31:38,881 INFO L226 Difference]: Without dead ends: 549 [2025-03-16 19:31:38,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:31:38,882 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 905 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:38,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1036 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:38,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-16 19:31:38,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 338. [2025-03-16 19:31:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3547400611620795) internal successors, (443), 337 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 443 transitions. [2025-03-16 19:31:38,889 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 443 transitions. Word has length 64 [2025-03-16 19:31:38,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:38,889 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 443 transitions. [2025-03-16 19:31:38,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 443 transitions. [2025-03-16 19:31:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:31:38,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:38,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:38,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:31:38,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:38,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash 129879834, now seen corresponding path program 1 times [2025-03-16 19:31:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:38,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538540942] [2025-03-16 19:31:38,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:38,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:31:38,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:31:38,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:38,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:39,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-16 19:31:39,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:39,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538540942] [2025-03-16 19:31:39,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538540942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:39,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:39,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:39,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291959653] [2025-03-16 19:31:39,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:39,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:39,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:39,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:39,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:39,082 INFO L87 Difference]: Start difference. First operand 338 states and 443 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:39,497 INFO L93 Difference]: Finished difference Result 640 states and 858 transitions. [2025-03-16 19:31:39,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:39,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:31:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:39,499 INFO L225 Difference]: With dead ends: 640 [2025-03-16 19:31:39,500 INFO L226 Difference]: Without dead ends: 529 [2025-03-16 19:31:39,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:31:39,500 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 1216 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:39,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 796 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-16 19:31:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2025-03-16 19:31:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3516819571865444) internal successors, (442), 337 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2025-03-16 19:31:39,509 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 64 [2025-03-16 19:31:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:39,509 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2025-03-16 19:31:39,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2025-03-16 19:31:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:31:39,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:39,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:39,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:31:39,510 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:39,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:39,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1968873741, now seen corresponding path program 1 times [2025-03-16 19:31:39,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:39,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004637360] [2025-03-16 19:31:39,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:39,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:39,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:31:39,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:31:39,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:39,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:39,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:39,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004637360] [2025-03-16 19:31:39,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004637360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:39,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:39,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:39,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649030348] [2025-03-16 19:31:39,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:39,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:39,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:39,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:39,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:39,757 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:40,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:40,187 INFO L93 Difference]: Finished difference Result 637 states and 854 transitions. [2025-03-16 19:31:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:40,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:31:40,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:40,190 INFO L225 Difference]: With dead ends: 637 [2025-03-16 19:31:40,190 INFO L226 Difference]: Without dead ends: 529 [2025-03-16 19:31:40,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:31:40,191 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 789 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:40,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 796 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-16 19:31:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2025-03-16 19:31:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.348623853211009) internal successors, (441), 337 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 441 transitions. [2025-03-16 19:31:40,200 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 441 transitions. Word has length 64 [2025-03-16 19:31:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:40,200 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 441 transitions. [2025-03-16 19:31:40,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 441 transitions. [2025-03-16 19:31:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:31:40,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:40,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:40,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:31:40,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:40,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1207193659, now seen corresponding path program 1 times [2025-03-16 19:31:40,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:40,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945765132] [2025-03-16 19:31:40,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:40,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:40,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:31:40,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:31:40,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:40,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:40,384 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-16 19:31:40,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:40,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945765132] [2025-03-16 19:31:40,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945765132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:40,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:40,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:40,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041243055] [2025-03-16 19:31:40,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:40,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:40,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:40,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:40,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:40,386 INFO L87 Difference]: Start difference. First operand 338 states and 441 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:40,779 INFO L93 Difference]: Finished difference Result 667 states and 898 transitions. [2025-03-16 19:31:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:40,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:31:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:40,781 INFO L225 Difference]: With dead ends: 667 [2025-03-16 19:31:40,781 INFO L226 Difference]: Without dead ends: 549 [2025-03-16 19:31:40,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:31:40,782 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 1173 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:40,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 891 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:40,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-16 19:31:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 338. [2025-03-16 19:31:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.345565749235474) internal successors, (440), 337 states have internal predecessors, (440), 0 states have call successors, (0), 0 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-16 19:31:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 440 transitions. [2025-03-16 19:31:40,789 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 440 transitions. Word has length 64 [2025-03-16 19:31:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:40,790 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 440 transitions. [2025-03-16 19:31:40,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 440 transitions. [2025-03-16 19:31:40,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:31:40,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:40,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:40,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:31:40,791 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:40,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:40,791 INFO L85 PathProgramCache]: Analyzing trace with hash 510170097, now seen corresponding path program 1 times [2025-03-16 19:31:40,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:40,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41804987] [2025-03-16 19:31:40,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:40,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:31:40,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:31:40,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:40,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:40,953 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-16 19:31:40,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41804987] [2025-03-16 19:31:40,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41804987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:40,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:40,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:40,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991726996] [2025-03-16 19:31:40,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:40,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:40,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:40,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:40,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:40,955 INFO L87 Difference]: Start difference. First operand 338 states and 440 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:41,294 INFO L93 Difference]: Finished difference Result 566 states and 762 transitions. [2025-03-16 19:31:41,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:41,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:31:41,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:41,296 INFO L225 Difference]: With dead ends: 566 [2025-03-16 19:31:41,296 INFO L226 Difference]: Without dead ends: 396 [2025-03-16 19:31:41,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:31:41,297 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 603 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:41,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 775 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-16 19:31:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 338. [2025-03-16 19:31:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 337 states have internal predecessors, (438), 0 states have call successors, (0), 0 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-16 19:31:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 438 transitions. [2025-03-16 19:31:41,304 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 438 transitions. Word has length 64 [2025-03-16 19:31:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:41,304 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 438 transitions. [2025-03-16 19:31:41,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 438 transitions. [2025-03-16 19:31:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:31:41,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:41,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:41,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:31:41,305 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:41,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1140352499, now seen corresponding path program 1 times [2025-03-16 19:31:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982740480] [2025-03-16 19:31:41,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:41,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:41,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:31:41,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:31:41,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:41,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:41,509 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-16 19:31:41,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:41,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982740480] [2025-03-16 19:31:41,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982740480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:41,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:41,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:41,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519148448] [2025-03-16 19:31:41,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:41,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:41,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:41,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:41,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:41,510 INFO L87 Difference]: Start difference. First operand 338 states and 438 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:42,016 INFO L93 Difference]: Finished difference Result 566 states and 742 transitions. [2025-03-16 19:31:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:31:42,017 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:31:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:42,019 INFO L225 Difference]: With dead ends: 566 [2025-03-16 19:31:42,019 INFO L226 Difference]: Without dead ends: 549 [2025-03-16 19:31:42,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:31:42,020 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 913 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:42,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1413 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:31:42,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-16 19:31:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 338. [2025-03-16 19:31:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3333333333333333) internal successors, (436), 337 states have internal predecessors, (436), 0 states have call successors, (0), 0 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-16 19:31:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 436 transitions. [2025-03-16 19:31:42,027 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 436 transitions. Word has length 64 [2025-03-16 19:31:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:42,027 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 436 transitions. [2025-03-16 19:31:42,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:42,028 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 436 transitions. [2025-03-16 19:31:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:31:42,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:42,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:42,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:31:42,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:42,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:42,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1093663755, now seen corresponding path program 1 times [2025-03-16 19:31:42,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:42,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978982383] [2025-03-16 19:31:42,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:42,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:42,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:31:42,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:31:42,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:42,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:42,184 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-16 19:31:42,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:42,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978982383] [2025-03-16 19:31:42,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978982383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:42,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:42,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:42,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972590390] [2025-03-16 19:31:42,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:42,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:42,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:42,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:42,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:42,185 INFO L87 Difference]: Start difference. First operand 338 states and 436 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:42,626 INFO L93 Difference]: Finished difference Result 534 states and 692 transitions. [2025-03-16 19:31:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:31:42,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 19:31:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:42,629 INFO L225 Difference]: With dead ends: 534 [2025-03-16 19:31:42,629 INFO L226 Difference]: Without dead ends: 529 [2025-03-16 19:31:42,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:31:42,630 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 1007 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:42,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 990 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-16 19:31:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2025-03-16 19:31:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.327217125382263) internal successors, (434), 337 states have internal predecessors, (434), 0 states have call successors, (0), 0 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-16 19:31:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 434 transitions. [2025-03-16 19:31:42,642 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 434 transitions. Word has length 64 [2025-03-16 19:31:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:42,642 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 434 transitions. [2025-03-16 19:31:42,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 434 transitions. [2025-03-16 19:31:42,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:31:42,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:42,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:42,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:31:42,644 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:42,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:42,645 INFO L85 PathProgramCache]: Analyzing trace with hash 944399544, now seen corresponding path program 1 times [2025-03-16 19:31:42,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:42,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739079107] [2025-03-16 19:31:42,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:42,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:42,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:31:42,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:31:42,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:42,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:43,162 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-16 19:31:43,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:43,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739079107] [2025-03-16 19:31:43,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739079107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:43,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:43,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:31:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398922057] [2025-03-16 19:31:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:43,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:31:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:43,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:31:43,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:31:43,164 INFO L87 Difference]: Start difference. First operand 338 states and 434 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:44,055 INFO L93 Difference]: Finished difference Result 934 states and 1239 transitions. [2025-03-16 19:31:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:31:44,056 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 19:31:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:44,058 INFO L225 Difference]: With dead ends: 934 [2025-03-16 19:31:44,058 INFO L226 Difference]: Without dead ends: 824 [2025-03-16 19:31:44,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:31:44,059 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 1356 mSDsluCounter, 2505 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 2841 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:44,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 2841 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:31:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-03-16 19:31:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 334. [2025-03-16 19:31:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 1.3240740740740742) internal successors, (429), 333 states have internal predecessors, (429), 0 states have call successors, (0), 0 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-16 19:31:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 429 transitions. [2025-03-16 19:31:44,069 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 429 transitions. Word has length 66 [2025-03-16 19:31:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:44,070 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 429 transitions. [2025-03-16 19:31:44,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 429 transitions. [2025-03-16 19:31:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:31:44,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:44,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:44,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:31:44,071 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:44,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:44,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1208108474, now seen corresponding path program 1 times [2025-03-16 19:31:44,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:44,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628539674] [2025-03-16 19:31:44,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:44,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:44,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:31:44,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:31:44,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:44,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:44,408 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-16 19:31:44,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:44,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628539674] [2025-03-16 19:31:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628539674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:44,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:44,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:31:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000961957] [2025-03-16 19:31:44,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:44,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:31:44,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:44,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:31:44,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:31:44,410 INFO L87 Difference]: Start difference. First operand 334 states and 429 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:44,747 INFO L93 Difference]: Finished difference Result 582 states and 778 transitions. [2025-03-16 19:31:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:31:44,747 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 19:31:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:44,749 INFO L225 Difference]: With dead ends: 582 [2025-03-16 19:31:44,749 INFO L226 Difference]: Without dead ends: 417 [2025-03-16 19:31:44,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:31:44,750 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 868 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:44,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1006 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:31:44,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-16 19:31:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 275. [2025-03-16 19:31:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 268 states have (on average 1.3320895522388059) internal successors, (357), 274 states have internal predecessors, (357), 0 states have call successors, (0), 0 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-16 19:31:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 357 transitions. [2025-03-16 19:31:44,756 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 357 transitions. Word has length 66 [2025-03-16 19:31:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:44,757 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 357 transitions. [2025-03-16 19:31:44,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 357 transitions. [2025-03-16 19:31:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:31:44,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:44,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:44,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:31:44,758 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:44,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1827153581, now seen corresponding path program 1 times [2025-03-16 19:31:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:44,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055535376] [2025-03-16 19:31:44,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:44,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:31:44,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:31:44,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:44,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:45,163 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-16 19:31:45,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055535376] [2025-03-16 19:31:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055535376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:45,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:45,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:31:45,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648127836] [2025-03-16 19:31:45,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:45,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:31:45,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:45,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:31:45,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:31:45,164 INFO L87 Difference]: Start difference. First operand 275 states and 357 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:45,660 INFO L93 Difference]: Finished difference Result 807 states and 1099 transitions. [2025-03-16 19:31:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:31:45,660 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 19:31:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:45,662 INFO L225 Difference]: With dead ends: 807 [2025-03-16 19:31:45,662 INFO L226 Difference]: Without dead ends: 699 [2025-03-16 19:31:45,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:31:45,663 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1583 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:45,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 1391 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-16 19:31:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 265. [2025-03-16 19:31:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 258 states have (on average 1.3255813953488371) internal successors, (342), 264 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 342 transitions. [2025-03-16 19:31:45,673 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 342 transitions. Word has length 66 [2025-03-16 19:31:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:45,673 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 342 transitions. [2025-03-16 19:31:45,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 342 transitions. [2025-03-16 19:31:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:31:45,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:45,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:45,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:31:45,674 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:45,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2091212043, now seen corresponding path program 1 times [2025-03-16 19:31:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:45,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345817469] [2025-03-16 19:31:45,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:45,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:45,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:31:45,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:31:45,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:45,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:46,054 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-16 19:31:46,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:46,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345817469] [2025-03-16 19:31:46,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345817469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:46,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:46,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:31:46,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189845447] [2025-03-16 19:31:46,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:46,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:31:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:46,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:31:46,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:31:46,055 INFO L87 Difference]: Start difference. First operand 265 states and 342 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:46,434 INFO L93 Difference]: Finished difference Result 437 states and 583 transitions. [2025-03-16 19:31:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:31:46,435 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 19:31:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:46,436 INFO L225 Difference]: With dead ends: 437 [2025-03-16 19:31:46,436 INFO L226 Difference]: Without dead ends: 405 [2025-03-16 19:31:46,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:31:46,436 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 427 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:46,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 2257 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:46,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-16 19:31:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 233. [2025-03-16 19:31:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.331877729257642) internal successors, (305), 232 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-16 19:31:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 305 transitions. [2025-03-16 19:31:46,440 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 305 transitions. Word has length 66 [2025-03-16 19:31:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:46,441 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 305 transitions. [2025-03-16 19:31:46,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 305 transitions. [2025-03-16 19:31:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:31:46,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:46,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:46,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:31:46,452 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:46,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:46,452 INFO L85 PathProgramCache]: Analyzing trace with hash 562415857, now seen corresponding path program 1 times [2025-03-16 19:31:46,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:46,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046310499] [2025-03-16 19:31:46,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:46,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:46,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:31:46,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:31:46,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:46,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:46,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:46,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046310499] [2025-03-16 19:31:46,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046310499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:46,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:46,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:31:46,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466537800] [2025-03-16 19:31:46,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:46,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:31:46,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:46,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:31:46,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:31:46,760 INFO L87 Difference]: Start difference. First operand 233 states and 305 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:47,132 INFO L93 Difference]: Finished difference Result 489 states and 676 transitions. [2025-03-16 19:31:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:31:47,132 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 19:31:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:47,133 INFO L225 Difference]: With dead ends: 489 [2025-03-16 19:31:47,133 INFO L226 Difference]: Without dead ends: 361 [2025-03-16 19:31:47,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:31:47,134 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 749 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:47,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1080 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:31:47,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-16 19:31:47,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 211. [2025-03-16 19:31:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 209 states have (on average 1.3157894736842106) internal successors, (275), 210 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-16 19:31:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 275 transitions. [2025-03-16 19:31:47,139 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 275 transitions. Word has length 66 [2025-03-16 19:31:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:47,139 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 275 transitions. [2025-03-16 19:31:47,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 275 transitions. [2025-03-16 19:31:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:31:47,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:47,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:47,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:31:47,140 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:47,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1488153188, now seen corresponding path program 1 times [2025-03-16 19:31:47,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:47,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314976377] [2025-03-16 19:31:47,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:47,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:47,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:31:47,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:31:47,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:47,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:47,384 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-16 19:31:47,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:47,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314976377] [2025-03-16 19:31:47,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314976377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:47,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:47,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:31:47,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483172803] [2025-03-16 19:31:47,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:47,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:31:47,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:47,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:31:47,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:31:47,385 INFO L87 Difference]: Start difference. First operand 211 states and 275 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:47,880 INFO L93 Difference]: Finished difference Result 861 states and 1211 transitions. [2025-03-16 19:31:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:31:47,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-16 19:31:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:47,882 INFO L225 Difference]: With dead ends: 861 [2025-03-16 19:31:47,882 INFO L226 Difference]: Without dead ends: 725 [2025-03-16 19:31:47,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:31:47,883 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 2050 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:47,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2050 Valid, 528 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:31:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-16 19:31:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 219. [2025-03-16 19:31:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 217 states have (on average 1.304147465437788) internal successors, (283), 218 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 283 transitions. [2025-03-16 19:31:47,889 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 283 transitions. Word has length 67 [2025-03-16 19:31:47,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:47,889 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 283 transitions. [2025-03-16 19:31:47,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 283 transitions. [2025-03-16 19:31:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:31:47,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:47,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:47,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:31:47,890 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:47,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:47,890 INFO L85 PathProgramCache]: Analyzing trace with hash 524498003, now seen corresponding path program 1 times [2025-03-16 19:31:47,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:47,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816253749] [2025-03-16 19:31:47,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:47,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:47,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:31:47,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:31:47,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:47,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:48,020 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-16 19:31:48,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:48,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816253749] [2025-03-16 19:31:48,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816253749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:48,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:48,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:31:48,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103394656] [2025-03-16 19:31:48,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:48,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:31:48,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:48,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:31:48,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:48,022 INFO L87 Difference]: Start difference. First operand 219 states and 283 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:48,300 INFO L93 Difference]: Finished difference Result 501 states and 681 transitions. [2025-03-16 19:31:48,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:31:48,301 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 19:31:48,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:48,302 INFO L225 Difference]: With dead ends: 501 [2025-03-16 19:31:48,302 INFO L226 Difference]: Without dead ends: 365 [2025-03-16 19:31:48,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:31:48,303 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 341 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:48,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 644 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-16 19:31:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 211. [2025-03-16 19:31:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 209 states have (on average 1.30622009569378) internal successors, (273), 210 states have internal predecessors, (273), 0 states have call successors, (0), 0 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-16 19:31:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 273 transitions. [2025-03-16 19:31:48,309 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 273 transitions. Word has length 68 [2025-03-16 19:31:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:48,309 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 273 transitions. [2025-03-16 19:31:48,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 273 transitions. [2025-03-16 19:31:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:31:48,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:48,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] [2025-03-16 19:31:48,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:31:48,310 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:48,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash -88729092, now seen corresponding path program 1 times [2025-03-16 19:31:48,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:48,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148222547] [2025-03-16 19:31:48,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:48,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:31:48,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:31:48,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:48,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:48,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:48,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148222547] [2025-03-16 19:31:48,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148222547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:48,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:48,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:31:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559441007] [2025-03-16 19:31:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:48,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:31:48,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:48,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:31:48,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:31:48,671 INFO L87 Difference]: Start difference. First operand 211 states and 273 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:49,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:49,155 INFO L93 Difference]: Finished difference Result 583 states and 807 transitions. [2025-03-16 19:31:49,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:31:49,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 19:31:49,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:49,159 INFO L225 Difference]: With dead ends: 583 [2025-03-16 19:31:49,159 INFO L226 Difference]: Without dead ends: 577 [2025-03-16 19:31:49,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:31:49,160 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 654 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:49,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1596 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:31:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-16 19:31:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 205. [2025-03-16 19:31:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.303921568627451) internal successors, (266), 204 states have internal predecessors, (266), 0 states have call successors, (0), 0 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-16 19:31:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 266 transitions. [2025-03-16 19:31:49,168 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 266 transitions. Word has length 69 [2025-03-16 19:31:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:49,168 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 266 transitions. [2025-03-16 19:31:49,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 266 transitions. [2025-03-16 19:31:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 19:31:49,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:49,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:49,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:31:49,170 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:49,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:49,170 INFO L85 PathProgramCache]: Analyzing trace with hash -178647089, now seen corresponding path program 1 times [2025-03-16 19:31:49,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:49,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479887524] [2025-03-16 19:31:49,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:49,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:49,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 19:31:49,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 19:31:49,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:49,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:49,266 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-16 19:31:49,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:49,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479887524] [2025-03-16 19:31:49,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479887524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:49,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:31:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295969740] [2025-03-16 19:31:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:49,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:31:49,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:49,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:31:49,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:31:49,268 INFO L87 Difference]: Start difference. First operand 205 states and 266 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:49,370 INFO L93 Difference]: Finished difference Result 1053 states and 1530 transitions. [2025-03-16 19:31:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:31:49,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-16 19:31:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:49,373 INFO L225 Difference]: With dead ends: 1053 [2025-03-16 19:31:49,373 INFO L226 Difference]: Without dead ends: 947 [2025-03-16 19:31:49,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:31:49,373 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 774 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:49,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1335 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:31:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-16 19:31:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 309. [2025-03-16 19:31:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.3603896103896105) internal successors, (419), 308 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 419 transitions. [2025-03-16 19:31:49,380 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 419 transitions. Word has length 92 [2025-03-16 19:31:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:49,380 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 419 transitions. [2025-03-16 19:31:49,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 419 transitions. [2025-03-16 19:31:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:31:49,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:49,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:49,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:31:49,381 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:49,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:49,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1381162123, now seen corresponding path program 1 times [2025-03-16 19:31:49,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:49,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262672800] [2025-03-16 19:31:49,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:49,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:49,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:31:49,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:31:49,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:49,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:49,455 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-16 19:31:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:49,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262672800] [2025-03-16 19:31:49,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262672800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:49,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:49,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:31:49,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560698683] [2025-03-16 19:31:49,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:49,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:31:49,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:49,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:31:49,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:31:49,458 INFO L87 Difference]: Start difference. First operand 309 states and 419 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:49,525 INFO L93 Difference]: Finished difference Result 1255 states and 1817 transitions. [2025-03-16 19:31:49,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:31:49,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-16 19:31:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:49,528 INFO L225 Difference]: With dead ends: 1255 [2025-03-16 19:31:49,528 INFO L226 Difference]: Without dead ends: 1045 [2025-03-16 19:31:49,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:31:49,529 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 578 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:49,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 845 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:49,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-03-16 19:31:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 517. [2025-03-16 19:31:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.4089147286821706) internal successors, (727), 516 states have internal predecessors, (727), 0 states have call successors, (0), 0 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-16 19:31:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 727 transitions. [2025-03-16 19:31:49,537 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 727 transitions. Word has length 94 [2025-03-16 19:31:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:49,537 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 727 transitions. [2025-03-16 19:31:49,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:49,537 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 727 transitions. [2025-03-16 19:31:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:31:49,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:49,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:49,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:31:49,538 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:49,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1244809259, now seen corresponding path program 1 times [2025-03-16 19:31:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334421392] [2025-03-16 19:31:49,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:49,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:31:49,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:31:49,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:49,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:49,611 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-16 19:31:49,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:49,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334421392] [2025-03-16 19:31:49,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334421392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:49,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:49,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:31:49,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104399939] [2025-03-16 19:31:49,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:49,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:31:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:49,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:31:49,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:31:49,612 INFO L87 Difference]: Start difference. First operand 517 states and 727 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:49,685 INFO L93 Difference]: Finished difference Result 1463 states and 2125 transitions. [2025-03-16 19:31:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:31:49,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-16 19:31:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:49,688 INFO L225 Difference]: With dead ends: 1463 [2025-03-16 19:31:49,689 INFO L226 Difference]: Without dead ends: 1253 [2025-03-16 19:31:49,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:31:49,689 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 578 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:49,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 787 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-03-16 19:31:49,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 829. [2025-03-16 19:31:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 1.434782608695652) internal successors, (1188), 828 states have internal predecessors, (1188), 0 states have call successors, (0), 0 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-16 19:31:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1188 transitions. [2025-03-16 19:31:49,706 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1188 transitions. Word has length 94 [2025-03-16 19:31:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:49,706 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1188 transitions. [2025-03-16 19:31:49,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1188 transitions. [2025-03-16 19:31:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:31:49,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:49,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:31:49,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:31:49,708 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:49,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:49,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1126661173, now seen corresponding path program 1 times [2025-03-16 19:31:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240863908] [2025-03-16 19:31:49,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:49,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:31:49,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:31:49,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:49,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:49,794 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-16 19:31:49,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:49,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240863908] [2025-03-16 19:31:49,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240863908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:49,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:49,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:31:49,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580667762] [2025-03-16 19:31:49,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:49,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:31:49,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:49,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:31:49,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:31:49,796 INFO L87 Difference]: Start difference. First operand 829 states and 1188 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:49,866 INFO L93 Difference]: Finished difference Result 1671 states and 2433 transitions. [2025-03-16 19:31:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:31:49,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-16 19:31:49,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:49,870 INFO L225 Difference]: With dead ends: 1671 [2025-03-16 19:31:49,870 INFO L226 Difference]: Without dead ends: 1461 [2025-03-16 19:31:49,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:31:49,870 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 624 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:49,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 757 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2025-03-16 19:31:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1037. [2025-03-16 19:31:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1036 states have (on average 1.444015444015444) internal successors, (1496), 1036 states have internal predecessors, (1496), 0 states have call successors, (0), 0 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-16 19:31:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1496 transitions. [2025-03-16 19:31:49,885 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1496 transitions. Word has length 94 [2025-03-16 19:31:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:49,885 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1496 transitions. [2025-03-16 19:31:49,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1496 transitions. [2025-03-16 19:31:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:31:49,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:49,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:49,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:31:49,886 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:49,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:49,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1359225677, now seen corresponding path program 1 times [2025-03-16 19:31:49,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:49,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810805887] [2025-03-16 19:31:49,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:49,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:49,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:31:49,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:31:49,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:49,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:50,008 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-16 19:31:50,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:50,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810805887] [2025-03-16 19:31:50,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810805887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:50,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:50,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:31:50,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942263811] [2025-03-16 19:31:50,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:50,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:31:50,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:50,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:31:50,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:31:50,010 INFO L87 Difference]: Start difference. First operand 1037 states and 1496 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:50,077 INFO L93 Difference]: Finished difference Result 1977 states and 2885 transitions. [2025-03-16 19:31:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:31:50,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-16 19:31:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:50,080 INFO L225 Difference]: With dead ends: 1977 [2025-03-16 19:31:50,080 INFO L226 Difference]: Without dead ends: 1039 [2025-03-16 19:31:50,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:31:50,081 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 264 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:50,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 377 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-03-16 19:31:50,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1037. [2025-03-16 19:31:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1036 states have (on average 1.4343629343629343) internal successors, (1486), 1036 states have internal predecessors, (1486), 0 states have call successors, (0), 0 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-16 19:31:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1486 transitions. [2025-03-16 19:31:50,092 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1486 transitions. Word has length 94 [2025-03-16 19:31:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:50,092 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1486 transitions. [2025-03-16 19:31:50,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1486 transitions. [2025-03-16 19:31:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:31:50,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:50,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:50,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:31:50,093 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:50,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:50,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1323208358, now seen corresponding path program 1 times [2025-03-16 19:31:50,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:50,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718047876] [2025-03-16 19:31:50,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:50,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:50,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:31:50,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:31:50,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:50,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:50,130 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-16 19:31:50,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:50,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718047876] [2025-03-16 19:31:50,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718047876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:50,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:50,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:31:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572936803] [2025-03-16 19:31:50,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:50,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:31:50,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:50,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:31:50,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:50,131 INFO L87 Difference]: Start difference. First operand 1037 states and 1486 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:50,150 INFO L93 Difference]: Finished difference Result 2797 states and 4048 transitions. [2025-03-16 19:31:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:31:50,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-16 19:31:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:50,155 INFO L225 Difference]: With dead ends: 2797 [2025-03-16 19:31:50,155 INFO L226 Difference]: Without dead ends: 1859 [2025-03-16 19:31:50,156 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-16 19:31:50,157 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 67 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:50,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 367 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2025-03-16 19:31:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1857. [2025-03-16 19:31:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1856 states have (on average 1.4186422413793103) internal successors, (2633), 1856 states have internal predecessors, (2633), 0 states have call successors, (0), 0 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-16 19:31:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2633 transitions. [2025-03-16 19:31:50,184 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2633 transitions. Word has length 94 [2025-03-16 19:31:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:50,184 INFO L471 AbstractCegarLoop]: Abstraction has 1857 states and 2633 transitions. [2025-03-16 19:31:50,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2633 transitions. [2025-03-16 19:31:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 19:31:50,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:50,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:50,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:31:50,186 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:50,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:50,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1043173227, now seen corresponding path program 1 times [2025-03-16 19:31:50,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:50,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498161813] [2025-03-16 19:31:50,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:50,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:50,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 19:31:50,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 19:31:50,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:50,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:50,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:50,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498161813] [2025-03-16 19:31:50,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498161813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:50,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:50,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:31:50,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285133601] [2025-03-16 19:31:50,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:50,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:31:50,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:50,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:31:50,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:31:50,270 INFO L87 Difference]: Start difference. First operand 1857 states and 2633 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:50,337 INFO L93 Difference]: Finished difference Result 3427 states and 4894 transitions. [2025-03-16 19:31:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:31:50,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-16 19:31:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:50,344 INFO L225 Difference]: With dead ends: 3427 [2025-03-16 19:31:50,344 INFO L226 Difference]: Without dead ends: 3035 [2025-03-16 19:31:50,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:31:50,346 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 589 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:50,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 803 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:50,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2025-03-16 19:31:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 2247. [2025-03-16 19:31:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2247 states, 2246 states have (on average 1.4216384683882457) internal successors, (3193), 2246 states have internal predecessors, (3193), 0 states have call successors, (0), 0 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-16 19:31:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3193 transitions. [2025-03-16 19:31:50,376 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3193 transitions. Word has length 94 [2025-03-16 19:31:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:50,376 INFO L471 AbstractCegarLoop]: Abstraction has 2247 states and 3193 transitions. [2025-03-16 19:31:50,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3193 transitions. [2025-03-16 19:31:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 19:31:50,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:50,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:31:50,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:31:50,378 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:50,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:50,379 INFO L85 PathProgramCache]: Analyzing trace with hash -784092389, now seen corresponding path program 1 times [2025-03-16 19:31:50,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:50,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931592249] [2025-03-16 19:31:50,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:50,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:50,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 19:31:50,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 19:31:50,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:50,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:50,455 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-16 19:31:50,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:50,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931592249] [2025-03-16 19:31:50,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931592249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:50,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:50,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:31:50,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113647448] [2025-03-16 19:31:50,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:50,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:31:50,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:50,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:31:50,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:50,457 INFO L87 Difference]: Start difference. First operand 2247 states and 3193 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:50,477 INFO L93 Difference]: Finished difference Result 5707 states and 8129 transitions. [2025-03-16 19:31:50,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:31:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-16 19:31:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:50,486 INFO L225 Difference]: With dead ends: 5707 [2025-03-16 19:31:50,486 INFO L226 Difference]: Without dead ends: 3559 [2025-03-16 19:31:50,488 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-16 19:31:50,489 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 78 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:50,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 342 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2025-03-16 19:31:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 3381. [2025-03-16 19:31:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.407396449704142) internal successors, (4757), 3380 states have internal predecessors, (4757), 0 states have call successors, (0), 0 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-16 19:31:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4757 transitions. [2025-03-16 19:31:50,540 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4757 transitions. Word has length 95 [2025-03-16 19:31:50,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:50,540 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4757 transitions. [2025-03-16 19:31:50,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:50,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4757 transitions. [2025-03-16 19:31:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 19:31:50,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:50,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:50,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:31:50,541 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:50,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1247395829, now seen corresponding path program 1 times [2025-03-16 19:31:50,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:50,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443003914] [2025-03-16 19:31:50,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:50,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:50,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 19:31:50,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 19:31:50,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:50,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:50,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:50,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443003914] [2025-03-16 19:31:50,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443003914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:50,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:50,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:31:50,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367446786] [2025-03-16 19:31:50,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:50,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:31:50,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:50,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:31:50,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:50,615 INFO L87 Difference]: Start difference. First operand 3381 states and 4757 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:50,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:50,644 INFO L93 Difference]: Finished difference Result 9681 states and 13593 transitions. [2025-03-16 19:31:50,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:31:50,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 19:31:50,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:50,669 INFO L225 Difference]: With dead ends: 9681 [2025-03-16 19:31:50,669 INFO L226 Difference]: Without dead ends: 6399 [2025-03-16 19:31:50,674 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-16 19:31:50,675 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 71 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:50,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 342 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6399 states. [2025-03-16 19:31:50,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6399 to 6133. [2025-03-16 19:31:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6133 states, 6132 states have (on average 1.393835616438356) internal successors, (8547), 6132 states have internal predecessors, (8547), 0 states have call successors, (0), 0 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-16 19:31:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6133 states to 6133 states and 8547 transitions. [2025-03-16 19:31:50,739 INFO L78 Accepts]: Start accepts. Automaton has 6133 states and 8547 transitions. Word has length 96 [2025-03-16 19:31:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:50,739 INFO L471 AbstractCegarLoop]: Abstraction has 6133 states and 8547 transitions. [2025-03-16 19:31:50,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6133 states and 8547 transitions. [2025-03-16 19:31:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 19:31:50,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:50,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:50,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:31:50,741 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:50,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:50,741 INFO L85 PathProgramCache]: Analyzing trace with hash 725260430, now seen corresponding path program 1 times [2025-03-16 19:31:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:50,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719521775] [2025-03-16 19:31:50,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:50,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:50,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 19:31:50,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 19:31:50,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:50,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:50,802 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-16 19:31:50,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:50,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719521775] [2025-03-16 19:31:50,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719521775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:50,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:50,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:31:50,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359013954] [2025-03-16 19:31:50,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:50,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:31:50,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:50,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:31:50,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:50,804 INFO L87 Difference]: Start difference. First operand 6133 states and 8547 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:50,837 INFO L93 Difference]: Finished difference Result 17673 states and 24501 transitions. [2025-03-16 19:31:50,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:31:50,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-16 19:31:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:50,854 INFO L225 Difference]: With dead ends: 17673 [2025-03-16 19:31:50,854 INFO L226 Difference]: Without dead ends: 11639 [2025-03-16 19:31:50,863 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-16 19:31:50,864 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 64 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:50,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 341 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11639 states. [2025-03-16 19:31:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11639 to 11109. [2025-03-16 19:31:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11109 states, 11108 states have (on average 1.3745948865682391) internal successors, (15269), 11108 states have internal predecessors, (15269), 0 states have call successors, (0), 0 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-16 19:31:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11109 states to 11109 states and 15269 transitions. [2025-03-16 19:31:51,045 INFO L78 Accepts]: Start accepts. Automaton has 11109 states and 15269 transitions. Word has length 97 [2025-03-16 19:31:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:51,045 INFO L471 AbstractCegarLoop]: Abstraction has 11109 states and 15269 transitions. [2025-03-16 19:31:51,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 11109 states and 15269 transitions. [2025-03-16 19:31:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:31:51,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:51,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:51,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:31:51,046 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:51,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:51,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1102203230, now seen corresponding path program 1 times [2025-03-16 19:31:51,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:51,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019795562] [2025-03-16 19:31:51,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:51,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:51,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:31:51,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:31:51,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:51,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:51,112 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-16 19:31:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:51,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019795562] [2025-03-16 19:31:51,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019795562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:51,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:51,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:31:51,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258315141] [2025-03-16 19:31:51,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:51,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:31:51,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:51,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:31:51,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:51,113 INFO L87 Difference]: Start difference. First operand 11109 states and 15269 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:51,166 INFO L93 Difference]: Finished difference Result 32073 states and 43743 transitions. [2025-03-16 19:31:51,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:31:51,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-16 19:31:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:51,195 INFO L225 Difference]: With dead ends: 32073 [2025-03-16 19:31:51,195 INFO L226 Difference]: Without dead ends: 21063 [2025-03-16 19:31:51,209 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-16 19:31:51,210 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 54 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 339 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-16 19:31:51,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 339 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:51,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21063 states. [2025-03-16 19:31:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21063 to 20005. [2025-03-16 19:31:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20005 states, 20004 states have (on average 1.3495800839832033) internal successors, (26997), 20004 states have internal predecessors, (26997), 0 states have call successors, (0), 0 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-16 19:31:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20005 states to 20005 states and 26997 transitions. [2025-03-16 19:31:51,420 INFO L78 Accepts]: Start accepts. Automaton has 20005 states and 26997 transitions. Word has length 98 [2025-03-16 19:31:51,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:51,421 INFO L471 AbstractCegarLoop]: Abstraction has 20005 states and 26997 transitions. [2025-03-16 19:31:51,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:51,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20005 states and 26997 transitions. [2025-03-16 19:31:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:31:51,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:51,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:31:51,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:31:51,422 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:51,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1478630657, now seen corresponding path program 1 times [2025-03-16 19:31:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:51,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185217766] [2025-03-16 19:31:51,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:51,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:51,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:31:51,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:31:51,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:51,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:51,622 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-16 19:31:51,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:51,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185217766] [2025-03-16 19:31:51,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185217766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:51,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:51,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:31:51,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957006943] [2025-03-16 19:31:51,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:51,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:31:51,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:51,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:31:51,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:31:51,623 INFO L87 Difference]: Start difference. First operand 20005 states and 26997 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:51,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:51,679 INFO L93 Difference]: Finished difference Result 20487 states and 27638 transitions. [2025-03-16 19:31:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:31:51,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 19:31:51,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:51,708 INFO L225 Difference]: With dead ends: 20487 [2025-03-16 19:31:51,709 INFO L226 Difference]: Without dead ends: 20485 [2025-03-16 19:31:51,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:31:51,716 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:51,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 758 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:51,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20485 states. [2025-03-16 19:31:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20485 to 20485. [2025-03-16 19:31:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20485 states, 20484 states have (on average 1.3320152314001172) internal successors, (27285), 20484 states have internal predecessors, (27285), 0 states have call successors, (0), 0 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-16 19:31:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20485 states to 20485 states and 27285 transitions. [2025-03-16 19:31:51,898 INFO L78 Accepts]: Start accepts. Automaton has 20485 states and 27285 transitions. Word has length 99 [2025-03-16 19:31:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:51,898 INFO L471 AbstractCegarLoop]: Abstraction has 20485 states and 27285 transitions. [2025-03-16 19:31:51,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 20485 states and 27285 transitions. [2025-03-16 19:31:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:31:51,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:51,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:51,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:31:51,899 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:51,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash 480304456, now seen corresponding path program 1 times [2025-03-16 19:31:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:51,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28636271] [2025-03-16 19:31:51,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:51,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:31:51,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:31:51,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:51,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:51,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28636271] [2025-03-16 19:31:51,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28636271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:31:51,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:31:51,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:31:51,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664559554] [2025-03-16 19:31:51,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:31:51,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:31:51,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:51,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:31:51,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:31:51,979 INFO L87 Difference]: Start difference. First operand 20485 states and 27285 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:52,053 INFO L93 Difference]: Finished difference Result 41513 states and 55327 transitions. [2025-03-16 19:31:52,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:31:52,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 19:31:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:52,086 INFO L225 Difference]: With dead ends: 41513 [2025-03-16 19:31:52,087 INFO L226 Difference]: Without dead ends: 21127 [2025-03-16 19:31:52,109 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-16 19:31:52,110 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 87 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:52,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 281 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:31:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21127 states. [2025-03-16 19:31:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21127 to 21125. [2025-03-16 19:31:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21125 states, 21124 states have (on average 1.3151391781859496) internal successors, (27781), 21124 states have internal predecessors, (27781), 0 states have call successors, (0), 0 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-16 19:31:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21125 states to 21125 states and 27781 transitions. [2025-03-16 19:31:52,320 INFO L78 Accepts]: Start accepts. Automaton has 21125 states and 27781 transitions. Word has length 99 [2025-03-16 19:31:52,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:52,321 INFO L471 AbstractCegarLoop]: Abstraction has 21125 states and 27781 transitions. [2025-03-16 19:31:52,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:31:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 21125 states and 27781 transitions. [2025-03-16 19:31:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 19:31:52,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:52,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:52,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:31:52,326 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:52,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:52,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1820474241, now seen corresponding path program 1 times [2025-03-16 19:31:52,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:52,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788947751] [2025-03-16 19:31:52,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:52,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:52,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:31:52,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:31:52,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:52,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:52,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:52,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788947751] [2025-03-16 19:31:52,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788947751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:31:52,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740950970] [2025-03-16 19:31:52,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:52,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:31:52,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:31:52,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:31:52,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:31:52,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:31:52,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:31:52,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:52,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:52,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:31:52,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:31:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:53,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:31:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:54,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740950970] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:31:54,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:31:54,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2025-03-16 19:31:54,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417071232] [2025-03-16 19:31:54,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:31:54,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 19:31:54,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:54,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 19:31:54,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:31:54,768 INFO L87 Difference]: Start difference. First operand 21125 states and 27781 transitions. Second operand has 25 states, 25 states have (on average 12.72) internal successors, (318), 24 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-16 19:31:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:31:56,344 INFO L93 Difference]: Finished difference Result 106397 states and 139064 transitions. [2025-03-16 19:31:56,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-16 19:31:56,345 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 12.72) internal successors, (318), 24 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 126 [2025-03-16 19:31:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:31:56,466 INFO L225 Difference]: With dead ends: 106397 [2025-03-16 19:31:56,466 INFO L226 Difference]: Without dead ends: 85371 [2025-03-16 19:31:56,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=810, Invalid=2850, Unknown=0, NotChecked=0, Total=3660 [2025-03-16 19:31:56,490 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 2601 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2601 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:31:56,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2601 Valid, 1387 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:31:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85371 states. [2025-03-16 19:31:57,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85371 to 44891. [2025-03-16 19:31:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44891 states, 44890 states have (on average 1.306014702606371) internal successors, (58627), 44890 states have internal predecessors, (58627), 0 states have call successors, (0), 0 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-16 19:31:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44891 states to 44891 states and 58627 transitions. [2025-03-16 19:31:57,324 INFO L78 Accepts]: Start accepts. Automaton has 44891 states and 58627 transitions. Word has length 126 [2025-03-16 19:31:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:31:57,324 INFO L471 AbstractCegarLoop]: Abstraction has 44891 states and 58627 transitions. [2025-03-16 19:31:57,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.72) internal successors, (318), 24 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-16 19:31:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 44891 states and 58627 transitions. [2025-03-16 19:31:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 19:31:57,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:31:57,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:31:57,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:31:57,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-16 19:31:57,537 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:31:57,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:31:57,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1298403752, now seen corresponding path program 1 times [2025-03-16 19:31:57,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:31:57,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219631227] [2025-03-16 19:31:57,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:57,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:31:57,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 19:31:57,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 19:31:57,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:57,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:58,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:31:58,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219631227] [2025-03-16 19:31:58,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219631227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:31:58,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451921125] [2025-03-16 19:31:58,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:31:58,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:31:58,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:31:58,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:31:58,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:31:58,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 19:31:58,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 19:31:58,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:31:58,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:31:58,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 19:31:58,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:31:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:58,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:31:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:31:59,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451921125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:31:59,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:31:59,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 27 [2025-03-16 19:31:59,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826772478] [2025-03-16 19:31:59,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:31:59,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 19:31:59,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:31:59,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 19:31:59,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:31:59,115 INFO L87 Difference]: Start difference. First operand 44891 states and 58627 transitions. Second operand has 27 states, 27 states have (on average 12.74074074074074) internal successors, (344), 27 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-16 19:32:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:05,058 INFO L93 Difference]: Finished difference Result 276125 states and 360886 transitions. [2025-03-16 19:32:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2025-03-16 19:32:05,059 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 12.74074074074074) internal successors, (344), 27 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-03-16 19:32:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:05,316 INFO L225 Difference]: With dead ends: 276125 [2025-03-16 19:32:05,316 INFO L226 Difference]: Without dead ends: 231347 [2025-03-16 19:32:05,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5864 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2867, Invalid=16315, Unknown=0, NotChecked=0, Total=19182 [2025-03-16 19:32:05,366 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 3063 mSDsluCounter, 2921 mSDsCounter, 0 mSdLazyCounter, 3979 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3063 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 4033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 3979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:05,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3063 Valid, 3100 Invalid, 4033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 3979 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 19:32:05,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231347 states. [2025-03-16 19:32:07,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231347 to 162923. [2025-03-16 19:32:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162923 states, 162922 states have (on average 1.3024821693816673) internal successors, (212203), 162922 states have internal predecessors, (212203), 0 states have call successors, (0), 0 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-16 19:32:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162923 states to 162923 states and 212203 transitions. [2025-03-16 19:32:07,508 INFO L78 Accepts]: Start accepts. Automaton has 162923 states and 212203 transitions. Word has length 127 [2025-03-16 19:32:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:07,508 INFO L471 AbstractCegarLoop]: Abstraction has 162923 states and 212203 transitions. [2025-03-16 19:32:07,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.74074074074074) internal successors, (344), 27 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-16 19:32:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 162923 states and 212203 transitions. [2025-03-16 19:32:07,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 19:32:07,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:07,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:07,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:32:07,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-16 19:32:07,724 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:07,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:07,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1613306784, now seen corresponding path program 1 times [2025-03-16 19:32:07,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:07,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417215206] [2025-03-16 19:32:07,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:07,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:07,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 19:32:07,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 19:32:07,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:07,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 19:32:07,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:07,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417215206] [2025-03-16 19:32:07,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417215206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:07,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:07,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:32:07,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790574352] [2025-03-16 19:32:07,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:07,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:32:07,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:07,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:32:07,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:32:07,780 INFO L87 Difference]: Start difference. First operand 162923 states and 212203 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-16 19:32:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:09,125 INFO L93 Difference]: Finished difference Result 433818 states and 563331 transitions. [2025-03-16 19:32:09,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:32:09,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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 128 [2025-03-16 19:32:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:09,757 INFO L225 Difference]: With dead ends: 433818 [2025-03-16 19:32:09,761 INFO L226 Difference]: Without dead ends: 271060 [2025-03-16 19:32:09,877 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-16 19:32:09,879 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 103 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:09,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 288 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271060 states. [2025-03-16 19:32:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271060 to 161667. [2025-03-16 19:32:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161667 states, 161666 states have (on average 1.2971496789677484) internal successors, (209705), 161666 states have internal predecessors, (209705), 0 states have call successors, (0), 0 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-16 19:32:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161667 states to 161667 states and 209705 transitions. [2025-03-16 19:32:12,291 INFO L78 Accepts]: Start accepts. Automaton has 161667 states and 209705 transitions. Word has length 128 [2025-03-16 19:32:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:12,291 INFO L471 AbstractCegarLoop]: Abstraction has 161667 states and 209705 transitions. [2025-03-16 19:32:12,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-16 19:32:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 161667 states and 209705 transitions. [2025-03-16 19:32:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 19:32:12,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:12,302 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:12,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:32:12,302 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:12,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:12,303 INFO L85 PathProgramCache]: Analyzing trace with hash 206183999, now seen corresponding path program 1 times [2025-03-16 19:32:12,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:12,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56725718] [2025-03-16 19:32:12,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:12,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:12,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 19:32:12,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 19:32:12,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:12,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 19:32:12,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56725718] [2025-03-16 19:32:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56725718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:12,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:12,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:32:12,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867773890] [2025-03-16 19:32:12,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:12,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:32:12,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:12,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:32:12,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:32:12,669 INFO L87 Difference]: Start difference. First operand 161667 states and 209705 transitions. Second operand has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-16 19:32:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:14,340 INFO L93 Difference]: Finished difference Result 523841 states and 674459 transitions. [2025-03-16 19:32:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:32:14,340 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 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 128 [2025-03-16 19:32:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:14,729 INFO L225 Difference]: With dead ends: 523841 [2025-03-16 19:32:14,729 INFO L226 Difference]: Without dead ends: 362301 [2025-03-16 19:32:14,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:32:14,785 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1327 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:14,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 760 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:32:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362301 states. [2025-03-16 19:32:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362301 to 161683. [2025-03-16 19:32:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161683 states, 161682 states have (on average 1.2971202731287341) internal successors, (209721), 161682 states have internal predecessors, (209721), 0 states have call successors, (0), 0 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-16 19:32:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161683 states to 161683 states and 209721 transitions. [2025-03-16 19:32:17,473 INFO L78 Accepts]: Start accepts. Automaton has 161683 states and 209721 transitions. Word has length 128 [2025-03-16 19:32:17,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:17,473 INFO L471 AbstractCegarLoop]: Abstraction has 161683 states and 209721 transitions. [2025-03-16 19:32:17,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.818181818181818) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 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-16 19:32:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 161683 states and 209721 transitions. [2025-03-16 19:32:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 19:32:17,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:17,484 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:17,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:32:17,485 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:17,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash 519975477, now seen corresponding path program 1 times [2025-03-16 19:32:17,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:17,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129713568] [2025-03-16 19:32:17,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:17,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:17,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 19:32:17,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 19:32:17,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:17,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:17,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:17,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129713568] [2025-03-16 19:32:17,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129713568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:32:17,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772317453] [2025-03-16 19:32:17,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:17,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:32:17,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:32:17,720 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:32:17,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:32:17,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 19:32:17,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 19:32:17,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:17,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:17,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:32:17,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:32:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:18,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:32:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:19,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772317453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:32:19,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:32:19,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2025-03-16 19:32:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019728635] [2025-03-16 19:32:19,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:32:19,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 19:32:19,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:19,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 19:32:19,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:32:19,239 INFO L87 Difference]: Start difference. First operand 161683 states and 209721 transitions. Second operand has 28 states, 28 states have (on average 12.75) internal successors, (357), 28 states have internal predecessors, (357), 0 states have call successors, (0), 0 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-16 19:32:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:26,376 INFO L93 Difference]: Finished difference Result 727452 states and 938265 transitions. [2025-03-16 19:32:26,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2025-03-16 19:32:26,377 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 12.75) internal successors, (357), 28 states have internal predecessors, (357), 0 states have call successors, (0), 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 129 [2025-03-16 19:32:26,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:27,115 INFO L225 Difference]: With dead ends: 727452 [2025-03-16 19:32:27,115 INFO L226 Difference]: Without dead ends: 565936 [2025-03-16 19:32:27,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11749 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4744, Invalid=26762, Unknown=0, NotChecked=0, Total=31506 [2025-03-16 19:32:27,212 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 3131 mSDsluCounter, 3256 mSDsCounter, 0 mSdLazyCounter, 4605 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3131 SdHoareTripleChecker+Valid, 3479 SdHoareTripleChecker+Invalid, 4649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 4605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:27,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3131 Valid, 3479 Invalid, 4649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 4605 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:32:27,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565936 states. [2025-03-16 19:32:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565936 to 391055. [2025-03-16 19:32:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391055 states, 391054 states have (on average 1.2912922511980442) internal successors, (504965), 391054 states have internal predecessors, (504965), 0 states have call successors, (0), 0 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-16 19:32:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391055 states to 391055 states and 504965 transitions. [2025-03-16 19:32:32,464 INFO L78 Accepts]: Start accepts. Automaton has 391055 states and 504965 transitions. Word has length 129 [2025-03-16 19:32:32,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:32,464 INFO L471 AbstractCegarLoop]: Abstraction has 391055 states and 504965 transitions. [2025-03-16 19:32:32,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.75) internal successors, (357), 28 states have internal predecessors, (357), 0 states have call successors, (0), 0 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-16 19:32:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 391055 states and 504965 transitions. [2025-03-16 19:32:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 19:32:32,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:32,493 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:32,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 19:32:32,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-16 19:32:32,694 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-16 19:32:32,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:32,695 INFO L85 PathProgramCache]: Analyzing trace with hash 709524586, now seen corresponding path program 1 times [2025-03-16 19:32:32,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:32,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322573851] [2025-03-16 19:32:32,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:32,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 19:32:32,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 19:32:32,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:32,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:33,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:33,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322573851] [2025-03-16 19:32:33,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322573851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:32:33,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246687900] [2025-03-16 19:32:33,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:33,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:32:33,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:32:33,022 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:32:33,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:32:33,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 19:32:33,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 19:32:33,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:33,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:33,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 19:32:33,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:32:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:33,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:32:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:34,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246687900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:32:34,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:32:34,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-16 19:32:34,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45498491] [2025-03-16 19:32:34,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:32:34,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 19:32:34,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:34,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 19:32:34,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:32:34,805 INFO L87 Difference]: Start difference. First operand 391055 states and 504965 transitions. Second operand has 32 states, 32 states have (on average 11.03125) internal successors, (353), 31 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:42,350 INFO L93 Difference]: Finished difference Result 1269855 states and 1639738 transitions. [2025-03-16 19:32:42,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-03-16 19:32:42,350 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 11.03125) internal successors, (353), 31 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-03-16 19:32:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:43,745 INFO L225 Difference]: With dead ends: 1269855 [2025-03-16 19:32:43,746 INFO L226 Difference]: Without dead ends: 1038645 [2025-03-16 19:32:44,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4396 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2826, Invalid=13430, Unknown=0, NotChecked=0, Total=16256 [2025-03-16 19:32:44,468 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 2568 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2568 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:44,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2568 Valid, 2247 Invalid, 2573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:32:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038645 states.