./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_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-?-798a7b3-m [2025-03-03 15:12:38,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:12:38,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:12:38,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:12:38,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:12:38,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:12:38,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:12:38,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:12:38,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:12:38,792 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:12:38,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:12:38,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:12:38,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:12:38,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:12:38,793 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:12:38,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:12:38,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:12:38,794 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:12:38,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:12:38,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:12:38,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:12:38,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:12:38,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:12:38,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:12:38,794 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:12:38,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:12:38,794 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:12:38,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:12:38,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:12:38,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:12:38,796 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-03 15:12:39,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:12:39,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:12:39,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:12:39,054 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:12:39,054 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:12:39,055 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-03 15:12:40,237 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2f33e9f/3bc2cdd11b554a268c89f0125b04ba0b/FLAG63e625228 [2025-03-03 15:12:40,576 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:12:40,577 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-03 15:12:40,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2f33e9f/3bc2cdd11b554a268c89f0125b04ba0b/FLAG63e625228 [2025-03-03 15:12:40,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2f33e9f/3bc2cdd11b554a268c89f0125b04ba0b [2025-03-03 15:12:40,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:12:40,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:12:40,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:12:40,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:12:40,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:12:40,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:12:40" (1/1) ... [2025-03-03 15:12:40,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d86d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:40, skipping insertion in model container [2025-03-03 15:12:40,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:12:40" (1/1) ... [2025-03-03 15:12:40,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:12:41,013 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-03 15:12:41,033 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-03 15:12:41,038 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-03 15:12:41,041 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-03 15:12:41,046 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-03 15:12:41,048 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-03 15:12:41,053 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-03 15:12:41,061 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-03 15:12:41,065 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-03 15:12:41,069 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-03 15:12:41,074 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-03 15:12:41,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:12:41,134 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:12:41,169 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-03 15:12:41,183 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-03 15:12:41,188 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-03 15:12:41,191 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-03 15:12:41,197 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-03 15:12:41,199 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-03 15:12:41,201 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-03 15:12:41,206 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-03 15:12:41,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[20883,20896] [2025-03-03 15:12:41,211 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-03 15:12:41,217 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-03 15:12:41,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:12:41,284 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:12:41,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41 WrapperNode [2025-03-03 15:12:41,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:12:41,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:12:41,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:12:41,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:12:41,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (1/1) ... [2025-03-03 15:12:41,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (1/1) ... [2025-03-03 15:12:41,338 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2022 [2025-03-03 15:12:41,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:12:41,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:12:41,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:12:41,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:12:41,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (1/1) ... [2025-03-03 15:12:41,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (1/1) ... [2025-03-03 15:12:41,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (1/1) ... [2025-03-03 15:12:41,380 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:12:41,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (1/1) ... [2025-03-03 15:12:41,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (1/1) ... [2025-03-03 15:12:41,400 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (1/1) ... [2025-03-03 15:12:41,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (1/1) ... [2025-03-03 15:12:41,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (1/1) ... [2025-03-03 15:12:41,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (1/1) ... [2025-03-03 15:12:41,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:12:41,417 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:12:41,417 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:12:41,417 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:12:41,418 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (1/1) ... [2025-03-03 15:12:41,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:12:41,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:41,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:12:41,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:12:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:12:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:12:41,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:12:41,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:12:41,606 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:12:41,607 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:12:42,691 INFO L1325 $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-03 15:12:42,692 INFO L1325 $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-03 15:12:42,692 INFO L1325 $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-03 15:12:42,692 INFO L1325 $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-03 15:12:42,692 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2812: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-03 15:12:42,692 INFO L1325 $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-03 15:12:42,692 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L434: havoc main_~node3__m3~2#1; [2025-03-03 15:12:42,692 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1293: havoc main_~node3__m3~4#1; [2025-03-03 15:12:42,692 INFO L1325 $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-03 15:12:42,692 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:12:42,692 INFO L1325 $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-03 15:12:42,692 INFO L1325 $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-03 15:12:42,692 INFO L1325 $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-03 15:12:42,693 INFO L1325 $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-03 15:12:42,693 INFO L1325 $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-03 15:12:42,693 INFO L1325 $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-03 15:12:42,693 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L836: havoc main_~node4__m4~3#1; [2025-03-03 15:12:42,693 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L704: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:12:42,693 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2455: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-03 15:12:42,693 INFO L1325 $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-03 15:12:42,693 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003: havoc main_~node4__m4~4#1; [2025-03-03 15:12:42,693 INFO L1325 $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-03 15:12:42,693 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1202: havoc main_~check__tmp~9#1; [2025-03-03 15:12:42,693 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1136: havoc main_~node4__m4~5#1; [2025-03-03 15:12:42,693 INFO L1325 $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-03 15:12:42,694 INFO L1325 $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-03 15:12:42,694 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2095: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-03 15:12:42,694 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: havoc main_~node3__m3~5#1; [2025-03-03 15:12:42,694 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L345: havoc main_~node4__m4~1#1; [2025-03-03 15:12:42,694 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-03 15:12:42,694 INFO L1325 $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-03 15:12:42,694 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-03 15:12:42,694 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1932: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-03 15:12:42,694 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L315: havoc main_~node2__m2~1#1; [2025-03-03 15:12:42,694 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:12:42,694 INFO L1325 $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-03 15:12:42,694 INFO L1325 $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-03 15:12:42,694 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc main_~node4__m4~2#1; [2025-03-03 15:12:42,694 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1308: havoc main_~node4__m4~6#1; [2025-03-03 15:12:42,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2795: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-03 15:12:42,695 INFO L1325 $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-03 15:12:42,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1442: havoc main_~node4__m4~7#1; [2025-03-03 15:12:42,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2632: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-03 15:12:42,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1509: havoc main_~check__tmp~13#1; [2025-03-03 15:12:42,695 INFO L1325 $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-03 15:12:42,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: havoc main_~node2__m2~2#1; [2025-03-03 15:12:42,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1278: havoc main_~node2__m2~3#1; [2025-03-03 15:12:42,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2272: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-03 15:12:42,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1711: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-03-03 15:12:42,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-03 15:12:42,695 INFO L1325 $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-03 15:12:42,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2472: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-03 15:12:42,696 INFO L1325 $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-03 15:12:42,696 INFO L1325 $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-03 15:12:42,696 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1648: havoc main_~check__tmp~15#1; [2025-03-03 15:12:42,696 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1582: havoc main_~node4__m4~8#1; [2025-03-03 15:12:42,696 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L988: havoc main_~node3__m3~3#1; [2025-03-03 15:12:42,696 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:12:42,696 INFO L1325 $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-03 15:12:42,696 INFO L1325 $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-03 15:12:42,696 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2112: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-03 15:12:42,696 INFO L1325 $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-03 15:12:42,696 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L230: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-03 15:12:42,696 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-03 15:12:42,696 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: havoc main_~node3__m3~1#1; [2025-03-03 15:12:42,696 INFO L1325 $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-03 15:12:42,697 INFO L1325 $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-03 15:12:42,750 INFO L? ?]: Removed 326 outVars from TransFormulas that were not future-live. [2025-03-03 15:12:42,750 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:12:42,768 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:12:42,769 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:12:42,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:12:42 BoogieIcfgContainer [2025-03-03 15:12:42,769 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:12:42,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:12:42,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:12:42,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:12:42,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:12:40" (1/3) ... [2025-03-03 15:12:42,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316bc2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:12:42, skipping insertion in model container [2025-03-03 15:12:42,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:12:41" (2/3) ... [2025-03-03 15:12:42,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316bc2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:12:42, skipping insertion in model container [2025-03-03 15:12:42,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:12:42" (3/3) ... [2025-03-03 15:12:42,776 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:12:42,785 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:12:42,787 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, 358 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-03-03 15:12:42,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:12:42,836 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;@450cdfb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:12:42,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-03 15:12:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 15:12:42,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:42,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:42,852 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-03 15:12:42,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:42,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1251606518, now seen corresponding path program 1 times [2025-03-03 15:12:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:42,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151333481] [2025-03-03 15:12:42,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:42,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:42,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 15:12:43,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 15:12:43,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:43,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:43,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:43,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151333481] [2025-03-03 15:12:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151333481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:43,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:43,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:12:43,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956795604] [2025-03-03 15:12:43,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:43,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:12:43,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:43,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:12:43,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:12:43,324 INFO L87 Difference]: Start difference. First operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:43,608 INFO L93 Difference]: Finished difference Result 570 states and 974 transitions. [2025-03-03 15:12:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:12:43,610 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-03 15:12:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:43,615 INFO L225 Difference]: With dead ends: 570 [2025-03-03 15:12:43,616 INFO L226 Difference]: Without dead ends: 315 [2025-03-03 15:12:43,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:12:43,620 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 1503 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:43,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 404 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:12:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-03 15:12:43,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-03-03 15:12:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 304 states have (on average 1.2763157894736843) internal successors, (388), 314 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 388 transitions. [2025-03-03 15:12:43,664 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 388 transitions. Word has length 59 [2025-03-03 15:12:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:43,664 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 388 transitions. [2025-03-03 15:12:43,665 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-03 15:12:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 388 transitions. [2025-03-03 15:12:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 15:12:43,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:43,666 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-03 15:12:43,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:12:43,667 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-03 15:12:43,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash -699038653, now seen corresponding path program 1 times [2025-03-03 15:12:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:43,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449331045] [2025-03-03 15:12:43,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:43,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 15:12:43,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 15:12:43,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:43,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:43,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449331045] [2025-03-03 15:12:43,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449331045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:43,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:43,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:12:43,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56260347] [2025-03-03 15:12:43,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:43,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:12:43,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:43,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:12:43,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:12:43,887 INFO L87 Difference]: Start difference. First operand 315 states and 388 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-03 15:12:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:44,121 INFO L93 Difference]: Finished difference Result 652 states and 835 transitions. [2025-03-03 15:12:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:12:44,122 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-03 15:12:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:44,124 INFO L225 Difference]: With dead ends: 652 [2025-03-03 15:12:44,124 INFO L226 Difference]: Without dead ends: 408 [2025-03-03 15:12:44,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:12:44,125 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 1342 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:44,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 313 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:12:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-03 15:12:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 366. [2025-03-03 15:12:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 355 states have (on average 1.3577464788732394) internal successors, (482), 365 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 482 transitions. [2025-03-03 15:12:44,137 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 482 transitions. Word has length 60 [2025-03-03 15:12:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:44,138 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 482 transitions. [2025-03-03 15:12:44,138 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-03 15:12:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 482 transitions. [2025-03-03 15:12:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 15:12:44,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:44,139 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-03 15:12:44,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:12:44,140 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-03 15:12:44,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1715255438, now seen corresponding path program 1 times [2025-03-03 15:12:44,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:44,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686581423] [2025-03-03 15:12:44,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:44,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 15:12:44,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 15:12:44,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:44,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686581423] [2025-03-03 15:12:44,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686581423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:44,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:44,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:12:44,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095465921] [2025-03-03 15:12:44,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:44,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:12:44,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:44,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:12:44,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:12:44,323 INFO L87 Difference]: Start difference. First operand 366 states and 482 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-03 15:12:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:44,483 INFO L93 Difference]: Finished difference Result 661 states and 890 transitions. [2025-03-03 15:12:44,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:12:44,483 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-03 15:12:44,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:44,485 INFO L225 Difference]: With dead ends: 661 [2025-03-03 15:12:44,485 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 15:12:44,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:12:44,489 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 913 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:44,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 199 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:12:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 15:12:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-03-03 15:12:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 336 states have (on average 1.3660714285714286) internal successors, (459), 346 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 459 transitions. [2025-03-03 15:12:44,508 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 459 transitions. Word has length 61 [2025-03-03 15:12:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:44,509 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 459 transitions. [2025-03-03 15:12:44,509 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-03 15:12:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 459 transitions. [2025-03-03 15:12:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:12:44,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:44,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] [2025-03-03 15:12:44,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:12:44,510 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-03 15:12:44,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1987134437, now seen corresponding path program 1 times [2025-03-03 15:12:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:44,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884514021] [2025-03-03 15:12:44,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:44,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:12:44,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:12:44,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:44,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:44,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:44,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884514021] [2025-03-03 15:12:44,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884514021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:44,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:44,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:12:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369794131] [2025-03-03 15:12:44,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:44,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:12:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:44,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:12:44,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:12:44,625 INFO L87 Difference]: Start difference. First operand 347 states and 459 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:44,777 INFO L93 Difference]: Finished difference Result 642 states and 865 transitions. [2025-03-03 15:12:44,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:12:44,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 15:12:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:44,779 INFO L225 Difference]: With dead ends: 642 [2025-03-03 15:12:44,779 INFO L226 Difference]: Without dead ends: 339 [2025-03-03 15:12:44,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:12:44,780 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 870 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:44,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 195 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:12:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-03 15:12:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-03-03 15:12:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 338 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 448 transitions. [2025-03-03 15:12:44,789 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 448 transitions. Word has length 62 [2025-03-03 15:12:44,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:44,789 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 448 transitions. [2025-03-03 15:12:44,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 448 transitions. [2025-03-03 15:12:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:12:44,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:44,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:44,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:12:44,790 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-03 15:12:44,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:44,790 INFO L85 PathProgramCache]: Analyzing trace with hash -213127066, now seen corresponding path program 1 times [2025-03-03 15:12:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:44,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963114553] [2025-03-03 15:12:44,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:44,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:44,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:12:44,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:12:44,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:44,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:45,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:45,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963114553] [2025-03-03 15:12:45,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963114553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:45,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:45,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:12:45,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231661516] [2025-03-03 15:12:45,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:45,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:12:45,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:45,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:12:45,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:12:45,200 INFO L87 Difference]: Start difference. First operand 339 states and 448 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:45,574 INFO L93 Difference]: Finished difference Result 689 states and 913 transitions. [2025-03-03 15:12:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:12:45,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:12:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:45,578 INFO L225 Difference]: With dead ends: 689 [2025-03-03 15:12:45,578 INFO L226 Difference]: Without dead ends: 504 [2025-03-03 15:12:45,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:12:45,580 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1287 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:45,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 758 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:12:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-03 15:12:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 339. [2025-03-03 15:12:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 338 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-03 15:12:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 447 transitions. [2025-03-03 15:12:45,593 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 447 transitions. Word has length 63 [2025-03-03 15:12:45,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:45,593 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 447 transitions. [2025-03-03 15:12:45,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:45,593 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 447 transitions. [2025-03-03 15:12:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:12:45,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:45,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:45,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:12:45,594 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-03 15:12:45,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash -633020883, now seen corresponding path program 1 times [2025-03-03 15:12:45,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:45,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820655063] [2025-03-03 15:12:45,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:45,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:12:45,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:12:45,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:45,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:45,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:45,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820655063] [2025-03-03 15:12:45,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820655063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:45,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:45,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:12:45,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472929152] [2025-03-03 15:12:45,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:45,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:45,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:45,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:45,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:12:45,870 INFO L87 Difference]: Start difference. First operand 339 states and 447 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:46,300 INFO L93 Difference]: Finished difference Result 537 states and 730 transitions. [2025-03-03 15:12:46,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:12:46,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:12:46,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:46,301 INFO L225 Difference]: With dead ends: 537 [2025-03-03 15:12:46,301 INFO L226 Difference]: Without dead ends: 397 [2025-03-03 15:12:46,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:12:46,302 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1029 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:46,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 995 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:12:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-03 15:12:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 339. [2025-03-03 15:12:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 338 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-03 15:12:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 446 transitions. [2025-03-03 15:12:46,314 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 446 transitions. Word has length 63 [2025-03-03 15:12:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:46,314 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 446 transitions. [2025-03-03 15:12:46,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 446 transitions. [2025-03-03 15:12:46,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:12:46,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:46,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:46,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:12:46,315 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-03 15:12:46,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:46,316 INFO L85 PathProgramCache]: Analyzing trace with hash -406599686, now seen corresponding path program 1 times [2025-03-03 15:12:46,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:46,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166098365] [2025-03-03 15:12:46,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:46,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:46,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:12:46,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:12:46,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:46,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:46,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166098365] [2025-03-03 15:12:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166098365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:46,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:12:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919169729] [2025-03-03 15:12:46,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:46,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:46,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:46,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:46,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:12:46,509 INFO L87 Difference]: Start difference. First operand 339 states and 446 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:46,907 INFO L93 Difference]: Finished difference Result 535 states and 703 transitions. [2025-03-03 15:12:46,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:12:46,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 15:12:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:46,909 INFO L225 Difference]: With dead ends: 535 [2025-03-03 15:12:46,909 INFO L226 Difference]: Without dead ends: 530 [2025-03-03 15:12:46,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:12:46,910 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 979 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:46,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 742 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:12:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-03 15:12:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 339. [2025-03-03 15:12:46,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3567073170731707) internal successors, (445), 338 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-03 15:12:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 445 transitions. [2025-03-03 15:12:46,922 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 445 transitions. Word has length 63 [2025-03-03 15:12:46,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:46,922 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 445 transitions. [2025-03-03 15:12:46,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 445 transitions. [2025-03-03 15:12:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:12:46,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:46,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:46,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:12:46,923 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-03 15:12:46,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash 323489165, now seen corresponding path program 1 times [2025-03-03 15:12:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:46,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528594672] [2025-03-03 15:12:46,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:46,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:12:46,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:12:46,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:46,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:47,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:47,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528594672] [2025-03-03 15:12:47,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528594672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:47,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:47,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:12:47,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348555833] [2025-03-03 15:12:47,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:47,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:12:47,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:47,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:12:47,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:12:47,286 INFO L87 Difference]: Start difference. First operand 339 states and 445 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:48,155 INFO L93 Difference]: Finished difference Result 1033 states and 1438 transitions. [2025-03-03 15:12:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:12:48,155 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:12:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:48,158 INFO L225 Difference]: With dead ends: 1033 [2025-03-03 15:12:48,158 INFO L226 Difference]: Without dead ends: 910 [2025-03-03 15:12:48,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:12:48,159 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 2845 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2845 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:48,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2845 Valid, 1331 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:12:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-03-03 15:12:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 343. [2025-03-03 15:12:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3524096385542168) internal successors, (449), 342 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 449 transitions. [2025-03-03 15:12:48,167 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 449 transitions. Word has length 65 [2025-03-03 15:12:48,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:48,167 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 449 transitions. [2025-03-03 15:12:48,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 449 transitions. [2025-03-03 15:12:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:12:48,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:48,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:48,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:12:48,168 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-03 15:12:48,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:48,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1910527089, now seen corresponding path program 1 times [2025-03-03 15:12:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:48,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743625088] [2025-03-03 15:12:48,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:48,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:48,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:12:48,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:12:48,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:48,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:48,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743625088] [2025-03-03 15:12:48,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743625088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:48,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:48,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:12:48,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685238308] [2025-03-03 15:12:48,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:48,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:48,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:48,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:48,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:12:48,365 INFO L87 Difference]: Start difference. First operand 343 states and 449 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:48,754 INFO L93 Difference]: Finished difference Result 645 states and 864 transitions. [2025-03-03 15:12:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:12:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:12:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:48,757 INFO L225 Difference]: With dead ends: 645 [2025-03-03 15:12:48,757 INFO L226 Difference]: Without dead ends: 534 [2025-03-03 15:12:48,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:12:48,758 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 1717 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:48,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 745 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:12:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-03 15:12:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 343. [2025-03-03 15:12:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3493975903614457) internal successors, (448), 342 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 448 transitions. [2025-03-03 15:12:48,764 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 448 transitions. Word has length 65 [2025-03-03 15:12:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:48,765 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 448 transitions. [2025-03-03 15:12:48,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 448 transitions. [2025-03-03 15:12:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:12:48,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:48,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:48,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:12:48,766 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-03 15:12:48,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash -71533182, now seen corresponding path program 1 times [2025-03-03 15:12:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664301762] [2025-03-03 15:12:48,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:48,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:12:48,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:12:48,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:48,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:48,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:48,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664301762] [2025-03-03 15:12:48,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664301762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:48,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:48,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:12:48,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869716245] [2025-03-03 15:12:48,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:48,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:48,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:48,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:48,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:12:48,965 INFO L87 Difference]: Start difference. First operand 343 states and 448 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:49,339 INFO L93 Difference]: Finished difference Result 642 states and 860 transitions. [2025-03-03 15:12:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:12:49,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:12:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:49,341 INFO L225 Difference]: With dead ends: 642 [2025-03-03 15:12:49,341 INFO L226 Difference]: Without dead ends: 534 [2025-03-03 15:12:49,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:12:49,342 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 1714 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:49,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 745 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:12:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-03 15:12:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 343. [2025-03-03 15:12:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3463855421686748) internal successors, (447), 342 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-03 15:12:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 447 transitions. [2025-03-03 15:12:49,348 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 447 transitions. Word has length 65 [2025-03-03 15:12:49,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:49,349 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 447 transitions. [2025-03-03 15:12:49,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 447 transitions. [2025-03-03 15:12:49,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:12:49,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:49,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:49,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:12:49,350 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-03 15:12:49,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1047366714, now seen corresponding path program 1 times [2025-03-03 15:12:49,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:49,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238894427] [2025-03-03 15:12:49,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:49,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:49,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:12:49,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:12:49,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:49,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:49,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:49,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238894427] [2025-03-03 15:12:49,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238894427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:49,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:49,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:12:49,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51566506] [2025-03-03 15:12:49,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:49,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:49,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:49,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:49,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:12:49,546 INFO L87 Difference]: Start difference. First operand 343 states and 447 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:49,965 INFO L93 Difference]: Finished difference Result 668 states and 900 transitions. [2025-03-03 15:12:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:12:49,965 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:12:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:49,967 INFO L225 Difference]: With dead ends: 668 [2025-03-03 15:12:49,967 INFO L226 Difference]: Without dead ends: 550 [2025-03-03 15:12:49,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:12:49,968 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1374 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:49,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 1053 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:12:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-03 15:12:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 343. [2025-03-03 15:12:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3433734939759037) internal successors, (446), 342 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-03 15:12:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 446 transitions. [2025-03-03 15:12:49,976 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 446 transitions. Word has length 65 [2025-03-03 15:12:49,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:49,977 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 446 transitions. [2025-03-03 15:12:49,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 446 transitions. [2025-03-03 15:12:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:12:49,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:49,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:49,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:12:49,978 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-03 15:12:49,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1530236826, now seen corresponding path program 1 times [2025-03-03 15:12:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:49,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785976275] [2025-03-03 15:12:49,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:49,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:49,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:12:50,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:12:50,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:50,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785976275] [2025-03-03 15:12:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785976275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:50,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:50,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:12:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890093336] [2025-03-03 15:12:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:50,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:50,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:50,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:12:50,158 INFO L87 Difference]: Start difference. First operand 343 states and 446 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:50,489 INFO L93 Difference]: Finished difference Result 571 states and 768 transitions. [2025-03-03 15:12:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:12:50,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:12:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:50,491 INFO L225 Difference]: With dead ends: 571 [2025-03-03 15:12:50,491 INFO L226 Difference]: Without dead ends: 401 [2025-03-03 15:12:50,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:12:50,491 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1340 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:50,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 773 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:12:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-03 15:12:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 343. [2025-03-03 15:12:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3373493975903614) internal successors, (444), 342 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-03 15:12:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 444 transitions. [2025-03-03 15:12:50,497 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 444 transitions. Word has length 65 [2025-03-03 15:12:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:50,498 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 444 transitions. [2025-03-03 15:12:50,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 444 transitions. [2025-03-03 15:12:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:12:50,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:50,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:50,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:12:50,499 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-03 15:12:50,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:50,499 INFO L85 PathProgramCache]: Analyzing trace with hash -900054424, now seen corresponding path program 1 times [2025-03-03 15:12:50,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:50,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533124381] [2025-03-03 15:12:50,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:50,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:12:50,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:12:50,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:50,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:50,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:50,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533124381] [2025-03-03 15:12:50,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533124381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:50,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:50,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:12:50,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371244274] [2025-03-03 15:12:50,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:50,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:50,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:50,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:50,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:12:50,681 INFO L87 Difference]: Start difference. First operand 343 states and 444 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:51,109 INFO L93 Difference]: Finished difference Result 567 states and 744 transitions. [2025-03-03 15:12:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:12:51,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:12:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:51,111 INFO L225 Difference]: With dead ends: 567 [2025-03-03 15:12:51,111 INFO L226 Difference]: Without dead ends: 550 [2025-03-03 15:12:51,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:12:51,112 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1316 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:51,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 1177 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:12:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-03 15:12:51,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 343. [2025-03-03 15:12:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3313253012048192) internal successors, (442), 342 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-03 15:12:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 442 transitions. [2025-03-03 15:12:51,119 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 442 transitions. Word has length 65 [2025-03-03 15:12:51,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:51,119 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 442 transitions. [2025-03-03 15:12:51,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 442 transitions. [2025-03-03 15:12:51,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:12:51,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:51,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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:51,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:12:51,120 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-03 15:12:51,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:51,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1160896618, now seen corresponding path program 1 times [2025-03-03 15:12:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:51,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673927963] [2025-03-03 15:12:51,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:51,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:12:51,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:12:51,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:51,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:51,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:51,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673927963] [2025-03-03 15:12:51,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673927963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:51,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:51,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:12:51,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572376322] [2025-03-03 15:12:51,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:51,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:51,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:51,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:51,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:12:51,297 INFO L87 Difference]: Start difference. First operand 343 states and 442 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:51,635 INFO L93 Difference]: Finished difference Result 539 states and 698 transitions. [2025-03-03 15:12:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:12:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 15:12:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:51,637 INFO L225 Difference]: With dead ends: 539 [2025-03-03 15:12:51,637 INFO L226 Difference]: Without dead ends: 534 [2025-03-03 15:12:51,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:12:51,638 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1177 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:51,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 825 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:12:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-03 15:12:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 343. [2025-03-03 15:12:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3253012048192772) internal successors, (440), 342 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-03 15:12:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 440 transitions. [2025-03-03 15:12:51,644 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 440 transitions. Word has length 65 [2025-03-03 15:12:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:51,644 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 440 transitions. [2025-03-03 15:12:51,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 440 transitions. [2025-03-03 15:12:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:12:51,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:51,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:51,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:12:51,645 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-03 15:12:51,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash 124098183, now seen corresponding path program 1 times [2025-03-03 15:12:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:51,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229842708] [2025-03-03 15:12:51,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:51,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:12:51,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:12:51,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:51,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:51,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:51,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229842708] [2025-03-03 15:12:51,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229842708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:51,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:51,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:12:51,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891484931] [2025-03-03 15:12:51,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:51,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:51,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:51,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:12:51,790 INFO L87 Difference]: Start difference. First operand 343 states and 440 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:52,264 INFO L93 Difference]: Finished difference Result 673 states and 899 transitions. [2025-03-03 15:12:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:12:52,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 15:12:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:52,267 INFO L225 Difference]: With dead ends: 673 [2025-03-03 15:12:52,267 INFO L226 Difference]: Without dead ends: 550 [2025-03-03 15:12:52,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:12:52,269 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 920 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:52,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 1115 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:12:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-03 15:12:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 339. [2025-03-03 15:12:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.326219512195122) internal successors, (435), 338 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 435 transitions. [2025-03-03 15:12:52,279 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 435 transitions. Word has length 66 [2025-03-03 15:12:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:52,280 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 435 transitions. [2025-03-03 15:12:52,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 435 transitions. [2025-03-03 15:12:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:12:52,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:52,281 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-03 15:12:52,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:12:52,282 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:12:52,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1381566483, now seen corresponding path program 1 times [2025-03-03 15:12:52,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:52,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401514640] [2025-03-03 15:12:52,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:52,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:52,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:12:52,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:12:52,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:52,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:52,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401514640] [2025-03-03 15:12:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401514640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:52,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:52,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:12:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616241672] [2025-03-03 15:12:52,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:52,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:12:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:52,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:12:52,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:12:52,739 INFO L87 Difference]: Start difference. First operand 339 states and 435 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:53,106 INFO L93 Difference]: Finished difference Result 587 states and 784 transitions. [2025-03-03 15:12:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:12:53,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:12:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:53,108 INFO L225 Difference]: With dead ends: 587 [2025-03-03 15:12:53,108 INFO L226 Difference]: Without dead ends: 418 [2025-03-03 15:12:53,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:12:53,110 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 868 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:53,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 821 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:12:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-03 15:12:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 276. [2025-03-03 15:12:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 269 states have (on average 1.3308550185873607) internal successors, (358), 275 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 358 transitions. [2025-03-03 15:12:53,117 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 358 transitions. Word has length 67 [2025-03-03 15:12:53,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:53,117 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 358 transitions. [2025-03-03 15:12:53,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 358 transitions. [2025-03-03 15:12:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:12:53,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:53,119 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-03 15:12:53,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:12:53,119 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-03 15:12:53,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:53,119 INFO L85 PathProgramCache]: Analyzing trace with hash 141847688, now seen corresponding path program 1 times [2025-03-03 15:12:53,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:53,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185708923] [2025-03-03 15:12:53,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:53,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:53,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:12:53,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:12:53,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:53,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:53,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:53,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185708923] [2025-03-03 15:12:53,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185708923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:53,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:53,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:12:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862873363] [2025-03-03 15:12:53,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:53,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:12:53,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:53,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:12:53,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:12:53,473 INFO L87 Difference]: Start difference. First operand 276 states and 358 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:53,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:53,863 INFO L93 Difference]: Finished difference Result 554 states and 757 transitions. [2025-03-03 15:12:53,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:12:53,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:12:53,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:53,864 INFO L225 Difference]: With dead ends: 554 [2025-03-03 15:12:53,864 INFO L226 Difference]: Without dead ends: 432 [2025-03-03 15:12:53,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:12:53,865 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 794 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:53,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1465 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:12:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-03 15:12:53,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 256. [2025-03-03 15:12:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 250 states have (on average 1.328) internal successors, (332), 255 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 332 transitions. [2025-03-03 15:12:53,869 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 332 transitions. Word has length 67 [2025-03-03 15:12:53,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:53,869 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 332 transitions. [2025-03-03 15:12:53,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 332 transitions. [2025-03-03 15:12:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:12:53,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:53,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:53,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:12:53,870 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:12:53,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash -385919704, now seen corresponding path program 1 times [2025-03-03 15:12:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:53,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193974374] [2025-03-03 15:12:53,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:53,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:12:53,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:12:53,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:53,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:54,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:54,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193974374] [2025-03-03 15:12:54,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193974374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:54,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:54,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:12:54,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881251358] [2025-03-03 15:12:54,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:54,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:12:54,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:54,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:12:54,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:12:54,241 INFO L87 Difference]: Start difference. First operand 256 states and 332 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:54,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:54,816 INFO L93 Difference]: Finished difference Result 672 states and 908 transitions. [2025-03-03 15:12:54,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:12:54,816 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:12:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:54,818 INFO L225 Difference]: With dead ends: 672 [2025-03-03 15:12:54,818 INFO L226 Difference]: Without dead ends: 668 [2025-03-03 15:12:54,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:12:54,818 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1249 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:54,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 1246 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:12:54,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-03 15:12:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 252. [2025-03-03 15:12:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.3279352226720649) internal successors, (328), 251 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 328 transitions. [2025-03-03 15:12:54,823 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 328 transitions. Word has length 67 [2025-03-03 15:12:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:54,823 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 328 transitions. [2025-03-03 15:12:54,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 328 transitions. [2025-03-03 15:12:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:12:54,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:54,824 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-03 15:12:54,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:12:54,824 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-03 15:12:54,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1763550170, now seen corresponding path program 1 times [2025-03-03 15:12:54,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:54,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637075072] [2025-03-03 15:12:54,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:54,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:54,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:12:54,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:12:54,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:54,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:55,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:55,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637075072] [2025-03-03 15:12:55,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637075072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:55,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:55,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:12:55,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168799443] [2025-03-03 15:12:55,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:55,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:12:55,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:55,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:12:55,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:12:55,194 INFO L87 Difference]: Start difference. First operand 252 states and 328 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:55,773 INFO L93 Difference]: Finished difference Result 774 states and 1061 transitions. [2025-03-03 15:12:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:12:55,774 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 15:12:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:55,775 INFO L225 Difference]: With dead ends: 774 [2025-03-03 15:12:55,775 INFO L226 Difference]: Without dead ends: 662 [2025-03-03 15:12:55,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:12:55,776 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1026 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:55,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1567 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:12:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-03 15:12:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 242. [2025-03-03 15:12:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 238 states have (on average 1.315126050420168) internal successors, (313), 241 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 313 transitions. [2025-03-03 15:12:55,782 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 313 transitions. Word has length 67 [2025-03-03 15:12:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:55,782 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 313 transitions. [2025-03-03 15:12:55,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 313 transitions. [2025-03-03 15:12:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:12:55,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:55,783 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-03 15:12:55,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:12:55,783 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:12:55,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash -497690943, now seen corresponding path program 1 times [2025-03-03 15:12:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336516335] [2025-03-03 15:12:55,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:55,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:55,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:12:55,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:12:55,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:55,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:55,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:55,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336516335] [2025-03-03 15:12:55,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336516335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:55,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:55,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:12:55,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585710928] [2025-03-03 15:12:55,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:55,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:55,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:55,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:12:55,921 INFO L87 Difference]: Start difference. First operand 242 states and 313 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:56,190 INFO L93 Difference]: Finished difference Result 405 states and 533 transitions. [2025-03-03 15:12:56,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:12:56,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:12:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:56,192 INFO L225 Difference]: With dead ends: 405 [2025-03-03 15:12:56,192 INFO L226 Difference]: Without dead ends: 398 [2025-03-03 15:12:56,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:12:56,193 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 521 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:56,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 516 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:12:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-03 15:12:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 242. [2025-03-03 15:12:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 238 states have (on average 1.3109243697478992) internal successors, (312), 241 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 312 transitions. [2025-03-03 15:12:56,200 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 312 transitions. Word has length 68 [2025-03-03 15:12:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:56,200 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 312 transitions. [2025-03-03 15:12:56,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 312 transitions. [2025-03-03 15:12:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:12:56,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:56,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, 1, 1, 1, 1] [2025-03-03 15:12:56,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:12:56,202 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-03 15:12:56,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash -578655993, now seen corresponding path program 1 times [2025-03-03 15:12:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:56,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975093965] [2025-03-03 15:12:56,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:56,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:12:56,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:12:56,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:56,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:56,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:56,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975093965] [2025-03-03 15:12:56,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975093965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:56,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:56,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:12:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449453903] [2025-03-03 15:12:56,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:56,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:12:56,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:56,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:12:56,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:12:56,448 INFO L87 Difference]: Start difference. First operand 242 states and 312 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:56,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:56,985 INFO L93 Difference]: Finished difference Result 904 states and 1263 transitions. [2025-03-03 15:12:56,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:12:56,985 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:12:56,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:56,987 INFO L225 Difference]: With dead ends: 904 [2025-03-03 15:12:56,987 INFO L226 Difference]: Without dead ends: 768 [2025-03-03 15:12:56,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:12:56,988 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 2684 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2684 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:56,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2684 Valid, 753 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:12:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-03-03 15:12:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 250. [2025-03-03 15:12:56,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 246 states have (on average 1.3008130081300813) internal successors, (320), 249 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 320 transitions. [2025-03-03 15:12:56,993 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 320 transitions. Word has length 68 [2025-03-03 15:12:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:56,993 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 320 transitions. [2025-03-03 15:12:56,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 320 transitions. [2025-03-03 15:12:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:12:56,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:56,994 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-03 15:12:56,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:12:56,994 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:12:56,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash -254562487, now seen corresponding path program 1 times [2025-03-03 15:12:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:56,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822330376] [2025-03-03 15:12:56,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:57,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:12:57,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:12:57,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:57,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:57,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-03 15:12:57,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:57,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822330376] [2025-03-03 15:12:57,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822330376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:57,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:57,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:12:57,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354485418] [2025-03-03 15:12:57,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:57,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:57,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:57,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:57,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:12:57,131 INFO L87 Difference]: Start difference. First operand 250 states and 320 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:57,402 INFO L93 Difference]: Finished difference Result 413 states and 539 transitions. [2025-03-03 15:12:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:12:57,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 15:12:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:57,404 INFO L225 Difference]: With dead ends: 413 [2025-03-03 15:12:57,404 INFO L226 Difference]: Without dead ends: 406 [2025-03-03 15:12:57,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:12:57,405 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1107 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:57,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 531 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:12:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-03 15:12:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 250. [2025-03-03 15:12:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 246 states have (on average 1.2967479674796747) internal successors, (319), 249 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 319 transitions. [2025-03-03 15:12:57,409 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 319 transitions. Word has length 68 [2025-03-03 15:12:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:57,409 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 319 transitions. [2025-03-03 15:12:57,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 319 transitions. [2025-03-03 15:12:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:12:57,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:57,410 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-03 15:12:57,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:12:57,410 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:12:57,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:57,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1345860024, now seen corresponding path program 1 times [2025-03-03 15:12:57,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:57,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517286457] [2025-03-03 15:12:57,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:57,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:57,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:12:57,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:12:57,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:57,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:57,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:57,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517286457] [2025-03-03 15:12:57,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517286457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:57,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:57,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:12:57,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870538183] [2025-03-03 15:12:57,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:57,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:57,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:57,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:57,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:12:57,532 INFO L87 Difference]: Start difference. First operand 250 states and 319 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 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-03 15:12:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:57,834 INFO L93 Difference]: Finished difference Result 544 states and 731 transitions. [2025-03-03 15:12:57,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:12:57,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 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-03 15:12:57,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:57,835 INFO L225 Difference]: With dead ends: 544 [2025-03-03 15:12:57,835 INFO L226 Difference]: Without dead ends: 408 [2025-03-03 15:12:57,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:12:57,836 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 767 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:57,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 778 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:12:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-03 15:12:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 242. [2025-03-03 15:12:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 238 states have (on average 1.2983193277310925) internal successors, (309), 241 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 309 transitions. [2025-03-03 15:12:57,839 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 309 transitions. Word has length 69 [2025-03-03 15:12:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:57,839 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 309 transitions. [2025-03-03 15:12:57,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 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-03 15:12:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 309 transitions. [2025-03-03 15:12:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:12:57,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:57,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:57,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:12:57,840 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:12:57,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:57,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1347004063, now seen corresponding path program 1 times [2025-03-03 15:12:57,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:57,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979459862] [2025-03-03 15:12:57,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:57,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:57,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:12:57,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:12:57,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:57,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:58,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:58,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979459862] [2025-03-03 15:12:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979459862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:58,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:12:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777618714] [2025-03-03 15:12:58,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:58,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:12:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:58,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:12:58,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:12:58,202 INFO L87 Difference]: Start difference. First operand 242 states and 309 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:58,553 INFO L93 Difference]: Finished difference Result 404 states and 532 transitions. [2025-03-03 15:12:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:12:58,554 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:12:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:58,555 INFO L225 Difference]: With dead ends: 404 [2025-03-03 15:12:58,555 INFO L226 Difference]: Without dead ends: 386 [2025-03-03 15:12:58,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:12:58,556 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 453 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:58,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 2178 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:12:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-03 15:12:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 224. [2025-03-03 15:12:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 221 states have (on average 1.3031674208144797) internal successors, (288), 223 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 288 transitions. [2025-03-03 15:12:58,560 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 288 transitions. Word has length 70 [2025-03-03 15:12:58,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:58,560 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 288 transitions. [2025-03-03 15:12:58,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 288 transitions. [2025-03-03 15:12:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:12:58,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:58,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:58,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:12:58,561 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:12:58,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2059714215, now seen corresponding path program 1 times [2025-03-03 15:12:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:58,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695931696] [2025-03-03 15:12:58,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:58,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:12:58,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:12:58,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:58,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:58,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:58,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695931696] [2025-03-03 15:12:58,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695931696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:58,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:58,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:12:58,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912627836] [2025-03-03 15:12:58,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:58,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:12:58,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:58,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:12:58,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:12:58,900 INFO L87 Difference]: Start difference. First operand 224 states and 288 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:59,359 INFO L93 Difference]: Finished difference Result 604 states and 829 transitions. [2025-03-03 15:12:59,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:12:59,359 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:12:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:59,360 INFO L225 Difference]: With dead ends: 604 [2025-03-03 15:12:59,360 INFO L226 Difference]: Without dead ends: 598 [2025-03-03 15:12:59,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:12:59,361 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 856 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:59,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1511 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:12:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-03 15:12:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 218. [2025-03-03 15:12:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 1.3009259259259258) internal successors, (281), 217 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 281 transitions. [2025-03-03 15:12:59,364 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 281 transitions. Word has length 70 [2025-03-03 15:12:59,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:59,365 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 281 transitions. [2025-03-03 15:12:59,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 281 transitions. [2025-03-03 15:12:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:12:59,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:59,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:12:59,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:12:59,365 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:12:59,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash 371206313, now seen corresponding path program 1 times [2025-03-03 15:12:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:59,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099916524] [2025-03-03 15:12:59,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:59,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:59,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:12:59,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:12:59,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:59,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:00,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:00,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099916524] [2025-03-03 15:13:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099916524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:00,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:00,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 15:13:00,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221447862] [2025-03-03 15:13:00,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:00,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 15:13:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:00,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 15:13:00,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:13:00,100 INFO L87 Difference]: Start difference. First operand 218 states and 281 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:00,970 INFO L93 Difference]: Finished difference Result 236 states and 301 transitions. [2025-03-03 15:13:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:13:00,970 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 15:13:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:00,971 INFO L225 Difference]: With dead ends: 236 [2025-03-03 15:13:00,971 INFO L226 Difference]: Without dead ends: 228 [2025-03-03 15:13:00,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 15:13:00,972 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 435 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:00,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1609 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:13:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-03 15:13:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2025-03-03 15:13:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 225 states have (on average 1.2977777777777777) internal successors, (292), 226 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 292 transitions. [2025-03-03 15:13:00,975 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 292 transitions. Word has length 70 [2025-03-03 15:13:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:00,975 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 292 transitions. [2025-03-03 15:13:00,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 292 transitions. [2025-03-03 15:13:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:13:00,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:00,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:13:00,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:13:00,977 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:13:00,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:00,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1515694186, now seen corresponding path program 1 times [2025-03-03 15:13:00,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:00,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243332539] [2025-03-03 15:13:00,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:00,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:00,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:13:00,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:13:00,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:00,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:01,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:01,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243332539] [2025-03-03 15:13:01,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243332539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:01,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:01,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:13:01,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758659107] [2025-03-03 15:13:01,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:01,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:13:01,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:01,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:13:01,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:13:01,247 INFO L87 Difference]: Start difference. First operand 227 states and 292 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:01,562 INFO L93 Difference]: Finished difference Result 365 states and 488 transitions. [2025-03-03 15:13:01,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:13:01,562 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:13:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:01,563 INFO L225 Difference]: With dead ends: 365 [2025-03-03 15:13:01,563 INFO L226 Difference]: Without dead ends: 350 [2025-03-03 15:13:01,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:13:01,563 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 712 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:01,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1242 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:13:01,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-03 15:13:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 206. [2025-03-03 15:13:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 267 transitions. [2025-03-03 15:13:01,566 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 267 transitions. Word has length 71 [2025-03-03 15:13:01,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:01,566 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 267 transitions. [2025-03-03 15:13:01,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:01,566 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2025-03-03 15:13:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:13:01,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:01,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:13:01,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:13:01,566 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-03 15:13:01,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:01,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1709352252, now seen corresponding path program 1 times [2025-03-03 15:13:01,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:01,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081971964] [2025-03-03 15:13:01,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:01,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:01,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:13:01,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:13:01,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:01,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:01,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:01,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081971964] [2025-03-03 15:13:01,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081971964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:01,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:01,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:13:01,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582734511] [2025-03-03 15:13:01,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:01,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:13:01,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:01,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:13:01,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:13:01,642 INFO L87 Difference]: Start difference. First operand 206 states and 267 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:01,735 INFO L93 Difference]: Finished difference Result 1054 states and 1531 transitions. [2025-03-03 15:13:01,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:13:01,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-03 15:13:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:01,738 INFO L225 Difference]: With dead ends: 1054 [2025-03-03 15:13:01,738 INFO L226 Difference]: Without dead ends: 948 [2025-03-03 15:13:01,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:13:01,739 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 774 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:01,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1336 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:13:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-03-03 15:13:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 310. [2025-03-03 15:13:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 420 transitions. [2025-03-03 15:13:01,746 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 420 transitions. Word has length 93 [2025-03-03 15:13:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:01,746 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 420 transitions. [2025-03-03 15:13:01,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 420 transitions. [2025-03-03 15:13:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:13:01,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:01,747 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-03 15:13:01,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:13:01,748 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-03 15:13:01,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:01,748 INFO L85 PathProgramCache]: Analyzing trace with hash -747684288, now seen corresponding path program 1 times [2025-03-03 15:13:01,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:01,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070756821] [2025-03-03 15:13:01,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:01,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:01,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:13:01,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:13:01,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:01,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:01,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070756821] [2025-03-03 15:13:01,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070756821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:01,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:01,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:13:01,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184913994] [2025-03-03 15:13:01,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:01,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:13:01,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:01,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:13:01,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:13:01,823 INFO L87 Difference]: Start difference. First operand 310 states and 420 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:01,887 INFO L93 Difference]: Finished difference Result 1256 states and 1818 transitions. [2025-03-03 15:13:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:13:01,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:01,890 INFO L225 Difference]: With dead ends: 1256 [2025-03-03 15:13:01,890 INFO L226 Difference]: Without dead ends: 1046 [2025-03-03 15:13:01,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:13:01,890 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 579 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:01,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 823 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:13:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-03 15:13:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 518. [2025-03-03 15:13:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.4081237911025144) internal successors, (728), 517 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 728 transitions. [2025-03-03 15:13:01,900 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 728 transitions. Word has length 95 [2025-03-03 15:13:01,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:01,900 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 728 transitions. [2025-03-03 15:13:01,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 728 transitions. [2025-03-03 15:13:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:13:01,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:01,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:13:01,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:13:01,901 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-03 15:13:01,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:01,903 INFO L85 PathProgramCache]: Analyzing trace with hash -884037152, now seen corresponding path program 1 times [2025-03-03 15:13:01,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:01,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152921289] [2025-03-03 15:13:01,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:01,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:01,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:13:01,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:13:01,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:01,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:01,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152921289] [2025-03-03 15:13:01,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152921289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:01,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:01,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:13:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125955955] [2025-03-03 15:13:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:01,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:13:01,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:01,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:13:01,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:13:01,984 INFO L87 Difference]: Start difference. First operand 518 states and 728 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:02,046 INFO L93 Difference]: Finished difference Result 1464 states and 2126 transitions. [2025-03-03 15:13:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:13:02,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:02,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:02,049 INFO L225 Difference]: With dead ends: 1464 [2025-03-03 15:13:02,049 INFO L226 Difference]: Without dead ends: 1254 [2025-03-03 15:13:02,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:13:02,049 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 579 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:02,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 771 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:13:02,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-03 15:13:02,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 830. [2025-03-03 15:13:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 1.4342581423401688) internal successors, (1189), 829 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1189 transitions. [2025-03-03 15:13:02,060 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1189 transitions. Word has length 95 [2025-03-03 15:13:02,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:02,060 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1189 transitions. [2025-03-03 15:13:02,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1189 transitions. [2025-03-03 15:13:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:13:02,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:02,061 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-03 15:13:02,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:13:02,061 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-03 15:13:02,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:02,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1039459712, now seen corresponding path program 1 times [2025-03-03 15:13:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:02,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771455966] [2025-03-03 15:13:02,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:02,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:13:02,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:13:02,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:02,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:02,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:02,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:02,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771455966] [2025-03-03 15:13:02,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771455966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:02,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:02,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:13:02,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20398321] [2025-03-03 15:13:02,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:02,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:13:02,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:02,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:13:02,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:13:02,133 INFO L87 Difference]: Start difference. First operand 830 states and 1189 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:02,186 INFO L93 Difference]: Finished difference Result 1672 states and 2434 transitions. [2025-03-03 15:13:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:13:02,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:02,190 INFO L225 Difference]: With dead ends: 1672 [2025-03-03 15:13:02,190 INFO L226 Difference]: Without dead ends: 1462 [2025-03-03 15:13:02,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:13:02,191 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 625 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:02,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 747 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:13:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2025-03-03 15:13:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1038. [2025-03-03 15:13:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.4435872709739634) internal successors, (1497), 1037 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1497 transitions. [2025-03-03 15:13:02,202 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1497 transitions. Word has length 95 [2025-03-03 15:13:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:02,202 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1497 transitions. [2025-03-03 15:13:02,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1497 transitions. [2025-03-03 15:13:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:13:02,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:02,203 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-03 15:13:02,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:13:02,204 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-03 15:13:02,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:02,204 INFO L85 PathProgramCache]: Analyzing trace with hash -769620734, now seen corresponding path program 1 times [2025-03-03 15:13:02,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:02,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943819661] [2025-03-03 15:13:02,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:02,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:02,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:13:02,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:13:02,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:02,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:02,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:02,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943819661] [2025-03-03 15:13:02,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943819661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:02,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:02,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:13:02,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150813543] [2025-03-03 15:13:02,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:02,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:13:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:02,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:13:02,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:13:02,325 INFO L87 Difference]: Start difference. First operand 1038 states and 1497 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:02,379 INFO L93 Difference]: Finished difference Result 1978 states and 2886 transitions. [2025-03-03 15:13:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:13:02,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:02,381 INFO L225 Difference]: With dead ends: 1978 [2025-03-03 15:13:02,381 INFO L226 Difference]: Without dead ends: 1040 [2025-03-03 15:13:02,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:13:02,382 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 201 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:02,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 378 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:13:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-03-03 15:13:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1038. [2025-03-03 15:13:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.433944069431051) internal successors, (1487), 1037 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1487 transitions. [2025-03-03 15:13:02,392 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1487 transitions. Word has length 95 [2025-03-03 15:13:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:02,392 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1487 transitions. [2025-03-03 15:13:02,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1487 transitions. [2025-03-03 15:13:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:13:02,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:02,393 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-03 15:13:02,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:13:02,393 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-03 15:13:02,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash -805638053, now seen corresponding path program 1 times [2025-03-03 15:13:02,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:02,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346484846] [2025-03-03 15:13:02,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:02,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:02,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:13:02,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:13:02,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:02,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:02,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:02,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346484846] [2025-03-03 15:13:02,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346484846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:02,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:02,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:13:02,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038397584] [2025-03-03 15:13:02,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:02,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:13:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:02,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:13:02,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:02,425 INFO L87 Difference]: Start difference. First operand 1038 states and 1487 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-03 15:13:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:02,446 INFO L93 Difference]: Finished difference Result 2798 states and 4049 transitions. [2025-03-03 15:13:02,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:13:02,447 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-03 15:13:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:02,450 INFO L225 Difference]: With dead ends: 2798 [2025-03-03 15:13:02,450 INFO L226 Difference]: Without dead ends: 1860 [2025-03-03 15:13:02,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:02,453 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 67 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:02,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 368 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:13:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2025-03-03 15:13:02,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1858. [2025-03-03 15:13:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 1.4184168012924072) internal successors, (2634), 1857 states have internal predecessors, (2634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2634 transitions. [2025-03-03 15:13:02,469 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2634 transitions. Word has length 95 [2025-03-03 15:13:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:02,469 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2634 transitions. [2025-03-03 15:13:02,469 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-03 15:13:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2634 transitions. [2025-03-03 15:13:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:13:02,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:02,470 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-03 15:13:02,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:13:02,471 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-03 15:13:02,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:02,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1085673184, now seen corresponding path program 1 times [2025-03-03 15:13:02,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:02,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233630716] [2025-03-03 15:13:02,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:02,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:02,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:13:02,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:13:02,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:02,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:02,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:02,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233630716] [2025-03-03 15:13:02,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233630716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:02,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:02,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:13:02,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283090263] [2025-03-03 15:13:02,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:02,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:13:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:02,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:13:02,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:13:02,541 INFO L87 Difference]: Start difference. First operand 1858 states and 2634 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:02,603 INFO L93 Difference]: Finished difference Result 3428 states and 4895 transitions. [2025-03-03 15:13:02,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:13:02,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:02,609 INFO L225 Difference]: With dead ends: 3428 [2025-03-03 15:13:02,609 INFO L226 Difference]: Without dead ends: 3036 [2025-03-03 15:13:02,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:13:02,610 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 587 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:02,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 812 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:13:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2025-03-03 15:13:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2248. [2025-03-03 15:13:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 2247 states have (on average 1.4214508233199823) internal successors, (3194), 2247 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3194 transitions. [2025-03-03 15:13:02,629 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3194 transitions. Word has length 95 [2025-03-03 15:13:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:02,630 INFO L471 AbstractCegarLoop]: Abstraction has 2248 states and 3194 transitions. [2025-03-03 15:13:02,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 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-03 15:13:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3194 transitions. [2025-03-03 15:13:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:13:02,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:02,631 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-03 15:13:02,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:13:02,631 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-03 15:13:02,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:02,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1941145606, now seen corresponding path program 1 times [2025-03-03 15:13:02,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:02,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186086972] [2025-03-03 15:13:02,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:02,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:02,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:13:02,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:13:02,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:02,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:02,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186086972] [2025-03-03 15:13:02,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186086972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:02,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:02,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:13:02,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189658933] [2025-03-03 15:13:02,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:02,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:13:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:02,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:13:02,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:02,686 INFO L87 Difference]: Start difference. First operand 2248 states and 3194 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-03 15:13:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:02,706 INFO L93 Difference]: Finished difference Result 5708 states and 8130 transitions. [2025-03-03 15:13:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:13:02,706 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-03 15:13:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:02,713 INFO L225 Difference]: With dead ends: 5708 [2025-03-03 15:13:02,713 INFO L226 Difference]: Without dead ends: 3560 [2025-03-03 15:13:02,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:02,715 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 78 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:02,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 343 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:13:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2025-03-03 15:13:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3382. [2025-03-03 15:13:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3382 states, 3381 states have (on average 1.4072759538598048) internal successors, (4758), 3381 states have internal predecessors, (4758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4758 transitions. [2025-03-03 15:13:02,762 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4758 transitions. Word has length 96 [2025-03-03 15:13:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:02,763 INFO L471 AbstractCegarLoop]: Abstraction has 3382 states and 4758 transitions. [2025-03-03 15:13:02,763 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-03 15:13:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4758 transitions. [2025-03-03 15:13:02,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:13:02,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:02,764 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-03 15:13:02,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:13:02,764 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-03 15:13:02,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1630603392, now seen corresponding path program 1 times [2025-03-03 15:13:02,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:02,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419892785] [2025-03-03 15:13:02,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:02,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:02,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:13:02,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:13:02,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:02,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:02,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:02,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419892785] [2025-03-03 15:13:02,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419892785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:02,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:02,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:13:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202420301] [2025-03-03 15:13:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:02,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:13:02,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:02,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:13:02,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:02,826 INFO L87 Difference]: Start difference. First operand 3382 states and 4758 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-03 15:13:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:02,852 INFO L93 Difference]: Finished difference Result 9682 states and 13594 transitions. [2025-03-03 15:13:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:13:02,853 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-03 15:13:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:02,871 INFO L225 Difference]: With dead ends: 9682 [2025-03-03 15:13:02,871 INFO L226 Difference]: Without dead ends: 6400 [2025-03-03 15:13:02,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:02,876 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 71 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:02,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 343 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:13:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6400 states. [2025-03-03 15:13:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6400 to 6134. [2025-03-03 15:13:02,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 6133 states have (on average 1.393771400619599) internal successors, (8548), 6133 states have internal predecessors, (8548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 8548 transitions. [2025-03-03 15:13:02,927 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 8548 transitions. Word has length 97 [2025-03-03 15:13:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:02,927 INFO L471 AbstractCegarLoop]: Abstraction has 6134 states and 8548 transitions. [2025-03-03 15:13:02,927 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-03 15:13:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 8548 transitions. [2025-03-03 15:13:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:13:02,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:02,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:13:02,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:13:02,928 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-03 15:13:02,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:02,929 INFO L85 PathProgramCache]: Analyzing trace with hash -251076935, now seen corresponding path program 1 times [2025-03-03 15:13:02,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:02,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120333491] [2025-03-03 15:13:02,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:02,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:02,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:13:02,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:13:02,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:02,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120333491] [2025-03-03 15:13:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120333491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:02,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:02,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:13:02,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360299344] [2025-03-03 15:13:02,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:02,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:13:02,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:02,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:13:02,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:02,989 INFO L87 Difference]: Start difference. First operand 6134 states and 8548 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-03 15:13:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:03,022 INFO L93 Difference]: Finished difference Result 17674 states and 24502 transitions. [2025-03-03 15:13:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:13:03,022 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-03 15:13:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:03,038 INFO L225 Difference]: With dead ends: 17674 [2025-03-03 15:13:03,038 INFO L226 Difference]: Without dead ends: 11640 [2025-03-03 15:13:03,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:03,045 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 64 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:03,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 342 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:13:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11640 states. [2025-03-03 15:13:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11640 to 11110. [2025-03-03 15:13:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11110 states, 11109 states have (on average 1.3745611666216582) internal successors, (15270), 11109 states have internal predecessors, (15270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11110 states to 11110 states and 15270 transitions. [2025-03-03 15:13:03,139 INFO L78 Accepts]: Start accepts. Automaton has 11110 states and 15270 transitions. Word has length 98 [2025-03-03 15:13:03,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:03,139 INFO L471 AbstractCegarLoop]: Abstraction has 11110 states and 15270 transitions. [2025-03-03 15:13:03,139 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-03 15:13:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 11110 states and 15270 transitions. [2025-03-03 15:13:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:13:03,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:13:03,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:13:03,140 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-03 15:13:03,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:03,140 INFO L85 PathProgramCache]: Analyzing trace with hash 900515987, now seen corresponding path program 1 times [2025-03-03 15:13:03,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:03,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196727342] [2025-03-03 15:13:03,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:03,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:03,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:13:03,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:13:03,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:03,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:03,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:03,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196727342] [2025-03-03 15:13:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196727342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:03,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:03,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:13:03,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729961036] [2025-03-03 15:13:03,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:03,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:13:03,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:03,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:13:03,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:03,236 INFO L87 Difference]: Start difference. First operand 11110 states and 15270 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-03 15:13:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:03,292 INFO L93 Difference]: Finished difference Result 32074 states and 43744 transitions. [2025-03-03 15:13:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:13:03,293 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-03 15:13:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:03,322 INFO L225 Difference]: With dead ends: 32074 [2025-03-03 15:13:03,322 INFO L226 Difference]: Without dead ends: 21064 [2025-03-03 15:13:03,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:03,335 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 54 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:03,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 340 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:13:03,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21064 states. [2025-03-03 15:13:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21064 to 20006. [2025-03-03 15:13:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20006 states, 20005 states have (on average 1.3495626093476631) internal successors, (26998), 20005 states have internal predecessors, (26998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20006 states to 20006 states and 26998 transitions. [2025-03-03 15:13:03,529 INFO L78 Accepts]: Start accepts. Automaton has 20006 states and 26998 transitions. Word has length 99 [2025-03-03 15:13:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:03,529 INFO L471 AbstractCegarLoop]: Abstraction has 20006 states and 26998 transitions. [2025-03-03 15:13:03,529 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-03 15:13:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 20006 states and 26998 transitions. [2025-03-03 15:13:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:13:03,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:03,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:13:03,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:13:03,530 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-03 15:13:03,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash -478706580, now seen corresponding path program 1 times [2025-03-03 15:13:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:03,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917716385] [2025-03-03 15:13:03,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:03,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:03,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:13:03,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:13:03,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:03,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:03,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:03,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917716385] [2025-03-03 15:13:03,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917716385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:03,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:03,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:13:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125567165] [2025-03-03 15:13:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:03,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:13:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:03,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:13:03,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:13:03,704 INFO L87 Difference]: Start difference. First operand 20006 states and 26998 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:03,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:03,755 INFO L93 Difference]: Finished difference Result 20488 states and 27639 transitions. [2025-03-03 15:13:03,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:13:03,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:13:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:03,782 INFO L225 Difference]: With dead ends: 20488 [2025-03-03 15:13:03,782 INFO L226 Difference]: Without dead ends: 20486 [2025-03-03 15:13:03,789 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-03 15:13:03,789 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 763 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-03 15:13:03,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 763 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:13:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2025-03-03 15:13:03,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20486. [2025-03-03 15:13:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20486 states, 20485 states have (on average 1.3319990236758603) internal successors, (27286), 20485 states have internal predecessors, (27286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20486 states to 20486 states and 27286 transitions. [2025-03-03 15:13:04,081 INFO L78 Accepts]: Start accepts. Automaton has 20486 states and 27286 transitions. Word has length 100 [2025-03-03 15:13:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:04,082 INFO L471 AbstractCegarLoop]: Abstraction has 20486 states and 27286 transitions. [2025-03-03 15:13:04,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 20486 states and 27286 transitions. [2025-03-03 15:13:04,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:13:04,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:04,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:13:04,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:13:04,083 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-03 15:13:04,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:04,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1477032781, now seen corresponding path program 1 times [2025-03-03 15:13:04,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:04,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823540386] [2025-03-03 15:13:04,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:04,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:13:04,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:13:04,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:04,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823540386] [2025-03-03 15:13:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823540386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:04,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:13:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260364922] [2025-03-03 15:13:04,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:04,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:13:04,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:04,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:13:04,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:04,177 INFO L87 Difference]: Start difference. First operand 20486 states and 27286 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:04,290 INFO L93 Difference]: Finished difference Result 41514 states and 55328 transitions. [2025-03-03 15:13:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:13:04,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:13:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:04,317 INFO L225 Difference]: With dead ends: 41514 [2025-03-03 15:13:04,317 INFO L226 Difference]: Without dead ends: 21128 [2025-03-03 15:13:04,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:04,334 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 87 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:04,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 282 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:13:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21128 states. [2025-03-03 15:13:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21128 to 21126. [2025-03-03 15:13:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21126 states, 21125 states have (on average 1.3151242603550295) internal successors, (27782), 21125 states have internal predecessors, (27782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21126 states to 21126 states and 27782 transitions. [2025-03-03 15:13:04,514 INFO L78 Accepts]: Start accepts. Automaton has 21126 states and 27782 transitions. Word has length 100 [2025-03-03 15:13:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:04,514 INFO L471 AbstractCegarLoop]: Abstraction has 21126 states and 27782 transitions. [2025-03-03 15:13:04,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 21126 states and 27782 transitions. [2025-03-03 15:13:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 15:13:04,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:04,517 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] [2025-03-03 15:13:04,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:13:04,518 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-03 15:13:04,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:04,518 INFO L85 PathProgramCache]: Analyzing trace with hash 895650102, now seen corresponding path program 1 times [2025-03-03 15:13:04,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:04,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725636103] [2025-03-03 15:13:04,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:04,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:04,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 15:13:04,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 15:13:04,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:04,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:04,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:04,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725636103] [2025-03-03 15:13:04,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725636103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:13:04,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640294418] [2025-03-03 15:13:04,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:04,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:13:04,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:13:04,889 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-03 15:13:04,890 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-03 15:13:05,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 15:13:05,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 15:13:05,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:05,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:05,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 15:13:05,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:13:05,727 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-03 15:13:05,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:13:06,939 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-03 15:13:06,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640294418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:13:06,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:13:06,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2025-03-03 15:13:06,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157674605] [2025-03-03 15:13:06,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:13:06,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 15:13:06,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:06,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 15:13:06,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2025-03-03 15:13:06,941 INFO L87 Difference]: Start difference. First operand 21126 states and 27782 transitions. Second operand has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 30 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:13,599 INFO L93 Difference]: Finished difference Result 182908 states and 239657 transitions. [2025-03-03 15:13:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-03-03 15:13:13,600 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 30 states have internal predecessors, (343), 0 states have call successors, (0), 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-03 15:13:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:13,763 INFO L225 Difference]: With dead ends: 182908 [2025-03-03 15:13:13,763 INFO L226 Difference]: Without dead ends: 161882 [2025-03-03 15:13:13,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10576 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4750, Invalid=27470, Unknown=0, NotChecked=0, Total=32220 [2025-03-03 15:13:13,801 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 3770 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 4350 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3770 SdHoareTripleChecker+Valid, 3327 SdHoareTripleChecker+Invalid, 4414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 4350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:13,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3770 Valid, 3327 Invalid, 4414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 4350 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 15:13:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161882 states. [2025-03-03 15:13:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161882 to 106612. [2025-03-03 15:13:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106612 states, 106611 states have (on average 1.3051748881447505) internal successors, (139146), 106611 states have internal predecessors, (139146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106612 states to 106612 states and 139146 transitions. [2025-03-03 15:13:15,308 INFO L78 Accepts]: Start accepts. Automaton has 106612 states and 139146 transitions. Word has length 127 [2025-03-03 15:13:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:15,309 INFO L471 AbstractCegarLoop]: Abstraction has 106612 states and 139146 transitions. [2025-03-03 15:13:15,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 30 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 106612 states and 139146 transitions. [2025-03-03 15:13:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 15:13:15,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:15,323 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-03 15:13:15,331 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-03 15:13:15,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:13:15,524 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:13:15,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash 322156083, now seen corresponding path program 1 times [2025-03-03 15:13:15,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:15,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958271408] [2025-03-03 15:13:15,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:15,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:15,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 15:13:15,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 15:13:15,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:15,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:16,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:16,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958271408] [2025-03-03 15:13:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958271408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:13:16,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178544268] [2025-03-03 15:13:16,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:16,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:13:16,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:13:16,065 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-03 15:13:16,066 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-03 15:13:16,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 15:13:16,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 15:13:16,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:16,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:16,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 15:13:16,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:13:16,729 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-03 15:13:16,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:13:17,089 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-03 15:13:17,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178544268] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:13:17,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:13:17,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 27 [2025-03-03 15:13:17,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814819340] [2025-03-03 15:13:17,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:13:17,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 15:13:17,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:17,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 15:13:17,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:13:17,091 INFO L87 Difference]: Start difference. First operand 106612 states and 139146 transitions. Second operand has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 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-03 15:13:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:21,061 INFO L93 Difference]: Finished difference Result 390755 states and 509768 transitions. [2025-03-03 15:13:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-03 15:13:21,061 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 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) Word has length 128 [2025-03-03 15:13:21,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:21,432 INFO L225 Difference]: With dead ends: 390755 [2025-03-03 15:13:21,432 INFO L226 Difference]: Without dead ends: 284295 [2025-03-03 15:13:21,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4318 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2066, Invalid=12214, Unknown=0, NotChecked=0, Total=14280 [2025-03-03 15:13:21,529 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 3228 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 3233 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3228 SdHoareTripleChecker+Valid, 3185 SdHoareTripleChecker+Invalid, 3269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:21,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3228 Valid, 3185 Invalid, 3269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3233 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:13:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284295 states. [2025-03-03 15:13:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284295 to 186306. [2025-03-03 15:13:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186306 states, 186305 states have (on average 1.2994498268967554) internal successors, (242094), 186305 states have internal predecessors, (242094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186306 states to 186306 states and 242094 transitions. [2025-03-03 15:13:24,239 INFO L78 Accepts]: Start accepts. Automaton has 186306 states and 242094 transitions. Word has length 128 [2025-03-03 15:13:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:24,239 INFO L471 AbstractCegarLoop]: Abstraction has 186306 states and 242094 transitions. [2025-03-03 15:13:24,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 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-03 15:13:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 186306 states and 242094 transitions. [2025-03-03 15:13:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 15:13:24,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:24,254 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-03 15:13:24,260 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-03 15:13:24,454 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,SelfDestructingSolverStorable41 [2025-03-03 15:13:24,455 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:13:24,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:24,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1658197589, now seen corresponding path program 1 times [2025-03-03 15:13:24,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:24,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426489522] [2025-03-03 15:13:24,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:24,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:24,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 15:13:24,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 15:13:24,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:24,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 15:13:24,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426489522] [2025-03-03 15:13:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426489522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:24,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:13:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321075665] [2025-03-03 15:13:24,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:13:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:24,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:13:24,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:13:24,525 INFO L87 Difference]: Start difference. First operand 186306 states and 242094 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-03 15:13:25,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:25,911 INFO L93 Difference]: Finished difference Result 363868 states and 472658 transitions. [2025-03-03 15:13:25,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:13:25,912 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 129 [2025-03-03 15:13:25,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:26,235 INFO L225 Difference]: With dead ends: 363868 [2025-03-03 15:13:26,239 INFO L226 Difference]: Without dead ends: 257408 [2025-03-03 15:13:26,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:13:26,332 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 102 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:26,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 279 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:13:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257408 states. [2025-03-03 15:13:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257408 to 185478. [2025-03-03 15:13:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185478 states, 185477 states have (on average 1.2963224550752923) internal successors, (240438), 185477 states have internal predecessors, (240438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185478 states to 185478 states and 240438 transitions. [2025-03-03 15:13:29,023 INFO L78 Accepts]: Start accepts. Automaton has 185478 states and 240438 transitions. Word has length 129 [2025-03-03 15:13:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:29,025 INFO L471 AbstractCegarLoop]: Abstraction has 185478 states and 240438 transitions. [2025-03-03 15:13:29,025 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-03 15:13:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 185478 states and 240438 transitions. [2025-03-03 15:13:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 15:13:29,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:29,037 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-03 15:13:29,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:13:29,037 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:13:29,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:29,038 INFO L85 PathProgramCache]: Analyzing trace with hash 88785878, now seen corresponding path program 1 times [2025-03-03 15:13:29,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:29,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928773080] [2025-03-03 15:13:29,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:29,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:29,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 15:13:29,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 15:13:29,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:29,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:29,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:29,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928773080] [2025-03-03 15:13:29,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928773080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:13:29,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956208411] [2025-03-03 15:13:29,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:29,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:13:29,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:13:29,471 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-03 15:13:29,472 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-03 15:13:29,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 15:13:29,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 15:13:29,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:29,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:29,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 15:13:29,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:13:30,064 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-03 15:13:30,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:13:30,569 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-03 15:13:30,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956208411] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:13:30,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:13:30,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 29 [2025-03-03 15:13:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637893372] [2025-03-03 15:13:30,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:13:30,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 15:13:30,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:30,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 15:13:30,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2025-03-03 15:13:30,571 INFO L87 Difference]: Start difference. First operand 185478 states and 240438 transitions. Second operand has 29 states, 29 states have (on average 12.0) internal successors, (348), 29 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:36,349 INFO L93 Difference]: Finished difference Result 654429 states and 850301 transitions. [2025-03-03 15:13:36,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2025-03-03 15:13:36,349 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 12.0) internal successors, (348), 29 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-03-03 15:13:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:36,960 INFO L225 Difference]: With dead ends: 654429 [2025-03-03 15:13:36,961 INFO L226 Difference]: Without dead ends: 548401 [2025-03-03 15:13:37,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7330 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2500, Invalid=19850, Unknown=0, NotChecked=0, Total=22350 [2025-03-03 15:13:37,017 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 1634 mSDsluCounter, 3981 mSDsCounter, 0 mSdLazyCounter, 4356 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 4186 SdHoareTripleChecker+Invalid, 4384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:37,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 4186 Invalid, 4384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4356 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 15:13:37,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548401 states. [2025-03-03 15:13:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548401 to 241324. [2025-03-03 15:13:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241324 states, 241323 states have (on average 1.295400769922469) internal successors, (312610), 241323 states have internal predecessors, (312610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241324 states to 241324 states and 312610 transitions. [2025-03-03 15:13:41,540 INFO L78 Accepts]: Start accepts. Automaton has 241324 states and 312610 transitions. Word has length 129 [2025-03-03 15:13:41,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:41,540 INFO L471 AbstractCegarLoop]: Abstraction has 241324 states and 312610 transitions. [2025-03-03 15:13:41,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 12.0) internal successors, (348), 29 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 241324 states and 312610 transitions. [2025-03-03 15:13:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 15:13:41,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:41,553 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-03 15:13:41,560 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-03 15:13:41,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:13:41,753 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:13:41,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:41,754 INFO L85 PathProgramCache]: Analyzing trace with hash 508416692, now seen corresponding path program 1 times [2025-03-03 15:13:41,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:41,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077973622] [2025-03-03 15:13:41,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:41,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:41,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 15:13:41,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 15:13:41,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:41,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:42,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:42,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077973622] [2025-03-03 15:13:42,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077973622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:13:42,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688584175] [2025-03-03 15:13:42,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:42,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:13:42,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:13:42,268 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-03 15:13:42,270 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-03 15:13:42,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 15:13:42,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 15:13:42,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:42,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:42,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 15:13:42,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:13:43,066 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-03 15:13:43,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:13:43,638 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-03 15:13:43,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688584175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:13:43,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:13:43,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 32 [2025-03-03 15:13:43,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216951250] [2025-03-03 15:13:43,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:13:43,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 15:13:43,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:43,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 15:13:43,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2025-03-03 15:13:43,641 INFO L87 Difference]: Start difference. First operand 241324 states and 312610 transitions. Second operand has 32 states, 32 states have (on average 10.8125) internal successors, (346), 32 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:13:50,928 INFO L93 Difference]: Finished difference Result 681556 states and 886182 transitions. [2025-03-03 15:13:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-03-03 15:13:50,929 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 10.8125) internal successors, (346), 32 states have internal predecessors, (346), 0 states have call successors, (0), 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-03 15:13:50,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:13:51,554 INFO L225 Difference]: With dead ends: 681556 [2025-03-03 15:13:51,554 INFO L226 Difference]: Without dead ends: 488820 [2025-03-03 15:13:51,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8885 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3761, Invalid=21045, Unknown=0, NotChecked=0, Total=24806 [2025-03-03 15:13:51,628 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 7723 mSDsluCounter, 2430 mSDsCounter, 0 mSdLazyCounter, 3299 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7723 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 3299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:13:51,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7723 Valid, 2626 Invalid, 3423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 3299 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 15:13:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488820 states. [2025-03-03 15:13:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488820 to 257571. [2025-03-03 15:13:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257571 states, 257570 states have (on average 1.2805217998990566) internal successors, (329824), 257570 states have internal predecessors, (329824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257571 states to 257571 states and 329824 transitions. [2025-03-03 15:13:55,776 INFO L78 Accepts]: Start accepts. Automaton has 257571 states and 329824 transitions. Word has length 129 [2025-03-03 15:13:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:13:55,777 INFO L471 AbstractCegarLoop]: Abstraction has 257571 states and 329824 transitions. [2025-03-03 15:13:55,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 10.8125) internal successors, (346), 32 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:13:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 257571 states and 329824 transitions. [2025-03-03 15:13:55,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 15:13:55,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:13:55,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:13:56,189 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forcibly destroying the process [2025-03-03 15:13:56,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 15:13:56,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:13:56,190 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-03-03 15:13:56,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:13:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash 476387083, now seen corresponding path program 1 times [2025-03-03 15:13:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:13:56,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318597204] [2025-03-03 15:13:56,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:13:56,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:13:56,201 WARN L724 oredProcess$PipePump]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] The stream was forcibly closed: stdIn [2025-03-03 15:13:56,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 15:13:56,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 15:13:56,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:13:56,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:13:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:13:56,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:13:56,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318597204] [2025-03-03 15:13:56,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318597204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:13:56,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:13:56,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:13:56,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273233731] [2025-03-03 15:13:56,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:13:56,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:13:56,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:13:56,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:13:56,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:13:56,256 INFO L87 Difference]: Start difference. First operand 257571 states and 329824 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)