./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.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-var-start-time.5.2.ufo.BOUNDED-10.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 755ab1a46ae9bd419f57fa80d8e9c25878a5804529700435e5fe8941ed66455d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:09:13,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:09:14,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:09:14,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:09:14,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:09:14,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:09:14,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:09:14,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:09:14,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:09:14,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:09:14,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:09:14,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:09:14,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:09:14,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:09:14,040 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:09:14,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:09:14,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:09:14,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:09:14,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:09:14,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:09:14,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:09:14,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:09:14,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:09:14,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:09:14,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:09:14,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:09:14,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:09:14,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:09:14,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:09:14,043 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 -> 755ab1a46ae9bd419f57fa80d8e9c25878a5804529700435e5fe8941ed66455d [2025-03-03 15:09:14,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:09:14,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:09:14,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:09:14,285 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:09:14,286 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:09:14,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-03-03 15:09:15,374 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd70ba05/e39c9fb8de934299877ba460cb00c621/FLAGfaab90dfb [2025-03-03 15:09:15,749 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:09:15,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-03-03 15:09:15,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd70ba05/e39c9fb8de934299877ba460cb00c621/FLAGfaab90dfb [2025-03-03 15:09:15,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd70ba05/e39c9fb8de934299877ba460cb00c621 [2025-03-03 15:09:15,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:09:15,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:09:15,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:09:15,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:09:15,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:09:15,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:09:15" (1/1) ... [2025-03-03 15:09:15,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d7f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:15, skipping insertion in model container [2025-03-03 15:09:15,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:09:15" (1/1) ... [2025-03-03 15:09:16,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:09:16,392 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[14256,14269] [2025-03-03 15:09:16,429 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20101,20114] [2025-03-03 15:09:16,434 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[21333,21346] [2025-03-03 15:09:16,445 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23565,23578] [2025-03-03 15:09:16,458 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[26974,26987] [2025-03-03 15:09:16,484 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[33563,33576] [2025-03-03 15:09:16,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:09:16,900 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:09:16,951 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[14256,14269] [2025-03-03 15:09:16,973 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20101,20114] [2025-03-03 15:09:16,980 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[21333,21346] [2025-03-03 15:09:16,996 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23565,23578] [2025-03-03 15:09:17,012 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[26974,26987] [2025-03-03 15:09:17,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-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[33563,33576] [2025-03-03 15:09:17,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:09:17,305 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:09:17,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:17 WrapperNode [2025-03-03 15:09:17,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:09:17,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:09:17,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:09:17,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:09:17,312 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:09:17" (1/1) ... [2025-03-03 15:09:17,369 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:09:17" (1/1) ... [2025-03-03 15:09:17,530 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 10106 [2025-03-03 15:09:17,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:09:17,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:09:17,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:09:17,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:09:17,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:17" (1/1) ... [2025-03-03 15:09:17,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:17" (1/1) ... [2025-03-03 15:09:17,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:17" (1/1) ... [2025-03-03 15:09:17,628 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:09:17,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:17" (1/1) ... [2025-03-03 15:09:17,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:17" (1/1) ... [2025-03-03 15:09:17,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:17" (1/1) ... [2025-03-03 15:09:17,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:17" (1/1) ... [2025-03-03 15:09:17,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:17" (1/1) ... [2025-03-03 15:09:17,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:17" (1/1) ... [2025-03-03 15:09:17,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:09:17,774 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:09:17,774 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:09:17,775 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:09:17,775 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:17" (1/1) ... [2025-03-03 15:09:17,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:09:17,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:09:17,804 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:09:17,806 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:09:17,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:09:17,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:09:17,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:09:17,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:09:18,123 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:09:18,124 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:09:21,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12655: havoc main_~node5__m5~69#1; [2025-03-03 15:09:21,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3673: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~23#1; [2025-03-03 15:09:21,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11602: havoc main_~main____CPAchecker_TMP_0~96#1;havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~110#1;havoc main_~node5____CPAchecker_TMP_0~48#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15830: havoc main_~node5____CPAchecker_TMP_1~71#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8961: havoc main_~main____CPAchecker_TMP_0~67#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~81#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7640: havoc main_~node5____CPAchecker_TMP_1~26#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3412: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~20#1;havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7905: havoc main_~node5__m5~43#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11341: havoc main_~main____CPAchecker_TMP_0~93#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~107#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7113: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~61#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8699: havoc main_~node5____CPAchecker_TMP_1~32#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7378: havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13192: havoc main_~node4__m4~23#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6852: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~58#1;havoc main_~node5____CPAchecker_TMP_0~22#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15573: havoc main_~node5__m5~85#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4210: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~29#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10024: havoc main_~node5____CPAchecker_TMP_1~39#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5796: havoc main_~node5____CPAchecker_TMP_1~16#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10289: havoc main_~node4__m4~19#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3155: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~17#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11084: havoc main_~main____CPAchecker_TMP_0~90#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~104#1;havoc main_~node5____CPAchecker_TMP_0~45#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3949: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~26#1;havoc main_~node5____CPAchecker_TMP_0~6#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node2__m2~1#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8442: havoc main_~node5__m5~46#1;havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-03 15:09:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13464: havoc main_~node5____CPAchecker_TMP_1~58#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7387: havoc main_~node5__m5~40#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13729: havoc main_~node5__m5~75#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13202: havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8181: havoc main_~node5____CPAchecker_TMP_1~29#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5539: havoc main_~node5__m5~30#1;havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9767: havoc main_~node5__m5~53#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10561: havoc main_~node5____CPAchecker_TMP_1~42#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6333: havoc main_~node5____CPAchecker_TMP_1~19#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10826: havoc main_~node5__m5~59#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5278: havoc main_~node5____CPAchecker_TMP_1~13#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10299: havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13211: havoc main_~node5__m5~72#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6076: havoc main_~node5__m5~33#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1585: havoc main_~node5__m5~5#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14534: havoc main_~main____CPAchecker_TMP_0~128#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~142#1;havoc main_~node5____CPAchecker_TMP_0~64#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2908: havoc main_~node5__m5~16#1;havoc main_~node4__m4~9#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10308: havoc main_~node5__m5~56#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9251: havoc main_~node5____CPAchecker_TMP_1~35#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5023: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~38#1;havoc main_~node5____CPAchecker_TMP_0~12#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: havoc main_~node3__m3~1#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14273: havoc main_~main____CPAchecker_TMP_0~125#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~139#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1325: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15332: havoc main_~main____CPAchecker_TMP_0~137#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~151#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4762: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~35#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6613: havoc main_~node4__m4~14#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11635: havoc main_~node5____CPAchecker_TMP_1~48#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15071: havoc main_~main____CPAchecker_TMP_0~134#1;havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~148#1;havoc main_~node5____CPAchecker_TMP_0~67#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12429: havoc main_~main____CPAchecker_TMP_0~105#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~119#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8994: havoc main_~node5__m5~49#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3445: havoc main_~node5____CPAchecker_TMP_1~3#1; [2025-03-03 15:09:21,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710: havoc main_~node4__m4~10#1; [2025-03-03 15:09:21,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14016: havoc main_~main____CPAchecker_TMP_0~122#1;havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~136#1;havoc main_~node5____CPAchecker_TMP_0~61#1; [2025-03-03 15:09:21,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1068: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:21,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12168: havoc main_~main____CPAchecker_TMP_0~102#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~116#1;havoc main_~node5____CPAchecker_TMP_0~51#1; [2025-03-03 15:09:21,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4505: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~32#1;havoc main_~node5____CPAchecker_TMP_0~9#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6885: havoc main_~node5____CPAchecker_TMP_1~22#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11378: havoc main_~node5__m5~62#1;havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7150: havoc main_~node5__m5~39#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14814: havoc main_~main____CPAchecker_TMP_0~131#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~145#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6623: havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188: havoc main_~node5__m5~17#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L810: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12966: havoc main_~main____CPAchecker_TMP_0~111#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~125#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11117: havoc main_~node5____CPAchecker_TMP_1~45#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3982: havoc main_~node5____CPAchecker_TMP_1~6#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: havoc main_~node5__m5~23#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node4__m4~1#1; [2025-03-03 15:09:21,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11911: havoc main_~main____CPAchecker_TMP_0~99#1;havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~113#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3720: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12705: havoc main_~main____CPAchecker_TMP_0~108#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~122#1;havoc main_~node5____CPAchecker_TMP_0~54#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2402: havoc main_~check__tmp~14#1;havoc main_~node5__m5~11#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9538: havoc main_~node2__m2~4#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6632: havoc main_~node5__m5~36#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7955: havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~70#1;havoc main_~node5____CPAchecker_TMP_0~28#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15884: havoc main_~main____CPAchecker_TMP_0~143#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~157#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3729: havoc main_~node5__m5~20#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7694: havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~67#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15623: havoc main_~main____CPAchecker_TMP_0~140#1;havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~154#1;havoc main_~node5____CPAchecker_TMP_0~70#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8753: havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~79#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14567: havoc main_~node5____CPAchecker_TMP_1~64#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883: havoc main_~check__tmp~10#1;havoc main_~node5__m5~7#1; [2025-03-03 15:09:21,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9548: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5056: havoc main_~node5____CPAchecker_TMP_1~12#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8492: havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~76#1;havoc main_~node5____CPAchecker_TMP_0~31#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5850: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~47#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10078: havoc main_~main____CPAchecker_TMP_0~79#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~93#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: havoc main_~node5__m5~1#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13779: havoc main_~main____CPAchecker_TMP_0~120#1;havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~134#1;havoc main_~node5____CPAchecker_TMP_0~60#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7437: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~64#1;havoc main_~node5____CPAchecker_TMP_0~25#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1096: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9817: havoc main_~main____CPAchecker_TMP_0~76#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~90#1;havoc main_~node5____CPAchecker_TMP_0~38#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5589: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~44#1;havoc main_~node5____CPAchecker_TMP_0~15#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14310: havoc main_~node5__m5~78#1;havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13518: havoc main_~main____CPAchecker_TMP_0~117#1;havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~131#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10876: havoc main_~main____CPAchecker_TMP_0~88#1;havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~102#1;havoc main_~node5____CPAchecker_TMP_0~44#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15104: havoc main_~node5____CPAchecker_TMP_1~67#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4799: havoc main_~node5__m5~26#1;havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-03 15:09:21,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8235: havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~73#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14049: havoc main_~node5____CPAchecker_TMP_1~61#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6387: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~53#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9558: havoc main_~node3__m3~8#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10615: havoc main_~main____CPAchecker_TMP_0~85#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~99#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L838: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12201: havoc main_~node5____CPAchecker_TMP_1~51#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4538: havoc main_~node5____CPAchecker_TMP_1~9#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12466: havoc main_~node4__m4~22#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5332: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~41#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1369: havoc main_~check__tmp~5#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6126: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~50#1;havoc main_~node5____CPAchecker_TMP_0~18#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13261: havoc main_~main____CPAchecker_TMP_0~114#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~128#1;havoc main_~node5____CPAchecker_TMP_0~57#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2691: havoc main_~node3__m3~5#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14847: havoc main_~node5__m5~81#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10358: havoc main_~main____CPAchecker_TMP_0~82#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~96#1;havoc main_~node5____CPAchecker_TMP_0~41#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11944: havoc main_~node5__m5~65#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12738: havoc main_~node5____CPAchecker_TMP_1~54#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13003: havoc main_~node5__m5~71#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9568: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12476: havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9305: havoc main_~main____CPAchecker_TMP_0~71#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~85#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15384: havoc main_~node4__m4~26#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9044: havoc main_~main____CPAchecker_TMP_0~68#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~82#1;havoc main_~node5____CPAchecker_TMP_0~34#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7988: havoc main_~node5____CPAchecker_TMP_1~28#1; [2025-03-03 15:09:21,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11689: havoc main_~main____CPAchecker_TMP_0~97#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~111#1; [2025-03-03 15:09:21,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3499: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~21#1; [2025-03-03 15:09:21,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9578: havoc main_~node4__m4~18#1; [2025-03-03 15:09:21,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11428: havoc main_~main____CPAchecker_TMP_0~94#1;havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~108#1;havoc main_~node5____CPAchecker_TMP_0~47#1; [2025-03-03 15:09:21,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12485: havoc main_~node5__m5~68#1; [2025-03-03 15:09:21,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15656: havoc main_~node5____CPAchecker_TMP_1~70#1; [2025-03-03 15:09:21,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7200: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~62#1;havoc main_~node5____CPAchecker_TMP_0~24#1; [2025-03-03 15:09:21,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2708: havoc main_~node4__m4~8#1; [2025-03-03 15:09:21,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15921: havoc main_~node5__m5~87#1; [2025-03-03 15:09:21,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15394: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3238: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~18#1;havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7731: havoc main_~node5__m5~42#1;havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6939: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~59#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8525: havoc main_~node5____CPAchecker_TMP_1~31#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4297: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~30#1;havoc main_~node5____CPAchecker_TMP_0~8#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13812: havoc main_~node5____CPAchecker_TMP_1~60#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7470: havoc main_~node5____CPAchecker_TMP_1~25#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11171: havoc main_~main____CPAchecker_TMP_0~91#1;havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~105#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4036: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~27#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9850: havoc main_~node5____CPAchecker_TMP_1~38#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5622: havoc main_~node5____CPAchecker_TMP_1~15#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10115: havoc main_~node5__m5~55#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5887: havoc main_~node4__m4~13#1; [2025-03-03 15:09:21,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10909: havoc main_~node5____CPAchecker_TMP_1~44#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9588: havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6682: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~56#1;havoc main_~node5____CPAchecker_TMP_0~21#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15403: havoc main_~node5__m5~84#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8268: havoc main_~node5__m5~45#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13555: havoc main_~node5__m5~74#1;havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3779: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~24#1;havoc main_~node5____CPAchecker_TMP_0~5#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5365: havoc main_~node5__m5~29#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6159: havoc main_~node5____CPAchecker_TMP_1~18#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13294: havoc main_~node5____CPAchecker_TMP_1~57#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10652: havoc main_~node5__m5~58#1;havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6424: havoc main_~node5__m5~35#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2197: havoc main_~node2__m2~3#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5897: havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9597: havoc main_~node5__m5~52#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8805: havoc main_~node4__m4~17#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10391: havoc main_~node5____CPAchecker_TMP_1~41#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14621: havoc main_~main____CPAchecker_TMP_0~129#1;havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~143#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5110: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~39#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14360: havoc main_~main____CPAchecker_TMP_0~126#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~140#1;havoc main_~node5____CPAchecker_TMP_0~63#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: 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:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9077: havoc main_~node5____CPAchecker_TMP_1~34#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5906: havoc main_~node5__m5~32#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4849: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~36#1;havoc main_~node5____CPAchecker_TMP_0~11#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9342: havoc main_~node5__m5~51#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8815: havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L359: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15158: havoc main_~main____CPAchecker_TMP_0~135#1;havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~149#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1154: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14103: havoc main_~main____CPAchecker_TMP_0~123#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~137#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11461: havoc main_~node5____CPAchecker_TMP_1~47#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7233: havoc main_~node5____CPAchecker_TMP_1~24#1; [2025-03-03 15:09:21,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14897: havoc main_~main____CPAchecker_TMP_0~132#1;havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~146#1;havoc main_~node5____CPAchecker_TMP_0~66#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12255: havoc main_~main____CPAchecker_TMP_0~103#1;havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~117#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4592: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~33#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2214: havoc main_~node3__m3~4#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3271: havoc main_~node5____CPAchecker_TMP_1~2#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3536: havoc main_~node5__m5~19#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4330: havoc main_~node5____CPAchecker_TMP_1~8#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11994: havoc main_~main____CPAchecker_TMP_0~100#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~114#1;havoc main_~node5____CPAchecker_TMP_0~50#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L896: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8824: havoc main_~node5__m5~48#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13053: havoc main_~main____CPAchecker_TMP_0~112#1;havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~126#1;havoc main_~node5____CPAchecker_TMP_0~56#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc main_~node4__m4~7#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11204: havoc main_~node5__m5~61#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6976: havoc main_~node5__m5~38#1;havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11735: havoc main_~node3__m3~9#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12792: havoc main_~main____CPAchecker_TMP_0~109#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~123#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6715: havoc main_~node5____CPAchecker_TMP_1~21#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4073: havoc main_~node5__m5~22#1;havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752: havoc main_~check__tmp~16#1;havoc main_~node5__m5~14#1; [2025-03-03 15:09:21,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1695: havoc main_~node3__m3~3#1; [2025-03-03 15:09:21,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L638: havoc main_~node2__m2~2#1; [2025-03-03 15:09:21,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3812: havoc main_~node5____CPAchecker_TMP_1~5#1; [2025-03-03 15:09:21,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8042: havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~71#1; [2025-03-03 15:09:21,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964: havoc main_~node4__m4~5#1; [2025-03-03 15:09:21,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:21,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12535: havoc main_~main____CPAchecker_TMP_0~106#1;havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~120#1;havoc main_~node5____CPAchecker_TMP_0~53#1; [2025-03-03 15:09:21,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15971: havoc main_~main____CPAchecker_TMP_0~144#1;havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~158#1;havoc main_~node5____CPAchecker_TMP_0~72#1; [2025-03-03 15:09:21,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2231: havoc main_~node4__m4~6#1; [2025-03-03 15:09:21,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7781: havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~68#1;havoc main_~node5____CPAchecker_TMP_0~27#1; [2025-03-03 15:09:21,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11745: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-03 15:09:21,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15710: havoc main_~main____CPAchecker_TMP_0~141#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~155#1; [2025-03-03 15:09:21,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1441: havoc main_~node4__m4~3#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8579: havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~77#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10165: havoc main_~main____CPAchecker_TMP_0~80#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~94#1;havoc main_~node5____CPAchecker_TMP_0~40#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14393: havoc main_~node5____CPAchecker_TMP_1~63#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14658: havoc main_~node4__m4~25#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13866: havoc main_~main____CPAchecker_TMP_0~121#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~135#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L389: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7524: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~65#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4882: havoc main_~node5____CPAchecker_TMP_1~11#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8318: havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~74#1;havoc main_~node5____CPAchecker_TMP_0~30#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15453: havoc main_~main____CPAchecker_TMP_0~138#1;havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~152#1;havoc main_~node5____CPAchecker_TMP_0~69#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1712: havoc main_~node4__m4~4#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9904: havoc main_~main____CPAchecker_TMP_0~77#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~91#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5676: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~45#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L656: havoc main_~node3__m3~2#1; [2025-03-03 15:09:21,722 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11755: havoc main_~node4__m4~21#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13605: havoc main_~main____CPAchecker_TMP_0~118#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~132#1;havoc main_~node5____CPAchecker_TMP_0~59#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10963: havoc main_~main____CPAchecker_TMP_0~89#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~103#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5415: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~42#1;havoc main_~node5____CPAchecker_TMP_0~14#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14136: havoc main_~node5__m5~77#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L924: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14930: havoc main_~node5____CPAchecker_TMP_1~66#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6474: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~54#1;havoc main_~node5____CPAchecker_TMP_0~20#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10702: havoc main_~main____CPAchecker_TMP_0~86#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~100#1;havoc main_~node5____CPAchecker_TMP_0~43#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15195: havoc main_~node5__m5~83#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4625: havoc main_~node5__m5~25#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14668: havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9647: havoc main_~main____CPAchecker_TMP_0~74#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~88#1;havoc main_~node5____CPAchecker_TMP_0~37#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2248: havoc main_~node5__m5~10#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L399: havoc main_~node3__m3~0#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13348: havoc main_~main____CPAchecker_TMP_0~115#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~129#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6213: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~51#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5156: havoc main_~node3__m3~6#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12027: havoc main_~node5____CPAchecker_TMP_1~50#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12292: havoc main_~node5__m5~67#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1458: havoc main_~node5__m5~4#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13086: havoc main_~node5____CPAchecker_TMP_1~56#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11765: havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10445: havoc main_~main____CPAchecker_TMP_0~83#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~97#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5956: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~48#1;havoc main_~node5____CPAchecker_TMP_0~17#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14677: havoc main_~node5__m5~80#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9392: havoc main_~main____CPAchecker_TMP_0~72#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~86#1;havoc main_~node5____CPAchecker_TMP_0~36#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1729: havoc main_~node5__m5~6#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12829: havoc main_~node5__m5~70#1;havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L409: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5166: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L674: havoc main_~node4__m4~2#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9131: havoc main_~main____CPAchecker_TMP_0~69#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~83#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11774: havoc main_~node5__m5~64#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12568: havoc main_~node5____CPAchecker_TMP_1~53#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16004: havoc main_~node5____CPAchecker_TMP_1~72#1; [2025-03-03 15:09:21,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527: havoc main_~check__tmp~15#1;havoc main_~node5__m5~12#1; [2025-03-03 15:09:21,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7814: havoc main_~node5____CPAchecker_TMP_1~27#1; [2025-03-03 15:09:21,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3586: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~22#1;havoc main_~node5____CPAchecker_TMP_0~4#1; [2025-03-03 15:09:21,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8079: havoc main_~node4__m4~16#1; [2025-03-03 15:09:21,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11515: havoc main_~main____CPAchecker_TMP_0~95#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~109#1; [2025-03-03 15:09:21,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7287: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~63#1; [2025-03-03 15:09:21,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8874: havoc main_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~80#1;havoc main_~node5____CPAchecker_TMP_0~33#1; [2025-03-03 15:09:21,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3325: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~19#1; [2025-03-03 15:09:21,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: havoc main_~node4__m4~0#1; [2025-03-03 15:09:21,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5176: havoc main_~node4__m4~12#1; [2025-03-03 15:09:21,724 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7026: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~60#1;havoc main_~node5____CPAchecker_TMP_0~23#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11254: havoc main_~main____CPAchecker_TMP_0~92#1;havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~106#1;havoc main_~node5____CPAchecker_TMP_0~46#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15747: havoc main_~node5__m5~86#1;havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4384: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~31#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10198: havoc main_~node5____CPAchecker_TMP_1~40#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7557: havoc main_~node5__m5~41#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2008: havoc main_~check__tmp~11#1;havoc main_~node5__m5~8#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8351: havoc main_~node5____CPAchecker_TMP_1~30#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15486: havoc main_~node5____CPAchecker_TMP_1~69#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4123: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~28#1;havoc main_~node5____CPAchecker_TMP_0~7#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8616: havoc main_~node5__m5~47#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13638: havoc main_~node5____CPAchecker_TMP_1~59#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8089: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6769: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~57#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5448: havoc main_~node5____CPAchecker_TMP_1~14#1; [2025-03-03 15:09:21,725 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9941: havoc main_~node5__m5~54#1;havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5713: havoc main_~node5__m5~31#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L429: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6507: havoc main_~node5____CPAchecker_TMP_1~20#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10735: havoc main_~node5____CPAchecker_TMP_1~43#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5186: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808: havoc main_~node5__m5~15#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3866: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~25#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L695: havoc main_~node5__m5~2#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9680: havoc main_~node5____CPAchecker_TMP_1~37#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13381: havoc main_~node5__m5~73#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2284: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~12#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8098: havoc main_~node5__m5~44#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6250: havoc main_~node5__m5~34#1;havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10478: havoc main_~node5__m5~57#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1494: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~6#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1230: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L438: havoc main_~node5__m5~0#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5195: havoc main_~node5__m5~28#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5989: havoc main_~node5____CPAchecker_TMP_1~17#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9425: havoc main_~node5____CPAchecker_TMP_1~36#1; [2025-03-03 15:09:21,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14447: havoc main_~main____CPAchecker_TMP_0~127#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~141#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4936: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~37#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1765: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~8#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14186: havoc main_~main____CPAchecker_TMP_0~124#1;havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~138#1;havoc main_~node5____CPAchecker_TMP_0~62#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11015: havoc main_~node4__m4~20#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15245: havoc main_~main____CPAchecker_TMP_0~136#1;havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~150#1;havoc main_~node5____CPAchecker_TMP_0~68#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4675: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~34#1;havoc main_~node5____CPAchecker_TMP_0~10#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9168: havoc main_~node5__m5~50#1;havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3619: havoc main_~node5____CPAchecker_TMP_1~4#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13927: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14984: havoc main_~main____CPAchecker_TMP_0~133#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~147#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12342: havoc main_~main____CPAchecker_TMP_0~104#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~118#1;havoc main_~node5____CPAchecker_TMP_0~52#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8907: havoc main_~node5____CPAchecker_TMP_1~33#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7059: havoc main_~node5____CPAchecker_TMP_1~23#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11287: havoc main_~node5____CPAchecker_TMP_1~46#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11552: havoc main_~node5__m5~63#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12081: havoc main_~main____CPAchecker_TMP_0~101#1;havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~115#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11025: havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3362: havoc main_~node5__m5~18#1;havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13140: havoc main_~main____CPAchecker_TMP_0~113#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~127#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4156: havoc main_~node5____CPAchecker_TMP_1~7#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14727: havoc main_~main____CPAchecker_TMP_0~130#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~144#1;havoc main_~node5____CPAchecker_TMP_0~65#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3101: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12879: havoc main_~main____CPAchecker_TMP_0~110#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~124#1;havoc main_~node5____CPAchecker_TMP_0~55#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6802: havoc main_~node5__m5~37#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13937: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11824: havoc main_~main____CPAchecker_TMP_0~98#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~112#1;havoc main_~node5____CPAchecker_TMP_0~49#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11034: havoc main_~node5__m5~60#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3899: havoc main_~node5__m5~21#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12622: havoc main_~main____CPAchecker_TMP_0~107#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~121#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16058: havoc main_~main____CPAchecker_TMP_0~145#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~159#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7868: havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~69#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2583: havoc main_~node5__m5~13#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13947: havoc main_~node4__m4~24#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15797: havoc main_~main____CPAchecker_TMP_0~142#1;havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~156#1;havoc main_~node5____CPAchecker_TMP_0~71#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7607: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~66#1;havoc main_~node5____CPAchecker_TMP_0~26#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4436: havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:21,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8666: havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~78#1;havoc main_~node5____CPAchecker_TMP_0~32#1; [2025-03-03 15:09:21,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10252: havoc main_~main____CPAchecker_TMP_0~81#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~95#1; [2025-03-03 15:09:21,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15540: havoc main_~main____CPAchecker_TMP_0~139#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~153#1; [2025-03-03 15:09:21,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7348: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:21,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8405: havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~75#1; [2025-03-03 15:09:21,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14219: havoc main_~node5____CPAchecker_TMP_1~62#1; [2025-03-03 15:09:21,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5763: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~46#1;havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-03-03 15:09:21,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9991: havoc main_~main____CPAchecker_TMP_0~78#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~92#1;havoc main_~node5____CPAchecker_TMP_0~39#1; [2025-03-03 15:09:21,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2328: havoc main_~check__tmp~13#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14484: havoc main_~node5__m5~79#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2064: havoc main_~node5__m5~9#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13692: havoc main_~main____CPAchecker_TMP_0~119#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~133#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15278: havoc main_~node5____CPAchecker_TMP_1~68#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13957: havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4708: havoc main_~node5____CPAchecker_TMP_1~10#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4973: havoc main_~node5__m5~27#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1538: havoc main_~check__tmp~7#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5502: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~43#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4446: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13431: havoc main_~main____CPAchecker_TMP_0~116#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~130#1;havoc main_~node5____CPAchecker_TMP_0~58#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10789: havoc main_~main____CPAchecker_TMP_0~87#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~101#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6561: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~55#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12375: havoc main_~node5____CPAchecker_TMP_1~52#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8148: havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~72#1;havoc main_~node5____CPAchecker_TMP_0~29#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9734: havoc main_~main____CPAchecker_TMP_0~75#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~89#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10528: havoc main_~main____CPAchecker_TMP_0~84#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~98#1;havoc main_~node5____CPAchecker_TMP_0~42#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6300: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~52#1;havoc main_~node5____CPAchecker_TMP_0~19#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: 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:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15021: havoc main_~node5__m5~82#1;havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7358: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809: havoc main_~check__tmp~9#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5245: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~40#1;havoc main_~node5____CPAchecker_TMP_0~13#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13966: havoc main_~node5__m5~76#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14760: havoc main_~node5____CPAchecker_TMP_1~65#1; [2025-03-03 15:09:21,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12118: havoc main_~node5__m5~66#1;havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-03 15:09:21,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4455: havoc main_~node5__m5~24#1; [2025-03-03 15:09:21,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12912: havoc main_~node5____CPAchecker_TMP_1~55#1; [2025-03-03 15:09:21,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~49#1; [2025-03-03 15:09:21,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11857: havoc main_~node5____CPAchecker_TMP_1~49#1; [2025-03-03 15:09:21,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9479: havoc main_~main____CPAchecker_TMP_0~73#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~87#1; [2025-03-03 15:09:21,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L496: 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;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:21,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1289: havoc main_~node5__m5~3#1; [2025-03-03 15:09:21,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7368: havoc main_~node4__m4~15#1; [2025-03-03 15:09:21,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9218: havoc main_~main____CPAchecker_TMP_0~70#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~84#1;havoc main_~node5____CPAchecker_TMP_0~35#1; [2025-03-03 15:09:22,020 INFO L? ?]: Removed 1497 outVars from TransFormulas that were not future-live. [2025-03-03 15:09:22,020 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:09:22,064 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:09:22,064 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:09:22,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:09:22 BoogieIcfgContainer [2025-03-03 15:09:22,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:09:22,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:09:22,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:09:22,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:09:22,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:09:15" (1/3) ... [2025-03-03 15:09:22,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8f081f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:09:22, skipping insertion in model container [2025-03-03 15:09:22,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:17" (2/3) ... [2025-03-03 15:09:22,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8f081f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:09:22, skipping insertion in model container [2025-03-03 15:09:22,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:09:22" (3/3) ... [2025-03-03 15:09:22,074 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-03-03 15:09:22,085 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:09:22,088 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c that has 1 procedures, 1759 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-03 15:09:22,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:09:22,186 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;@fddedc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:09:22,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-03 15:09:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 1759 states, 1752 states have (on average 1.7973744292237444) internal successors, (3149), 1758 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states 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:09:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:09:22,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:22,217 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] [2025-03-03 15:09:22,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:22,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:22,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1097697946, now seen corresponding path program 1 times [2025-03-03 15:09:22,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:22,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716351142] [2025-03-03 15:09:22,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:22,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:09:22,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:09:22,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:22,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:22,763 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:09:22,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716351142] [2025-03-03 15:09:22,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716351142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:22,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:22,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:22,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739176727] [2025-03-03 15:09:22,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:22,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:22,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:22,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:22,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:22,789 INFO L87 Difference]: Start difference. First operand has 1759 states, 1752 states have (on average 1.7973744292237444) internal successors, (3149), 1758 states have internal predecessors, (3149), 0 states have call successors, (0), 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 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:09:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:23,908 INFO L93 Difference]: Finished difference Result 2793 states and 4930 transitions. [2025-03-03 15:09:23,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:23,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-03 15:09:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:23,929 INFO L225 Difference]: With dead ends: 2793 [2025-03-03 15:09:23,931 INFO L226 Difference]: Without dead ends: 1532 [2025-03-03 15:09:23,938 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:09:23,943 INFO L435 NwaCegarLoop]: 1443 mSDtfsCounter, 7613 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7613 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:23,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7613 Valid, 1715 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:09:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2025-03-03 15:09:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1522. [2025-03-03 15:09:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1516 states have (on average 1.3674142480211082) internal successors, (2073), 1521 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states 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:09:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2073 transitions. [2025-03-03 15:09:24,039 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2073 transitions. Word has length 76 [2025-03-03 15:09:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:24,040 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 2073 transitions. [2025-03-03 15:09:24,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:09:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2073 transitions. [2025-03-03 15:09:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:09:24,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:24,047 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] [2025-03-03 15:09:24,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:09:24,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:24,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:24,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1072200326, now seen corresponding path program 1 times [2025-03-03 15:09:24,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:24,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272493865] [2025-03-03 15:09:24,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:24,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:24,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:09:24,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:09:24,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:24,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:24,237 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:09:24,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:24,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272493865] [2025-03-03 15:09:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272493865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:24,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:24,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:24,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801794337] [2025-03-03 15:09:24,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:24,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:24,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:24,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:24,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:24,240 INFO L87 Difference]: Start difference. First operand 1522 states and 2073 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:09:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:24,879 INFO L93 Difference]: Finished difference Result 2747 states and 3851 transitions. [2025-03-03 15:09:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:24,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:09:24,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:24,887 INFO L225 Difference]: With dead ends: 2747 [2025-03-03 15:09:24,887 INFO L226 Difference]: Without dead ends: 1604 [2025-03-03 15:09:24,889 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:09:24,889 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 4647 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:24,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 1000 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:09:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2025-03-03 15:09:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1594. [2025-03-03 15:09:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1588 states have (on average 1.4118387909319898) internal successors, (2242), 1593 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states 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:09:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2242 transitions. [2025-03-03 15:09:24,940 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2242 transitions. Word has length 77 [2025-03-03 15:09:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:24,940 INFO L471 AbstractCegarLoop]: Abstraction has 1594 states and 2242 transitions. [2025-03-03 15:09:24,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:09:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2242 transitions. [2025-03-03 15:09:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:09:24,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:24,944 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] [2025-03-03 15:09:24,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:09:24,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:24,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1713998302, now seen corresponding path program 1 times [2025-03-03 15:09:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:24,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866741313] [2025-03-03 15:09:24,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:24,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:24,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:09:24,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:09:24,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:24,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:25,115 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:09:25,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:25,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866741313] [2025-03-03 15:09:25,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866741313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:25,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:25,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:25,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900083524] [2025-03-03 15:09:25,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:25,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:25,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:25,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:25,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:25,117 INFO L87 Difference]: Start difference. First operand 1594 states and 2242 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:09:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:25,185 INFO L93 Difference]: Finished difference Result 2977 states and 4262 transitions. [2025-03-03 15:09:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:25,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-03 15:09:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:25,194 INFO L225 Difference]: With dead ends: 2977 [2025-03-03 15:09:25,194 INFO L226 Difference]: Without dead ends: 2265 [2025-03-03 15:09:25,198 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:09:25,200 INFO L435 NwaCegarLoop]: 1770 mSDtfsCounter, 1096 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:25,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 2717 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2025-03-03 15:09:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2253. [2025-03-03 15:09:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 2247 states have (on average 1.4054294615042278) internal successors, (3158), 2252 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states 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:09:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 3158 transitions. [2025-03-03 15:09:25,250 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 3158 transitions. Word has length 78 [2025-03-03 15:09:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:25,250 INFO L471 AbstractCegarLoop]: Abstraction has 2253 states and 3158 transitions. [2025-03-03 15:09:25,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:09:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 3158 transitions. [2025-03-03 15:09:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:09:25,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:25,254 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] [2025-03-03 15:09:25,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:09:25,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:25,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:25,255 INFO L85 PathProgramCache]: Analyzing trace with hash 248346650, now seen corresponding path program 1 times [2025-03-03 15:09:25,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:25,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407543572] [2025-03-03 15:09:25,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:25,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:09:25,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:09:25,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:25,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:25,358 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:09:25,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:25,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407543572] [2025-03-03 15:09:25,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407543572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:25,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:25,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:25,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582504408] [2025-03-03 15:09:25,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:25,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:25,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:25,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:25,360 INFO L87 Difference]: Start difference. First operand 2253 states and 3158 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:09:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:25,515 INFO L93 Difference]: Finished difference Result 4357 states and 6179 transitions. [2025-03-03 15:09:25,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:25,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-03 15:09:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:25,528 INFO L225 Difference]: With dead ends: 4357 [2025-03-03 15:09:25,528 INFO L226 Difference]: Without dead ends: 3498 [2025-03-03 15:09:25,530 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:09:25,532 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 810 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:25,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 2446 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2025-03-03 15:09:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3488. [2025-03-03 15:09:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3488 states, 3482 states have (on average 1.3925904652498564) internal successors, (4849), 3487 states have internal predecessors, (4849), 0 states have call successors, (0), 0 states 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:09:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 4849 transitions. [2025-03-03 15:09:25,625 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 4849 transitions. Word has length 78 [2025-03-03 15:09:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:25,625 INFO L471 AbstractCegarLoop]: Abstraction has 3488 states and 4849 transitions. [2025-03-03 15:09:25,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:09:25,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4849 transitions. [2025-03-03 15:09:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:09:25,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:25,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] [2025-03-03 15:09:25,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:09:25,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:25,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1846698542, now seen corresponding path program 1 times [2025-03-03 15:09:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:25,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681044698] [2025-03-03 15:09:25,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:25,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:25,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:09:25,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:09:25,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:25,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:25,751 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:09:25,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:25,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681044698] [2025-03-03 15:09:25,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681044698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:25,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:25,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:25,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055665487] [2025-03-03 15:09:25,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:25,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:25,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:25,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:25,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:25,752 INFO L87 Difference]: Start difference. First operand 3488 states and 4849 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:09:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:25,843 INFO L93 Difference]: Finished difference Result 7169 states and 10234 transitions. [2025-03-03 15:09:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:25,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-03 15:09:25,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:25,861 INFO L225 Difference]: With dead ends: 7169 [2025-03-03 15:09:25,861 INFO L226 Difference]: Without dead ends: 5224 [2025-03-03 15:09:25,865 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:09:25,866 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 720 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 2452 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:25,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 2452 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2025-03-03 15:09:25,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 5214. [2025-03-03 15:09:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5214 states, 5208 states have (on average 1.4034178187403994) internal successors, (7309), 5213 states have internal predecessors, (7309), 0 states have call successors, (0), 0 states 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:09:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5214 states to 5214 states and 7309 transitions. [2025-03-03 15:09:25,981 INFO L78 Accepts]: Start accepts. Automaton has 5214 states and 7309 transitions. Word has length 78 [2025-03-03 15:09:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:25,981 INFO L471 AbstractCegarLoop]: Abstraction has 5214 states and 7309 transitions. [2025-03-03 15:09:25,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:09:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 5214 states and 7309 transitions. [2025-03-03 15:09:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:09:25,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:25,987 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] [2025-03-03 15:09:25,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:09:25,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:25,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:25,988 INFO L85 PathProgramCache]: Analyzing trace with hash 914844315, now seen corresponding path program 1 times [2025-03-03 15:09:25,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:25,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953932941] [2025-03-03 15:09:25,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:25,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:26,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:09:26,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:09:26,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:26,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:26,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:26,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953932941] [2025-03-03 15:09:26,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953932941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:26,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:26,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:26,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001757092] [2025-03-03 15:09:26,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:26,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:26,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:26,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:26,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:26,075 INFO L87 Difference]: Start difference. First operand 5214 states and 7309 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:09:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:26,147 INFO L93 Difference]: Finished difference Result 10577 states and 14996 transitions. [2025-03-03 15:09:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:26,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-03 15:09:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:26,169 INFO L225 Difference]: With dead ends: 10577 [2025-03-03 15:09:26,169 INFO L226 Difference]: Without dead ends: 7332 [2025-03-03 15:09:26,174 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:09:26,175 INFO L435 NwaCegarLoop]: 1783 mSDtfsCounter, 1115 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:26,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 2725 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7332 states. [2025-03-03 15:09:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7332 to 7310. [2025-03-03 15:09:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7310 states, 7304 states have (on average 1.3911555312157722) internal successors, (10161), 7309 states have internal predecessors, (10161), 0 states have call successors, (0), 0 states 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:09:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 10161 transitions. [2025-03-03 15:09:26,344 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 10161 transitions. Word has length 78 [2025-03-03 15:09:26,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:26,345 INFO L471 AbstractCegarLoop]: Abstraction has 7310 states and 10161 transitions. [2025-03-03 15:09:26,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:09:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 10161 transitions. [2025-03-03 15:09:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:09:26,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:26,354 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] [2025-03-03 15:09:26,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:09:26,354 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:26,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:26,355 INFO L85 PathProgramCache]: Analyzing trace with hash -353458527, now seen corresponding path program 1 times [2025-03-03 15:09:26,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:26,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819767508] [2025-03-03 15:09:26,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:26,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:26,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:09:26,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:09:26,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:26,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:26,434 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:09:26,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:26,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819767508] [2025-03-03 15:09:26,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819767508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:26,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:26,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:26,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222651547] [2025-03-03 15:09:26,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:26,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:26,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:26,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:26,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:26,436 INFO L87 Difference]: Start difference. First operand 7310 states and 10161 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:09:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:26,506 INFO L93 Difference]: Finished difference Result 16841 states and 23880 transitions. [2025-03-03 15:09:26,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:26,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-03 15:09:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:26,533 INFO L225 Difference]: With dead ends: 16841 [2025-03-03 15:09:26,533 INFO L226 Difference]: Without dead ends: 11316 [2025-03-03 15:09:26,543 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:09:26,544 INFO L435 NwaCegarLoop]: 1392 mSDtfsCounter, 719 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:26,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 2345 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11316 states. [2025-03-03 15:09:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11316 to 11306. [2025-03-03 15:09:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11306 states, 11300 states have (on average 1.4000884955752213) internal successors, (15821), 11305 states have internal predecessors, (15821), 0 states have call successors, (0), 0 states 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:09:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11306 states to 11306 states and 15821 transitions. [2025-03-03 15:09:26,746 INFO L78 Accepts]: Start accepts. Automaton has 11306 states and 15821 transitions. Word has length 78 [2025-03-03 15:09:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:26,746 INFO L471 AbstractCegarLoop]: Abstraction has 11306 states and 15821 transitions. [2025-03-03 15:09:26,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:09:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11306 states and 15821 transitions. [2025-03-03 15:09:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:09:26,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:26,755 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] [2025-03-03 15:09:26,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:09:26,755 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:26,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:26,755 INFO L85 PathProgramCache]: Analyzing trace with hash -457307665, now seen corresponding path program 1 times [2025-03-03 15:09:26,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:26,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864393410] [2025-03-03 15:09:26,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:26,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:26,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:09:26,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:09:26,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:26,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:26,884 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:09:26,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:26,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864393410] [2025-03-03 15:09:26,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864393410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:26,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:26,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:26,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077691482] [2025-03-03 15:09:26,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:26,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:26,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:26,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:26,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:26,886 INFO L87 Difference]: Start difference. First operand 11306 states and 15821 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:09:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:27,507 INFO L93 Difference]: Finished difference Result 24747 states and 34888 transitions. [2025-03-03 15:09:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:27,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-03 15:09:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:27,532 INFO L225 Difference]: With dead ends: 24747 [2025-03-03 15:09:27,532 INFO L226 Difference]: Without dead ends: 14408 [2025-03-03 15:09:27,545 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:09:27,545 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 3989 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3989 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:27,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3989 Valid, 869 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:09:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14408 states. [2025-03-03 15:09:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14408 to 14362. [2025-03-03 15:09:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14362 states, 14356 states have (on average 1.401434940094734) internal successors, (20119), 14361 states have internal predecessors, (20119), 0 states have call successors, (0), 0 states 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:09:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14362 states to 14362 states and 20119 transitions. [2025-03-03 15:09:27,752 INFO L78 Accepts]: Start accepts. Automaton has 14362 states and 20119 transitions. Word has length 78 [2025-03-03 15:09:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:27,752 INFO L471 AbstractCegarLoop]: Abstraction has 14362 states and 20119 transitions. [2025-03-03 15:09:27,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:09:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 14362 states and 20119 transitions. [2025-03-03 15:09:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:09:27,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:27,760 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] [2025-03-03 15:09:27,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:09:27,761 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:27,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:27,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1345532295, now seen corresponding path program 1 times [2025-03-03 15:09:27,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:27,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878841429] [2025-03-03 15:09:27,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:27,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:27,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:09:27,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:09:27,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:27,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:27,937 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:09:27,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878841429] [2025-03-03 15:09:27,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878841429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:27,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:27,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:27,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429028109] [2025-03-03 15:09:27,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:27,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:27,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:27,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:27,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:27,938 INFO L87 Difference]: Start difference. First operand 14362 states and 20119 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:09:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:28,887 INFO L93 Difference]: Finished difference Result 35910 states and 50976 transitions. [2025-03-03 15:09:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:09:28,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:09:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:28,941 INFO L225 Difference]: With dead ends: 35910 [2025-03-03 15:09:28,942 INFO L226 Difference]: Without dead ends: 30138 [2025-03-03 15:09:28,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:09:28,959 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 5121 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5121 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:28,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5121 Valid, 1741 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:09:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30138 states. [2025-03-03 15:09:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30138 to 14542. [2025-03-03 15:09:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14542 states, 14536 states have (on average 1.4005916345624656) internal successors, (20359), 14541 states have internal predecessors, (20359), 0 states have call successors, (0), 0 states 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:09:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14542 states to 14542 states and 20359 transitions. [2025-03-03 15:09:29,402 INFO L78 Accepts]: Start accepts. Automaton has 14542 states and 20359 transitions. Word has length 79 [2025-03-03 15:09:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:29,402 INFO L471 AbstractCegarLoop]: Abstraction has 14542 states and 20359 transitions. [2025-03-03 15:09:29,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:09:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 14542 states and 20359 transitions. [2025-03-03 15:09:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:09:29,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:29,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:09:29,410 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:29,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1588494786, now seen corresponding path program 1 times [2025-03-03 15:09:29,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:29,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230933648] [2025-03-03 15:09:29,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:29,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:29,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:09:29,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:09:29,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:29,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:29,615 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:09:29,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:29,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230933648] [2025-03-03 15:09:29,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230933648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:29,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:29,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:29,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176045554] [2025-03-03 15:09:29,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:29,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:29,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:29,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:29,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:29,617 INFO L87 Difference]: Start difference. First operand 14542 states and 20359 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:09:30,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:30,525 INFO L93 Difference]: Finished difference Result 33564 states and 47535 transitions. [2025-03-03 15:09:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:09:30,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:09:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:30,570 INFO L225 Difference]: With dead ends: 33564 [2025-03-03 15:09:30,570 INFO L226 Difference]: Without dead ends: 28086 [2025-03-03 15:09:30,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:09:30,585 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 5076 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5076 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:30,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5076 Valid, 1716 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:09:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28086 states. [2025-03-03 15:09:30,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28086 to 14830. [2025-03-03 15:09:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14830 states, 14824 states have (on average 1.3995547760388558) internal successors, (20747), 14829 states have internal predecessors, (20747), 0 states have call successors, (0), 0 states 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:09:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14830 states to 14830 states and 20747 transitions. [2025-03-03 15:09:30,946 INFO L78 Accepts]: Start accepts. Automaton has 14830 states and 20747 transitions. Word has length 79 [2025-03-03 15:09:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:30,946 INFO L471 AbstractCegarLoop]: Abstraction has 14830 states and 20747 transitions. [2025-03-03 15:09:30,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:09:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 14830 states and 20747 transitions. [2025-03-03 15:09:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:09:30,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:30,955 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] [2025-03-03 15:09:30,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:09:30,955 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:30,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:30,956 INFO L85 PathProgramCache]: Analyzing trace with hash -301933233, now seen corresponding path program 1 times [2025-03-03 15:09:30,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:30,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685192008] [2025-03-03 15:09:30,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:30,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:30,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:09:30,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:09:30,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:30,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:31,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:31,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685192008] [2025-03-03 15:09:31,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685192008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:31,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:31,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:31,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359423650] [2025-03-03 15:09:31,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:31,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:31,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:31,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:31,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:31,106 INFO L87 Difference]: Start difference. First operand 14830 states and 20747 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:09:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:31,931 INFO L93 Difference]: Finished difference Result 31264 states and 44281 transitions. [2025-03-03 15:09:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:09:31,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:09:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:31,968 INFO L225 Difference]: With dead ends: 31264 [2025-03-03 15:09:31,968 INFO L226 Difference]: Without dead ends: 26774 [2025-03-03 15:09:31,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:09:31,981 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 5221 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5221 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:31,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5221 Valid, 1772 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:09:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26774 states. [2025-03-03 15:09:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26774 to 14890. [2025-03-03 15:09:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14890 states, 14884 states have (on average 1.3992878258532653) internal successors, (20827), 14889 states have internal predecessors, (20827), 0 states have call successors, (0), 0 states 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:09:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14890 states to 14890 states and 20827 transitions. [2025-03-03 15:09:32,268 INFO L78 Accepts]: Start accepts. Automaton has 14890 states and 20827 transitions. Word has length 79 [2025-03-03 15:09:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:32,268 INFO L471 AbstractCegarLoop]: Abstraction has 14890 states and 20827 transitions. [2025-03-03 15:09:32,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:09:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 14890 states and 20827 transitions. [2025-03-03 15:09:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:09:32,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:32,279 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] [2025-03-03 15:09:32,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:09:32,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:32,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1314059465, now seen corresponding path program 1 times [2025-03-03 15:09:32,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:32,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692553113] [2025-03-03 15:09:32,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:32,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:32,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:09:32,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:09:32,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:32,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:32,549 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:09:32,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:32,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692553113] [2025-03-03 15:09:32,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692553113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:32,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:32,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:32,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244869124] [2025-03-03 15:09:32,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:32,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:09:32,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:32,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:09:32,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:32,551 INFO L87 Difference]: Start difference. First operand 14890 states and 20827 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:09:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:32,634 INFO L93 Difference]: Finished difference Result 14890 states and 20827 transitions. [2025-03-03 15:09:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:09:32,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-03 15:09:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:32,650 INFO L225 Difference]: With dead ends: 14890 [2025-03-03 15:09:32,651 INFO L226 Difference]: Without dead ends: 14888 [2025-03-03 15:09:32,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:32,657 INFO L435 NwaCegarLoop]: 1184 mSDtfsCounter, 0 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3495 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:32,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3495 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14888 states. [2025-03-03 15:09:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14888 to 14888. [2025-03-03 15:09:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14888 states, 14883 states have (on average 1.3968957871396896) internal successors, (20790), 14887 states have internal predecessors, (20790), 0 states have call successors, (0), 0 states 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:09:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14888 states to 14888 states and 20790 transitions. [2025-03-03 15:09:32,845 INFO L78 Accepts]: Start accepts. Automaton has 14888 states and 20790 transitions. Word has length 80 [2025-03-03 15:09:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:32,845 INFO L471 AbstractCegarLoop]: Abstraction has 14888 states and 20790 transitions. [2025-03-03 15:09:32,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:09:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 14888 states and 20790 transitions. [2025-03-03 15:09:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:09:32,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:32,853 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] [2025-03-03 15:09:32,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:09:32,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:32,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:32,854 INFO L85 PathProgramCache]: Analyzing trace with hash -884792038, now seen corresponding path program 1 times [2025-03-03 15:09:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:32,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960232434] [2025-03-03 15:09:32,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:32,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:32,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:09:32,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:09:32,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:32,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:32,957 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:09:32,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:32,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960232434] [2025-03-03 15:09:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960232434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165191390] [2025-03-03 15:09:32,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:32,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:32,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:32,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:32,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:32,959 INFO L87 Difference]: Start difference. First operand 14888 states and 20790 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:09:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:33,554 INFO L93 Difference]: Finished difference Result 33340 states and 46553 transitions. [2025-03-03 15:09:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:33,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-03 15:09:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:33,580 INFO L225 Difference]: With dead ends: 33340 [2025-03-03 15:09:33,581 INFO L226 Difference]: Without dead ends: 19257 [2025-03-03 15:09:33,601 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:09:33,603 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 3641 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3641 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:33,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3641 Valid, 786 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:09:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19257 states. [2025-03-03 15:09:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19257 to 19195. [2025-03-03 15:09:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19195 states, 19190 states have (on average 1.3842626367899948) internal successors, (26564), 19194 states have internal predecessors, (26564), 0 states have call successors, (0), 0 states 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:09:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19195 states to 19195 states and 26564 transitions. [2025-03-03 15:09:33,904 INFO L78 Accepts]: Start accepts. Automaton has 19195 states and 26564 transitions. Word has length 80 [2025-03-03 15:09:33,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:33,904 INFO L471 AbstractCegarLoop]: Abstraction has 19195 states and 26564 transitions. [2025-03-03 15:09:33,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:09:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 19195 states and 26564 transitions. [2025-03-03 15:09:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:09:33,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:33,915 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] [2025-03-03 15:09:33,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:09:33,916 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:33,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1576442981, now seen corresponding path program 1 times [2025-03-03 15:09:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:33,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053847387] [2025-03-03 15:09:33,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:33,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:09:33,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:09:33,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:33,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:34,217 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:09:34,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:34,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053847387] [2025-03-03 15:09:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053847387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:34,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:34,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:34,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423944786] [2025-03-03 15:09:34,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:34,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:09:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:34,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:09:34,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:34,221 INFO L87 Difference]: Start difference. First operand 19195 states and 26564 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:09:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:34,329 INFO L93 Difference]: Finished difference Result 19195 states and 26564 transitions. [2025-03-03 15:09:34,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:09:34,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-03 15:09:34,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:34,351 INFO L225 Difference]: With dead ends: 19195 [2025-03-03 15:09:34,351 INFO L226 Difference]: Without dead ends: 19193 [2025-03-03 15:09:34,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:34,359 INFO L435 NwaCegarLoop]: 1133 mSDtfsCounter, 0 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3342 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:34,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3342 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19193 states. [2025-03-03 15:09:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19193 to 19193. [2025-03-03 15:09:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19193 states, 19189 states have (on average 1.3814685496899266) internal successors, (26509), 19192 states have internal predecessors, (26509), 0 states have call successors, (0), 0 states 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:09:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19193 states to 19193 states and 26509 transitions. [2025-03-03 15:09:34,638 INFO L78 Accepts]: Start accepts. Automaton has 19193 states and 26509 transitions. Word has length 80 [2025-03-03 15:09:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:34,638 INFO L471 AbstractCegarLoop]: Abstraction has 19193 states and 26509 transitions. [2025-03-03 15:09:34,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:09:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 19193 states and 26509 transitions. [2025-03-03 15:09:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:09:34,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:34,653 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] [2025-03-03 15:09:34,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:09:34,653 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:34,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:34,654 INFO L85 PathProgramCache]: Analyzing trace with hash 443018308, now seen corresponding path program 1 times [2025-03-03 15:09:34,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:34,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226747082] [2025-03-03 15:09:34,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:34,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:34,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:09:34,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:09:34,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:34,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:34,786 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:09:34,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:34,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226747082] [2025-03-03 15:09:34,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226747082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:34,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:34,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:34,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691957255] [2025-03-03 15:09:34,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:34,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:34,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:34,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:34,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:34,788 INFO L87 Difference]: Start difference. First operand 19193 states and 26509 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:09:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:35,370 INFO L93 Difference]: Finished difference Result 44672 states and 61916 transitions. [2025-03-03 15:09:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:35,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-03 15:09:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:35,403 INFO L225 Difference]: With dead ends: 44672 [2025-03-03 15:09:35,403 INFO L226 Difference]: Without dead ends: 26351 [2025-03-03 15:09:35,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:35,424 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 4001 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4001 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:35,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4001 Valid, 913 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:09:35,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26351 states. [2025-03-03 15:09:35,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26351 to 19193. [2025-03-03 15:09:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19193 states, 19189 states have (on average 1.3771952681223618) internal successors, (26427), 19192 states have internal predecessors, (26427), 0 states have call successors, (0), 0 states 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:09:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19193 states to 19193 states and 26427 transitions. [2025-03-03 15:09:35,663 INFO L78 Accepts]: Start accepts. Automaton has 19193 states and 26427 transitions. Word has length 80 [2025-03-03 15:09:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:35,663 INFO L471 AbstractCegarLoop]: Abstraction has 19193 states and 26427 transitions. [2025-03-03 15:09:35,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:09:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 19193 states and 26427 transitions. [2025-03-03 15:09:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:09:35,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:35,671 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] [2025-03-03 15:09:35,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:09:35,671 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:35,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash 542457078, now seen corresponding path program 1 times [2025-03-03 15:09:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:35,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752954639] [2025-03-03 15:09:35,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:35,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:35,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:09:35,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:09:35,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:35,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:35,805 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:09:35,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:35,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752954639] [2025-03-03 15:09:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752954639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:35,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:35,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645179523] [2025-03-03 15:09:35,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:35,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:35,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:35,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:35,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:35,807 INFO L87 Difference]: Start difference. First operand 19193 states and 26427 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:09:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:36,721 INFO L93 Difference]: Finished difference Result 43505 states and 60351 transitions. [2025-03-03 15:09:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:09:36,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 15:09:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:36,763 INFO L225 Difference]: With dead ends: 43505 [2025-03-03 15:09:36,763 INFO L226 Difference]: Without dead ends: 35815 [2025-03-03 15:09:36,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:09:36,779 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 4811 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4811 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:36,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4811 Valid, 1688 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:09:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35815 states. [2025-03-03 15:09:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35815 to 19700. [2025-03-03 15:09:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19700 states, 19696 states have (on average 1.3765739236393175) internal successors, (27113), 19699 states have internal predecessors, (27113), 0 states have call successors, (0), 0 states 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:09:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19700 states to 19700 states and 27113 transitions. [2025-03-03 15:09:37,153 INFO L78 Accepts]: Start accepts. Automaton has 19700 states and 27113 transitions. Word has length 81 [2025-03-03 15:09:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:37,153 INFO L471 AbstractCegarLoop]: Abstraction has 19700 states and 27113 transitions. [2025-03-03 15:09:37,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:09:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 19700 states and 27113 transitions. [2025-03-03 15:09:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:09:37,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:37,198 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] [2025-03-03 15:09:37,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:09:37,199 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:37,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:37,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1451791314, now seen corresponding path program 1 times [2025-03-03 15:09:37,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:37,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752476922] [2025-03-03 15:09:37,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:37,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:37,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:09:37,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:09:37,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:37,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:37,323 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:09:37,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:37,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752476922] [2025-03-03 15:09:37,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752476922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:37,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:37,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:37,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947238977] [2025-03-03 15:09:37,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:37,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:37,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:37,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:37,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:37,324 INFO L87 Difference]: Start difference. First operand 19700 states and 27113 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:09:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:38,064 INFO L93 Difference]: Finished difference Result 40516 states and 56054 transitions. [2025-03-03 15:09:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:09:38,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 15:09:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:38,099 INFO L225 Difference]: With dead ends: 40516 [2025-03-03 15:09:38,099 INFO L226 Difference]: Without dead ends: 31132 [2025-03-03 15:09:38,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:09:38,115 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 4609 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4609 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:38,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4609 Valid, 1607 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:09:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31132 states. [2025-03-03 15:09:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31132 to 19784. [2025-03-03 15:09:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19784 states, 19780 states have (on average 1.3761880687563195) internal successors, (27221), 19783 states have internal predecessors, (27221), 0 states have call successors, (0), 0 states 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:09:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19784 states to 19784 states and 27221 transitions. [2025-03-03 15:09:38,419 INFO L78 Accepts]: Start accepts. Automaton has 19784 states and 27221 transitions. Word has length 81 [2025-03-03 15:09:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:38,419 INFO L471 AbstractCegarLoop]: Abstraction has 19784 states and 27221 transitions. [2025-03-03 15:09:38,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:09:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 19784 states and 27221 transitions. [2025-03-03 15:09:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:09:38,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:38,427 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] [2025-03-03 15:09:38,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:09:38,427 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:38,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:38,428 INFO L85 PathProgramCache]: Analyzing trace with hash 711504029, now seen corresponding path program 1 times [2025-03-03 15:09:38,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:38,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410741103] [2025-03-03 15:09:38,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:38,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:38,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:09:38,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:09:38,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:38,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:38,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:38,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410741103] [2025-03-03 15:09:38,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410741103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:38,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:38,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:38,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872403055] [2025-03-03 15:09:38,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:38,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:09:38,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:38,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:09:38,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:38,640 INFO L87 Difference]: Start difference. First operand 19784 states and 27221 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:09:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:38,734 INFO L93 Difference]: Finished difference Result 19784 states and 27221 transitions. [2025-03-03 15:09:38,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:09:38,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-03 15:09:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:38,757 INFO L225 Difference]: With dead ends: 19784 [2025-03-03 15:09:38,757 INFO L226 Difference]: Without dead ends: 19782 [2025-03-03 15:09:38,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:38,765 INFO L435 NwaCegarLoop]: 1129 mSDtfsCounter, 0 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:38,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3330 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19782 states. [2025-03-03 15:09:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19782 to 19782. [2025-03-03 15:09:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19782 states, 19779 states have (on average 1.37347691996562) internal successors, (27166), 19781 states have internal predecessors, (27166), 0 states have call successors, (0), 0 states 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:09:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19782 states to 19782 states and 27166 transitions. [2025-03-03 15:09:39,024 INFO L78 Accepts]: Start accepts. Automaton has 19782 states and 27166 transitions. Word has length 82 [2025-03-03 15:09:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:39,024 INFO L471 AbstractCegarLoop]: Abstraction has 19782 states and 27166 transitions. [2025-03-03 15:09:39,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:09:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 19782 states and 27166 transitions. [2025-03-03 15:09:39,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:09:39,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:39,032 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] [2025-03-03 15:09:39,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:09:39,032 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:39,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash -232310110, now seen corresponding path program 1 times [2025-03-03 15:09:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708452574] [2025-03-03 15:09:39,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:39,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:09:39,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:09:39,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:39,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:39,215 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:09:39,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:39,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708452574] [2025-03-03 15:09:39,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708452574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:39,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:39,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:39,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916668702] [2025-03-03 15:09:39,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:39,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:09:39,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:39,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:09:39,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:39,217 INFO L87 Difference]: Start difference. First operand 19782 states and 27166 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:09:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:39,303 INFO L93 Difference]: Finished difference Result 19782 states and 27166 transitions. [2025-03-03 15:09:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:09:39,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-03 15:09:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:39,323 INFO L225 Difference]: With dead ends: 19782 [2025-03-03 15:09:39,323 INFO L226 Difference]: Without dead ends: 19780 [2025-03-03 15:09:39,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:39,330 INFO L435 NwaCegarLoop]: 1127 mSDtfsCounter, 0 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3324 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:39,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3324 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:39,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19780 states. [2025-03-03 15:09:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19780 to 19780. [2025-03-03 15:09:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19780 states, 19778 states have (on average 1.3707654970168874) internal successors, (27111), 19779 states have internal predecessors, (27111), 0 states have call successors, (0), 0 states 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:09:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19780 states to 19780 states and 27111 transitions. [2025-03-03 15:09:39,540 INFO L78 Accepts]: Start accepts. Automaton has 19780 states and 27111 transitions. Word has length 82 [2025-03-03 15:09:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:39,540 INFO L471 AbstractCegarLoop]: Abstraction has 19780 states and 27111 transitions. [2025-03-03 15:09:39,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:09:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 19780 states and 27111 transitions. [2025-03-03 15:09:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 15:09:39,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:39,549 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] [2025-03-03 15:09:39,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:09:39,550 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:39,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:39,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1018632176, now seen corresponding path program 1 times [2025-03-03 15:09:39,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:39,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187091807] [2025-03-03 15:09:39,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:39,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:39,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:09:39,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:09:39,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:39,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:39,721 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:09:39,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:39,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187091807] [2025-03-03 15:09:39,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187091807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:39,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:39,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:39,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400238412] [2025-03-03 15:09:39,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:39,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:09:39,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:39,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:09:39,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:39,723 INFO L87 Difference]: Start difference. First operand 19780 states and 27111 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:09:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:39,813 INFO L93 Difference]: Finished difference Result 19780 states and 27111 transitions. [2025-03-03 15:09:39,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:09:39,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-03 15:09:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:39,833 INFO L225 Difference]: With dead ends: 19780 [2025-03-03 15:09:39,833 INFO L226 Difference]: Without dead ends: 19778 [2025-03-03 15:09:39,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:39,840 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 0 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:39,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3318 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19778 states. [2025-03-03 15:09:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19778 to 19778. [2025-03-03 15:09:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19778 states, 19777 states have (on average 1.3666885776406936) internal successors, (27029), 19777 states have internal predecessors, (27029), 0 states have call successors, (0), 0 states 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:09:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19778 states to 19778 states and 27029 transitions. [2025-03-03 15:09:40,125 INFO L78 Accepts]: Start accepts. Automaton has 19778 states and 27029 transitions. Word has length 84 [2025-03-03 15:09:40,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:40,125 INFO L471 AbstractCegarLoop]: Abstraction has 19778 states and 27029 transitions. [2025-03-03 15:09:40,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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:09:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 19778 states and 27029 transitions. [2025-03-03 15:09:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:40,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:40,135 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] [2025-03-03 15:09:40,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:09:40,135 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:40,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:40,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1769961342, now seen corresponding path program 1 times [2025-03-03 15:09:40,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:40,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865288027] [2025-03-03 15:09:40,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:40,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:40,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:40,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:40,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:40,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:40,584 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:09:40,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:40,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865288027] [2025-03-03 15:09:40,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865288027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:40,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:40,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:09:40,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933609551] [2025-03-03 15:09:40,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:40,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:09:40,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:40,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:09:40,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:09:40,586 INFO L87 Difference]: Start difference. First operand 19778 states and 27029 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:09:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:41,891 INFO L93 Difference]: Finished difference Result 32357 states and 44382 transitions. [2025-03-03 15:09:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:09:41,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:41,922 INFO L225 Difference]: With dead ends: 32357 [2025-03-03 15:09:41,922 INFO L226 Difference]: Without dead ends: 28440 [2025-03-03 15:09:41,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:09:41,935 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 4583 mSDsluCounter, 2816 mSDsCounter, 0 mSdLazyCounter, 2947 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4583 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:41,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4583 Valid, 3441 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2947 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:09:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28440 states. [2025-03-03 15:09:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28440 to 19782. [2025-03-03 15:09:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19782 states, 19781 states have (on average 1.3665638744249533) internal successors, (27032), 19781 states have internal predecessors, (27032), 0 states have call successors, (0), 0 states 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:09:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19782 states to 19782 states and 27032 transitions. [2025-03-03 15:09:42,324 INFO L78 Accepts]: Start accepts. Automaton has 19782 states and 27032 transitions. Word has length 85 [2025-03-03 15:09:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:42,324 INFO L471 AbstractCegarLoop]: Abstraction has 19782 states and 27032 transitions. [2025-03-03 15:09:42,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:09:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 19782 states and 27032 transitions. [2025-03-03 15:09:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:42,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:42,338 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] [2025-03-03 15:09:42,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:09:42,338 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:42,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:42,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1572192018, now seen corresponding path program 1 times [2025-03-03 15:09:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:42,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93397228] [2025-03-03 15:09:42,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:42,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:42,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:42,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:42,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:42,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:42,560 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:09:42,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:42,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93397228] [2025-03-03 15:09:42,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93397228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:42,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:42,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:42,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397075905] [2025-03-03 15:09:42,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:42,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:42,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:42,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:42,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:42,562 INFO L87 Difference]: Start difference. First operand 19782 states and 27032 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:09:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:43,720 INFO L93 Difference]: Finished difference Result 47740 states and 66438 transitions. [2025-03-03 15:09:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:09:43,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:43,759 INFO L225 Difference]: With dead ends: 47740 [2025-03-03 15:09:43,759 INFO L226 Difference]: Without dead ends: 36548 [2025-03-03 15:09:43,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:09:43,774 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 4095 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4095 SdHoareTripleChecker+Valid, 3178 SdHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:43,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4095 Valid, 3178 Invalid, 2452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:09:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36548 states. [2025-03-03 15:09:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36548 to 19776. [2025-03-03 15:09:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19776 states, 19775 states have (on average 1.3660682680151706) internal successors, (27014), 19775 states have internal predecessors, (27014), 0 states have call successors, (0), 0 states 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:09:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19776 states to 19776 states and 27014 transitions. [2025-03-03 15:09:44,159 INFO L78 Accepts]: Start accepts. Automaton has 19776 states and 27014 transitions. Word has length 85 [2025-03-03 15:09:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:44,159 INFO L471 AbstractCegarLoop]: Abstraction has 19776 states and 27014 transitions. [2025-03-03 15:09:44,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:09:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 19776 states and 27014 transitions. [2025-03-03 15:09:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:44,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:44,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:09:44,168 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:44,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:44,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2135142705, now seen corresponding path program 1 times [2025-03-03 15:09:44,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:44,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124728459] [2025-03-03 15:09:44,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:44,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:44,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:44,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:44,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:44,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:44,279 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:09:44,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:44,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124728459] [2025-03-03 15:09:44,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124728459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:44,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:44,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:44,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116368187] [2025-03-03 15:09:44,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:44,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:44,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:44,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:44,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:44,281 INFO L87 Difference]: Start difference. First operand 19776 states and 27014 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:09:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:45,032 INFO L93 Difference]: Finished difference Result 43398 states and 59996 transitions. [2025-03-03 15:09:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:09:45,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:45,071 INFO L225 Difference]: With dead ends: 43398 [2025-03-03 15:09:45,071 INFO L226 Difference]: Without dead ends: 35926 [2025-03-03 15:09:45,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:09:45,088 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 4779 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4779 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:45,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4779 Valid, 1676 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:09:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35926 states. [2025-03-03 15:09:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35926 to 19866. [2025-03-03 15:09:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19866 states, 19865 states have (on average 1.365919959728165) internal successors, (27134), 19865 states have internal predecessors, (27134), 0 states have call successors, (0), 0 states 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:09:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19866 states to 19866 states and 27134 transitions. [2025-03-03 15:09:45,509 INFO L78 Accepts]: Start accepts. Automaton has 19866 states and 27134 transitions. Word has length 85 [2025-03-03 15:09:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:45,509 INFO L471 AbstractCegarLoop]: Abstraction has 19866 states and 27134 transitions. [2025-03-03 15:09:45,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:09:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 19866 states and 27134 transitions. [2025-03-03 15:09:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:45,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:45,520 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] [2025-03-03 15:09:45,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:09:45,520 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:45,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:45,521 INFO L85 PathProgramCache]: Analyzing trace with hash 957004204, now seen corresponding path program 1 times [2025-03-03 15:09:45,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:45,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740360664] [2025-03-03 15:09:45,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:45,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:45,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:45,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:45,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:45,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:45,780 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:09:45,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:45,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740360664] [2025-03-03 15:09:45,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740360664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:45,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:45,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:45,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445404110] [2025-03-03 15:09:45,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:45,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:45,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:45,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:45,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:45,781 INFO L87 Difference]: Start difference. First operand 19866 states and 27134 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:09:46,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:46,836 INFO L93 Difference]: Finished difference Result 48469 states and 67471 transitions. [2025-03-03 15:09:46,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:09:46,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:46,878 INFO L225 Difference]: With dead ends: 48469 [2025-03-03 15:09:46,878 INFO L226 Difference]: Without dead ends: 37221 [2025-03-03 15:09:46,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:09:46,896 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 4098 mSDsluCounter, 2413 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4098 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:46,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4098 Valid, 3111 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2189 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:09:46,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37221 states. [2025-03-03 15:09:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37221 to 19832. [2025-03-03 15:09:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19832 states, 19831 states have (on average 1.3656396550854721) internal successors, (27082), 19831 states have internal predecessors, (27082), 0 states have call successors, (0), 0 states 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:09:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19832 states to 19832 states and 27082 transitions. [2025-03-03 15:09:47,265 INFO L78 Accepts]: Start accepts. Automaton has 19832 states and 27082 transitions. Word has length 85 [2025-03-03 15:09:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:47,265 INFO L471 AbstractCegarLoop]: Abstraction has 19832 states and 27082 transitions. [2025-03-03 15:09:47,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:09:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 19832 states and 27082 transitions. [2025-03-03 15:09:47,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:47,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:47,276 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] [2025-03-03 15:09:47,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:09:47,276 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:47,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash 430766091, now seen corresponding path program 1 times [2025-03-03 15:09:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654496852] [2025-03-03 15:09:47,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:47,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:47,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:47,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:47,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:47,376 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:09:47,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:47,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654496852] [2025-03-03 15:09:47,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654496852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:47,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:47,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:47,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456298317] [2025-03-03 15:09:47,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:47,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:47,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:47,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:47,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:47,377 INFO L87 Difference]: Start difference. First operand 19832 states and 27082 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:09:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:48,094 INFO L93 Difference]: Finished difference Result 46936 states and 65169 transitions. [2025-03-03 15:09:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:09:48,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:48,130 INFO L225 Difference]: With dead ends: 46936 [2025-03-03 15:09:48,130 INFO L226 Difference]: Without dead ends: 39372 [2025-03-03 15:09:48,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:09:48,136 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 4831 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4831 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:48,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4831 Valid, 1696 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:09:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39372 states. [2025-03-03 15:09:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39372 to 19892. [2025-03-03 15:09:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19892 states, 19891 states have (on average 1.3655422050173445) internal successors, (27162), 19891 states have internal predecessors, (27162), 0 states have call successors, (0), 0 states 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:09:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19892 states to 19892 states and 27162 transitions. [2025-03-03 15:09:48,443 INFO L78 Accepts]: Start accepts. Automaton has 19892 states and 27162 transitions. Word has length 85 [2025-03-03 15:09:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:48,443 INFO L471 AbstractCegarLoop]: Abstraction has 19892 states and 27162 transitions. [2025-03-03 15:09:48,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:09:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 19892 states and 27162 transitions. [2025-03-03 15:09:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:48,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:48,453 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] [2025-03-03 15:09:48,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:09:48,453 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:48,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash 923511903, now seen corresponding path program 1 times [2025-03-03 15:09:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:48,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902447826] [2025-03-03 15:09:48,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:48,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:48,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:48,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:48,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:48,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:48,979 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:09:48,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:48,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902447826] [2025-03-03 15:09:48,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902447826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:48,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:48,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:09:48,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597715337] [2025-03-03 15:09:48,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:48,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:09:48,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:48,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:09:48,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:09:48,980 INFO L87 Difference]: Start difference. First operand 19892 states and 27162 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:50,554 INFO L93 Difference]: Finished difference Result 63583 states and 88668 transitions. [2025-03-03 15:09:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:09:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:50,610 INFO L225 Difference]: With dead ends: 63583 [2025-03-03 15:09:50,610 INFO L226 Difference]: Without dead ends: 52385 [2025-03-03 15:09:50,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:09:50,633 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 7146 mSDsluCounter, 5061 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7146 SdHoareTripleChecker+Valid, 6015 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:50,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7146 Valid, 6015 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:09:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52385 states. [2025-03-03 15:09:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52385 to 19874. [2025-03-03 15:09:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19874 states, 19873 states have (on average 1.3649675439037892) internal successors, (27126), 19873 states have internal predecessors, (27126), 0 states have call successors, (0), 0 states 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:09:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19874 states to 19874 states and 27126 transitions. [2025-03-03 15:09:51,013 INFO L78 Accepts]: Start accepts. Automaton has 19874 states and 27126 transitions. Word has length 86 [2025-03-03 15:09:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:51,013 INFO L471 AbstractCegarLoop]: Abstraction has 19874 states and 27126 transitions. [2025-03-03 15:09:51,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 19874 states and 27126 transitions. [2025-03-03 15:09:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:51,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:51,021 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] [2025-03-03 15:09:51,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:09:51,022 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:51,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:51,022 INFO L85 PathProgramCache]: Analyzing trace with hash -48479855, now seen corresponding path program 1 times [2025-03-03 15:09:51,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:51,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608689909] [2025-03-03 15:09:51,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:51,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:51,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:51,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:51,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:51,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:51,575 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:09:51,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:51,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608689909] [2025-03-03 15:09:51,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608689909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:51,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:51,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:09:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551220177] [2025-03-03 15:09:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:51,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:09:51,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:51,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:09:51,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:09:51,576 INFO L87 Difference]: Start difference. First operand 19874 states and 27126 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:52,833 INFO L93 Difference]: Finished difference Result 64809 states and 90616 transitions. [2025-03-03 15:09:52,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:09:52,834 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:52,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:52,895 INFO L225 Difference]: With dead ends: 64809 [2025-03-03 15:09:52,895 INFO L226 Difference]: Without dead ends: 52933 [2025-03-03 15:09:52,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:09:52,920 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 7198 mSDsluCounter, 6177 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7198 SdHoareTripleChecker+Valid, 7176 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:52,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7198 Valid, 7176 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:09:52,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52933 states. [2025-03-03 15:09:53,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52933 to 19158. [2025-03-03 15:09:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19158 states, 19157 states have (on average 1.3667066868507596) internal successors, (26182), 19157 states have internal predecessors, (26182), 0 states have call successors, (0), 0 states 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:09:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19158 states to 19158 states and 26182 transitions. [2025-03-03 15:09:53,405 INFO L78 Accepts]: Start accepts. Automaton has 19158 states and 26182 transitions. Word has length 86 [2025-03-03 15:09:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:53,405 INFO L471 AbstractCegarLoop]: Abstraction has 19158 states and 26182 transitions. [2025-03-03 15:09:53,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 19158 states and 26182 transitions. [2025-03-03 15:09:53,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:53,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:53,416 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] [2025-03-03 15:09:53,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:09:53,416 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:53,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:53,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2015904262, now seen corresponding path program 1 times [2025-03-03 15:09:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:53,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506930075] [2025-03-03 15:09:53,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:53,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:53,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:53,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:53,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:53,541 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:09:53,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:53,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506930075] [2025-03-03 15:09:53,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506930075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:53,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:53,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266938123] [2025-03-03 15:09:53,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:53,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:53,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:53,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:53,542 INFO L87 Difference]: Start difference. First operand 19158 states and 26182 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:54,363 INFO L93 Difference]: Finished difference Result 42756 states and 59148 transitions. [2025-03-03 15:09:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:09:54,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:54,456 INFO L225 Difference]: With dead ends: 42756 [2025-03-03 15:09:54,456 INFO L226 Difference]: Without dead ends: 35248 [2025-03-03 15:09:54,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:09:54,463 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 4608 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4608 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:54,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4608 Valid, 1634 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:09:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35248 states. [2025-03-03 15:09:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35248 to 19353. [2025-03-03 15:09:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19353 states, 19352 states have (on average 1.3666287722199255) internal successors, (26447), 19352 states have internal predecessors, (26447), 0 states have call successors, (0), 0 states 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:09:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19353 states to 19353 states and 26447 transitions. [2025-03-03 15:09:54,705 INFO L78 Accepts]: Start accepts. Automaton has 19353 states and 26447 transitions. Word has length 86 [2025-03-03 15:09:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:54,705 INFO L471 AbstractCegarLoop]: Abstraction has 19353 states and 26447 transitions. [2025-03-03 15:09:54,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 19353 states and 26447 transitions. [2025-03-03 15:09:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:54,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:54,714 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] [2025-03-03 15:09:54,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:09:54,714 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:54,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:54,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1331149856, now seen corresponding path program 1 times [2025-03-03 15:09:54,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:54,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702575521] [2025-03-03 15:09:54,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:54,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:54,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:54,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:54,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:54,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:54,908 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:09:54,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:54,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702575521] [2025-03-03 15:09:54,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702575521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:54,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:54,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:09:54,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515592206] [2025-03-03 15:09:54,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:54,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:09:54,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:54,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:09:54,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:09:54,910 INFO L87 Difference]: Start difference. First operand 19353 states and 26447 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:55,711 INFO L93 Difference]: Finished difference Result 40415 states and 56128 transitions. [2025-03-03 15:09:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:09:55,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:55,739 INFO L225 Difference]: With dead ends: 40415 [2025-03-03 15:09:55,739 INFO L226 Difference]: Without dead ends: 28775 [2025-03-03 15:09:55,752 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:09:55,753 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 4882 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4882 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:55,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4882 Valid, 2960 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:09:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28775 states. [2025-03-03 15:09:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28775 to 19111. [2025-03-03 15:09:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19111 states, 19110 states have (on average 1.3666666666666667) internal successors, (26117), 19110 states have internal predecessors, (26117), 0 states have call successors, (0), 0 states 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:09:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19111 states to 19111 states and 26117 transitions. [2025-03-03 15:09:55,974 INFO L78 Accepts]: Start accepts. Automaton has 19111 states and 26117 transitions. Word has length 86 [2025-03-03 15:09:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:55,974 INFO L471 AbstractCegarLoop]: Abstraction has 19111 states and 26117 transitions. [2025-03-03 15:09:55,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 19111 states and 26117 transitions. [2025-03-03 15:09:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:55,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:55,982 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] [2025-03-03 15:09:55,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:09:55,982 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:55,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:55,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1635397342, now seen corresponding path program 1 times [2025-03-03 15:09:55,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:55,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736096795] [2025-03-03 15:09:55,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:55,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:56,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:56,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:56,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:56,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:56,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:09:56,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736096795] [2025-03-03 15:09:56,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736096795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:56,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:56,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:09:56,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831871330] [2025-03-03 15:09:56,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:56,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:09:56,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:56,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:09:56,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:09:56,366 INFO L87 Difference]: Start difference. First operand 19111 states and 26117 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:57,250 INFO L93 Difference]: Finished difference Result 69470 states and 97200 transitions. [2025-03-03 15:09:57,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:09:57,250 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:57,319 INFO L225 Difference]: With dead ends: 69470 [2025-03-03 15:09:57,319 INFO L226 Difference]: Without dead ends: 57616 [2025-03-03 15:09:57,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:09:57,345 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 6533 mSDsluCounter, 6350 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6533 SdHoareTripleChecker+Valid, 7289 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:57,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6533 Valid, 7289 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:09:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57616 states. [2025-03-03 15:09:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57616 to 18425. [2025-03-03 15:09:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18425 states, 18424 states have (on average 1.3684867564046896) internal successors, (25213), 18424 states have internal predecessors, (25213), 0 states have call successors, (0), 0 states 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:09:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18425 states to 18425 states and 25213 transitions. [2025-03-03 15:09:57,727 INFO L78 Accepts]: Start accepts. Automaton has 18425 states and 25213 transitions. Word has length 86 [2025-03-03 15:09:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:57,727 INFO L471 AbstractCegarLoop]: Abstraction has 18425 states and 25213 transitions. [2025-03-03 15:09:57,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:09:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18425 states and 25213 transitions. [2025-03-03 15:09:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:09:57,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:57,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:57,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:09:57,736 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:57,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1240047650, now seen corresponding path program 1 times [2025-03-03 15:09:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:57,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564586139] [2025-03-03 15:09:57,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:57,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:09:57,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:09:57,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:57,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:57,829 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:09:57,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:57,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564586139] [2025-03-03 15:09:57,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564586139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:57,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:57,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:57,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811402815] [2025-03-03 15:09:57,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:57,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:57,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:57,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:57,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:57,830 INFO L87 Difference]: Start difference. First operand 18425 states and 25213 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:09:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:58,462 INFO L93 Difference]: Finished difference Result 49443 states and 68974 transitions. [2025-03-03 15:09:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:09:58,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-03 15:09:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:58,503 INFO L225 Difference]: With dead ends: 49443 [2025-03-03 15:09:58,504 INFO L226 Difference]: Without dead ends: 41619 [2025-03-03 15:09:58,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:09:58,521 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 4402 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4402 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:58,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4402 Valid, 1573 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:09:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41619 states. [2025-03-03 15:09:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41619 to 18500. [2025-03-03 15:09:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18500 states, 18499 states have (on average 1.368344234823504) internal successors, (25313), 18499 states have internal predecessors, (25313), 0 states have call successors, (0), 0 states 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:09:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18500 states to 18500 states and 25313 transitions. [2025-03-03 15:09:58,831 INFO L78 Accepts]: Start accepts. Automaton has 18500 states and 25313 transitions. Word has length 87 [2025-03-03 15:09:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:58,831 INFO L471 AbstractCegarLoop]: Abstraction has 18500 states and 25313 transitions. [2025-03-03 15:09:58,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:09:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 18500 states and 25313 transitions. [2025-03-03 15:09:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:09:58,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:58,839 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] [2025-03-03 15:09:58,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:09:58,839 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:09:58,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash -44712985, now seen corresponding path program 1 times [2025-03-03 15:09:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:58,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861695803] [2025-03-03 15:09:58,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:58,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:58,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:09:58,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:09:58,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:58,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:59,050 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:09:59,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:59,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861695803] [2025-03-03 15:09:59,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861695803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:59,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:59,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:09:59,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644750321] [2025-03-03 15:09:59,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:59,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:09:59,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:59,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:09:59,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:09:59,052 INFO L87 Difference]: Start difference. First operand 18500 states and 25313 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:09:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:59,893 INFO L93 Difference]: Finished difference Result 44975 states and 62533 transitions. [2025-03-03 15:09:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:09:59,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-03 15:09:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:59,923 INFO L225 Difference]: With dead ends: 44975 [2025-03-03 15:09:59,924 INFO L226 Difference]: Without dead ends: 32741 [2025-03-03 15:09:59,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:09:59,938 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 4896 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4896 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:59,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4896 Valid, 2988 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:09:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32741 states. [2025-03-03 15:10:00,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32741 to 17958. [2025-03-03 15:10:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17958 states, 17957 states have (on average 1.3686027732917525) internal successors, (24576), 17957 states have internal predecessors, (24576), 0 states have call successors, (0), 0 states 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:10:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17958 states to 17958 states and 24576 transitions. [2025-03-03 15:10:00,166 INFO L78 Accepts]: Start accepts. Automaton has 17958 states and 24576 transitions. Word has length 87 [2025-03-03 15:10:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:00,166 INFO L471 AbstractCegarLoop]: Abstraction has 17958 states and 24576 transitions. [2025-03-03 15:10:00,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:10:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 17958 states and 24576 transitions. [2025-03-03 15:10:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:10:00,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:00,174 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] [2025-03-03 15:10:00,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:10:00,174 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:00,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:00,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1267857197, now seen corresponding path program 1 times [2025-03-03 15:10:00,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:00,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314366775] [2025-03-03 15:10:00,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:00,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:00,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:10:00,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:10:00,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:00,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:00,371 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:10:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314366775] [2025-03-03 15:10:00,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314366775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:00,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:00,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:10:00,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499557982] [2025-03-03 15:10:00,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:00,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:10:00,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:00,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:10:00,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:10:00,374 INFO L87 Difference]: Start difference. First operand 17958 states and 24576 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:10:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:01,181 INFO L93 Difference]: Finished difference Result 38843 states and 54040 transitions. [2025-03-03 15:10:01,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:10:01,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-03 15:10:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:01,211 INFO L225 Difference]: With dead ends: 38843 [2025-03-03 15:10:01,211 INFO L226 Difference]: Without dead ends: 27491 [2025-03-03 15:10:01,226 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:10:01,226 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 4444 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4444 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 2046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:01,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4444 Valid, 3004 Invalid, 2046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:10:01,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27491 states. [2025-03-03 15:10:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27491 to 17872. [2025-03-03 15:10:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17872 states, 17871 states have (on average 1.3682502378154553) internal successors, (24452), 17871 states have internal predecessors, (24452), 0 states have call successors, (0), 0 states 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:10:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17872 states to 17872 states and 24452 transitions. [2025-03-03 15:10:01,468 INFO L78 Accepts]: Start accepts. Automaton has 17872 states and 24452 transitions. Word has length 87 [2025-03-03 15:10:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:01,468 INFO L471 AbstractCegarLoop]: Abstraction has 17872 states and 24452 transitions. [2025-03-03 15:10:01,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:10:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 17872 states and 24452 transitions. [2025-03-03 15:10:01,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:10:01,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:01,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:01,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:10:01,477 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:01,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:01,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1268423649, now seen corresponding path program 1 times [2025-03-03 15:10:01,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:01,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959590422] [2025-03-03 15:10:01,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:01,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:01,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:10:01,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:10:01,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:01,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:01,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:01,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959590422] [2025-03-03 15:10:01,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959590422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:01,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:01,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:10:01,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775400872] [2025-03-03 15:10:01,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:01,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:10:01,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:01,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:10:01,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:10:01,881 INFO L87 Difference]: Start difference. First operand 17872 states and 24452 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:10:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:02,896 INFO L93 Difference]: Finished difference Result 30908 states and 42791 transitions. [2025-03-03 15:10:02,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 15:10:02,896 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-03 15:10:02,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:02,923 INFO L225 Difference]: With dead ends: 30908 [2025-03-03 15:10:02,924 INFO L226 Difference]: Without dead ends: 25905 [2025-03-03 15:10:02,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:10:02,935 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 3764 mSDsluCounter, 4208 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3764 SdHoareTripleChecker+Valid, 5009 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:02,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3764 Valid, 5009 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:10:02,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25905 states. [2025-03-03 15:10:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25905 to 17879. [2025-03-03 15:10:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17879 states, 17878 states have (on average 1.368273856136033) internal successors, (24462), 17878 states have internal predecessors, (24462), 0 states have call successors, (0), 0 states 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:10:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17879 states to 17879 states and 24462 transitions. [2025-03-03 15:10:03,152 INFO L78 Accepts]: Start accepts. Automaton has 17879 states and 24462 transitions. Word has length 88 [2025-03-03 15:10:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:03,152 INFO L471 AbstractCegarLoop]: Abstraction has 17879 states and 24462 transitions. [2025-03-03 15:10:03,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:10:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 17879 states and 24462 transitions. [2025-03-03 15:10:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:10:03,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:03,161 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] [2025-03-03 15:10:03,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:10:03,161 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:03,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:03,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1651832800, now seen corresponding path program 1 times [2025-03-03 15:10:03,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:03,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689114460] [2025-03-03 15:10:03,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:03,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:03,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:10:03,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:10:03,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:03,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:03,619 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:10:03,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:03,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689114460] [2025-03-03 15:10:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689114460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:03,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:03,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:10:03,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109189224] [2025-03-03 15:10:03,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:03,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:10:03,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:03,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:10:03,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:10:03,621 INFO L87 Difference]: Start difference. First operand 17879 states and 24462 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:10:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:04,398 INFO L93 Difference]: Finished difference Result 68204 states and 95482 transitions. [2025-03-03 15:10:04,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:10:04,398 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-03 15:10:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:04,462 INFO L225 Difference]: With dead ends: 68204 [2025-03-03 15:10:04,462 INFO L226 Difference]: Without dead ends: 56753 [2025-03-03 15:10:04,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:10:04,485 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 6014 mSDsluCounter, 5999 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6014 SdHoareTripleChecker+Valid, 6963 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:04,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6014 Valid, 6963 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:10:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56753 states. [2025-03-03 15:10:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56753 to 17608. [2025-03-03 15:10:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17608 states, 17607 states have (on average 1.367865053671835) internal successors, (24084), 17607 states have internal predecessors, (24084), 0 states have call successors, (0), 0 states 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:10:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17608 states to 17608 states and 24084 transitions. [2025-03-03 15:10:04,878 INFO L78 Accepts]: Start accepts. Automaton has 17608 states and 24084 transitions. Word has length 88 [2025-03-03 15:10:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:04,878 INFO L471 AbstractCegarLoop]: Abstraction has 17608 states and 24084 transitions. [2025-03-03 15:10:04,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:10:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 17608 states and 24084 transitions. [2025-03-03 15:10:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:10:04,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:04,887 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] [2025-03-03 15:10:04,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:10:04,887 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:04,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1987655710, now seen corresponding path program 1 times [2025-03-03 15:10:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:04,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880389217] [2025-03-03 15:10:04,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:04,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:10:04,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:10:04,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:04,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:05,139 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:10:05,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:05,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880389217] [2025-03-03 15:10:05,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880389217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:05,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:05,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:10:05,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059085169] [2025-03-03 15:10:05,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:05,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:10:05,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:05,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:10:05,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:10:05,140 INFO L87 Difference]: Start difference. First operand 17608 states and 24084 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:10:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:05,911 INFO L93 Difference]: Finished difference Result 38398 states and 53385 transitions. [2025-03-03 15:10:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:10:05,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 15:10:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:05,941 INFO L225 Difference]: With dead ends: 38398 [2025-03-03 15:10:05,941 INFO L226 Difference]: Without dead ends: 26894 [2025-03-03 15:10:05,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:10:05,955 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 4208 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4208 SdHoareTripleChecker+Valid, 2504 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:05,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4208 Valid, 2504 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:10:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26894 states. [2025-03-03 15:10:06,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26894 to 17735. [2025-03-03 15:10:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17735 states, 17734 states have (on average 1.3663584075786626) internal successors, (24231), 17734 states have internal predecessors, (24231), 0 states have call successors, (0), 0 states 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:10:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17735 states to 17735 states and 24231 transitions. [2025-03-03 15:10:06,176 INFO L78 Accepts]: Start accepts. Automaton has 17735 states and 24231 transitions. Word has length 89 [2025-03-03 15:10:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:06,177 INFO L471 AbstractCegarLoop]: Abstraction has 17735 states and 24231 transitions. [2025-03-03 15:10:06,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:10:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 17735 states and 24231 transitions. [2025-03-03 15:10:06,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:10:06,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:06,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:06,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:10:06,185 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:06,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:06,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1559400417, now seen corresponding path program 1 times [2025-03-03 15:10:06,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:06,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424390280] [2025-03-03 15:10:06,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:06,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:06,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:10:06,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:10:06,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:06,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:06,350 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:10:06,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424390280] [2025-03-03 15:10:06,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424390280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:06,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:06,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:10:06,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591280743] [2025-03-03 15:10:06,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:06,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:10:06,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:06,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:10:06,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:10:06,351 INFO L87 Difference]: Start difference. First operand 17735 states and 24231 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:10:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:07,093 INFO L93 Difference]: Finished difference Result 45069 states and 62897 transitions. [2025-03-03 15:10:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:10:07,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 15:10:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:07,128 INFO L225 Difference]: With dead ends: 45069 [2025-03-03 15:10:07,128 INFO L226 Difference]: Without dead ends: 33865 [2025-03-03 15:10:07,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:10:07,144 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 4173 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4173 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:07,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4173 Valid, 2483 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:10:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33865 states. [2025-03-03 15:10:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33865 to 17723. [2025-03-03 15:10:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17723 states, 17722 states have (on average 1.3659293533461234) internal successors, (24207), 17722 states have internal predecessors, (24207), 0 states have call successors, (0), 0 states 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:10:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17723 states to 17723 states and 24207 transitions. [2025-03-03 15:10:07,432 INFO L78 Accepts]: Start accepts. Automaton has 17723 states and 24207 transitions. Word has length 89 [2025-03-03 15:10:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:07,433 INFO L471 AbstractCegarLoop]: Abstraction has 17723 states and 24207 transitions. [2025-03-03 15:10:07,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:10:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 17723 states and 24207 transitions. [2025-03-03 15:10:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:10:07,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:07,443 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] [2025-03-03 15:10:07,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:10:07,443 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:07,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1562296096, now seen corresponding path program 1 times [2025-03-03 15:10:07,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:07,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596352563] [2025-03-03 15:10:07,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:07,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:10:07,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:10:07,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:07,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:07,500 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:10:07,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:07,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596352563] [2025-03-03 15:10:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596352563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:07,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:07,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:07,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210634842] [2025-03-03 15:10:07,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:07,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:07,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:07,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:07,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:07,501 INFO L87 Difference]: Start difference. First operand 17723 states and 24207 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:10:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:07,574 INFO L93 Difference]: Finished difference Result 26647 states and 36672 transitions. [2025-03-03 15:10:07,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:07,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 15:10:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:07,593 INFO L225 Difference]: With dead ends: 26647 [2025-03-03 15:10:07,593 INFO L226 Difference]: Without dead ends: 17725 [2025-03-03 15:10:07,603 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:10:07,604 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 556 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:07,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 2105 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17725 states. [2025-03-03 15:10:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17725 to 17723. [2025-03-03 15:10:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17723 states, 17722 states have (on average 1.3569574540119624) internal successors, (24048), 17722 states have internal predecessors, (24048), 0 states have call successors, (0), 0 states 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:10:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17723 states to 17723 states and 24048 transitions. [2025-03-03 15:10:07,814 INFO L78 Accepts]: Start accepts. Automaton has 17723 states and 24048 transitions. Word has length 89 [2025-03-03 15:10:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:07,814 INFO L471 AbstractCegarLoop]: Abstraction has 17723 states and 24048 transitions. [2025-03-03 15:10:07,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:10:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 17723 states and 24048 transitions. [2025-03-03 15:10:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:10:07,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:07,823 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] [2025-03-03 15:10:07,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:10:07,823 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:07,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1252636625, now seen corresponding path program 1 times [2025-03-03 15:10:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:07,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280490865] [2025-03-03 15:10:07,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:07,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:07,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:10:07,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:10:07,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:07,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:07,872 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:10:07,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:07,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280490865] [2025-03-03 15:10:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280490865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383494352] [2025-03-03 15:10:07,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:07,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:07,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:07,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:07,874 INFO L87 Difference]: Start difference. First operand 17723 states and 24048 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:10:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:07,947 INFO L93 Difference]: Finished difference Result 25771 states and 35284 transitions. [2025-03-03 15:10:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 15:10:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:07,966 INFO L225 Difference]: With dead ends: 25771 [2025-03-03 15:10:07,966 INFO L226 Difference]: Without dead ends: 17725 [2025-03-03 15:10:07,975 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:10:07,975 INFO L435 NwaCegarLoop]: 1146 mSDtfsCounter, 433 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:07,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1831 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17725 states. [2025-03-03 15:10:08,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17725 to 17723. [2025-03-03 15:10:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17723 states, 17722 states have (on average 1.3465748786818643) internal successors, (23864), 17722 states have internal predecessors, (23864), 0 states have call successors, (0), 0 states 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:10:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17723 states to 17723 states and 23864 transitions. [2025-03-03 15:10:08,157 INFO L78 Accepts]: Start accepts. Automaton has 17723 states and 23864 transitions. Word has length 90 [2025-03-03 15:10:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:08,157 INFO L471 AbstractCegarLoop]: Abstraction has 17723 states and 23864 transitions. [2025-03-03 15:10:08,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:10:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 17723 states and 23864 transitions. [2025-03-03 15:10:08,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:10:08,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:08,166 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] [2025-03-03 15:10:08,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:10:08,166 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:08,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash 67819224, now seen corresponding path program 1 times [2025-03-03 15:10:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:08,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157098024] [2025-03-03 15:10:08,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:08,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:08,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:10:08,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:10:08,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:08,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:08,215 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:10:08,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:08,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157098024] [2025-03-03 15:10:08,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157098024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:08,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:08,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:08,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539353692] [2025-03-03 15:10:08,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:08,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:08,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:08,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:08,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:08,216 INFO L87 Difference]: Start difference. First operand 17723 states and 23864 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:10:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:08,315 INFO L93 Difference]: Finished difference Result 25505 states and 34632 transitions. [2025-03-03 15:10:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:08,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 15:10:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:08,333 INFO L225 Difference]: With dead ends: 25505 [2025-03-03 15:10:08,333 INFO L226 Difference]: Without dead ends: 17725 [2025-03-03 15:10:08,342 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:10:08,342 INFO L435 NwaCegarLoop]: 1099 mSDtfsCounter, 437 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:08,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1852 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:08,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17725 states. [2025-03-03 15:10:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17725 to 17723. [2025-03-03 15:10:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17723 states, 17722 states have (on average 1.332129556483467) internal successors, (23608), 17722 states have internal predecessors, (23608), 0 states have call successors, (0), 0 states 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:10:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17723 states to 17723 states and 23608 transitions. [2025-03-03 15:10:08,516 INFO L78 Accepts]: Start accepts. Automaton has 17723 states and 23608 transitions. Word has length 90 [2025-03-03 15:10:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:08,516 INFO L471 AbstractCegarLoop]: Abstraction has 17723 states and 23608 transitions. [2025-03-03 15:10:08,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:10:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17723 states and 23608 transitions. [2025-03-03 15:10:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:10:08,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:08,525 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] [2025-03-03 15:10:08,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:10:08,525 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:08,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:08,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1201732064, now seen corresponding path program 1 times [2025-03-03 15:10:08,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:08,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241448579] [2025-03-03 15:10:08,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:08,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:08,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:10:08,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:10:08,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:08,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:08,572 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:10:08,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:08,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241448579] [2025-03-03 15:10:08,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241448579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:08,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:08,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:08,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165925900] [2025-03-03 15:10:08,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:08,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:08,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:08,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:08,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:08,573 INFO L87 Difference]: Start difference. First operand 17723 states and 23608 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:10:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:08,670 INFO L93 Difference]: Finished difference Result 30739 states and 41377 transitions. [2025-03-03 15:10:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:08,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 15:10:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:08,691 INFO L225 Difference]: With dead ends: 30739 [2025-03-03 15:10:08,691 INFO L226 Difference]: Without dead ends: 20832 [2025-03-03 15:10:08,702 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:10:08,702 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 691 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:08,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 914 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20832 states. [2025-03-03 15:10:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20832 to 16298. [2025-03-03 15:10:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16298 states, 16297 states have (on average 1.3353991532183838) internal successors, (21763), 16297 states have internal predecessors, (21763), 0 states have call successors, (0), 0 states 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:10:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16298 states to 16298 states and 21763 transitions. [2025-03-03 15:10:08,873 INFO L78 Accepts]: Start accepts. Automaton has 16298 states and 21763 transitions. Word has length 90 [2025-03-03 15:10:08,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:08,874 INFO L471 AbstractCegarLoop]: Abstraction has 16298 states and 21763 transitions. [2025-03-03 15:10:08,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:10:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 16298 states and 21763 transitions. [2025-03-03 15:10:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:10:08,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:08,881 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] [2025-03-03 15:10:08,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:10:08,881 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:08,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:08,882 INFO L85 PathProgramCache]: Analyzing trace with hash 617701392, now seen corresponding path program 1 times [2025-03-03 15:10:08,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:08,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038504583] [2025-03-03 15:10:08,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:08,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:08,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:10:08,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:10:08,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:08,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:08,923 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:10:08,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:08,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038504583] [2025-03-03 15:10:08,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038504583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:08,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:08,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:08,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089300610] [2025-03-03 15:10:08,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:08,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:08,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:08,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:08,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:08,924 INFO L87 Difference]: Start difference. First operand 16298 states and 21763 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:10:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:09,043 INFO L93 Difference]: Finished difference Result 28887 states and 38974 transitions. [2025-03-03 15:10:09,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:09,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 15:10:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:09,061 INFO L225 Difference]: With dead ends: 28887 [2025-03-03 15:10:09,061 INFO L226 Difference]: Without dead ends: 19224 [2025-03-03 15:10:09,070 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:10:09,070 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 617 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:09,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 791 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:10:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19224 states. [2025-03-03 15:10:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19224 to 15210. [2025-03-03 15:10:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15210 states, 15209 states have (on average 1.3405878098494313) internal successors, (20389), 15209 states have internal predecessors, (20389), 0 states have call successors, (0), 0 states 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:10:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15210 states to 15210 states and 20389 transitions. [2025-03-03 15:10:09,213 INFO L78 Accepts]: Start accepts. Automaton has 15210 states and 20389 transitions. Word has length 90 [2025-03-03 15:10:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:09,213 INFO L471 AbstractCegarLoop]: Abstraction has 15210 states and 20389 transitions. [2025-03-03 15:10:09,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:10:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 15210 states and 20389 transitions. [2025-03-03 15:10:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:10:09,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:09,220 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] [2025-03-03 15:10:09,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:10:09,220 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:09,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:09,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1753503849, now seen corresponding path program 1 times [2025-03-03 15:10:09,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:09,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33126520] [2025-03-03 15:10:09,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:09,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:10:09,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:10:09,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:09,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:09,258 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:10:09,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33126520] [2025-03-03 15:10:09,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33126520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:09,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:09,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:09,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829849298] [2025-03-03 15:10:09,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:09,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:09,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:09,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:09,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:09,259 INFO L87 Difference]: Start difference. First operand 15210 states and 20389 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:10:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:09,377 INFO L93 Difference]: Finished difference Result 28802 states and 38768 transitions. [2025-03-03 15:10:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:09,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 15:10:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:09,393 INFO L225 Difference]: With dead ends: 28802 [2025-03-03 15:10:09,393 INFO L226 Difference]: Without dead ends: 19326 [2025-03-03 15:10:09,399 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:10:09,400 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 627 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:09,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 1028 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19326 states. [2025-03-03 15:10:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19326 to 14533. [2025-03-03 15:10:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14533 states, 14532 states have (on average 1.3402146985962016) internal successors, (19476), 14532 states have internal predecessors, (19476), 0 states have call successors, (0), 0 states 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:10:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14533 states to 14533 states and 19476 transitions. [2025-03-03 15:10:09,531 INFO L78 Accepts]: Start accepts. Automaton has 14533 states and 19476 transitions. Word has length 90 [2025-03-03 15:10:09,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:09,531 INFO L471 AbstractCegarLoop]: Abstraction has 14533 states and 19476 transitions. [2025-03-03 15:10:09,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:10:09,531 INFO L276 IsEmpty]: Start isEmpty. Operand 14533 states and 19476 transitions. [2025-03-03 15:10:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:10:09,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:09,537 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] [2025-03-03 15:10:09,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:10:09,537 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:09,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1180399328, now seen corresponding path program 1 times [2025-03-03 15:10:09,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:09,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954725989] [2025-03-03 15:10:09,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:09,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:09,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:10:09,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:10:09,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:09,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:09,720 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:10:09,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:09,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954725989] [2025-03-03 15:10:09,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954725989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:09,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:09,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:10:09,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494466703] [2025-03-03 15:10:09,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:09,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:10:09,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:09,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:10:09,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:10:09,721 INFO L87 Difference]: Start difference. First operand 14533 states and 19476 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:10:10,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:10,279 INFO L93 Difference]: Finished difference Result 23668 states and 32001 transitions. [2025-03-03 15:10:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:10:10,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-03 15:10:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:10,299 INFO L225 Difference]: With dead ends: 23668 [2025-03-03 15:10:10,299 INFO L226 Difference]: Without dead ends: 22394 [2025-03-03 15:10:10,305 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:10:10,306 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 3081 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3081 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:10,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3081 Valid, 2010 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:10:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22394 states. [2025-03-03 15:10:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22394 to 14524. [2025-03-03 15:10:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14524 states, 14523 states have (on average 1.3400812504303519) internal successors, (19462), 14523 states have internal predecessors, (19462), 0 states have call successors, (0), 0 states 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:10:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14524 states to 14524 states and 19462 transitions. [2025-03-03 15:10:10,463 INFO L78 Accepts]: Start accepts. Automaton has 14524 states and 19462 transitions. Word has length 91 [2025-03-03 15:10:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:10,463 INFO L471 AbstractCegarLoop]: Abstraction has 14524 states and 19462 transitions. [2025-03-03 15:10:10,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:10:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 14524 states and 19462 transitions. [2025-03-03 15:10:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:10:10,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:10,471 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] [2025-03-03 15:10:10,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 15:10:10,471 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:10,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1534638939, now seen corresponding path program 1 times [2025-03-03 15:10:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:10,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532479866] [2025-03-03 15:10:10,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:10,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:10,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:10:10,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:10:10,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:10,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:10,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:10:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532479866] [2025-03-03 15:10:10,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532479866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:10,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:10,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:10:10,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817322544] [2025-03-03 15:10:10,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:10,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:10:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:10,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:10:10,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:10:10,641 INFO L87 Difference]: Start difference. First operand 14524 states and 19462 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:10:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:11,159 INFO L93 Difference]: Finished difference Result 20763 states and 27857 transitions. [2025-03-03 15:10:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:10:11,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-03 15:10:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:11,175 INFO L225 Difference]: With dead ends: 20763 [2025-03-03 15:10:11,175 INFO L226 Difference]: Without dead ends: 19406 [2025-03-03 15:10:11,180 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:10:11,181 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 2515 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:11,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2515 Valid, 1939 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:10:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19406 states. [2025-03-03 15:10:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19406 to 14465. [2025-03-03 15:10:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14465 states, 14464 states have (on average 1.3402931415929205) internal successors, (19386), 14464 states have internal predecessors, (19386), 0 states have call successors, (0), 0 states 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:10:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14465 states to 14465 states and 19386 transitions. [2025-03-03 15:10:11,309 INFO L78 Accepts]: Start accepts. Automaton has 14465 states and 19386 transitions. Word has length 91 [2025-03-03 15:10:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:11,309 INFO L471 AbstractCegarLoop]: Abstraction has 14465 states and 19386 transitions. [2025-03-03 15:10:11,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:10:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 14465 states and 19386 transitions. [2025-03-03 15:10:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:10:11,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:11,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:11,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 15:10:11,316 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:11,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:11,316 INFO L85 PathProgramCache]: Analyzing trace with hash 622871736, now seen corresponding path program 1 times [2025-03-03 15:10:11,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:11,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766580123] [2025-03-03 15:10:11,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:11,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:10:11,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:10:11,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:11,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:11,719 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:10:11,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:11,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766580123] [2025-03-03 15:10:11,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766580123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:11,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:11,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:10:11,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103410927] [2025-03-03 15:10:11,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:11,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:10:11,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:11,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:10:11,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:10:11,720 INFO L87 Difference]: Start difference. First operand 14465 states and 19386 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:12,333 INFO L93 Difference]: Finished difference Result 22553 states and 30535 transitions. [2025-03-03 15:10:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:10:12,334 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 15:10:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:12,356 INFO L225 Difference]: With dead ends: 22553 [2025-03-03 15:10:12,356 INFO L226 Difference]: Without dead ends: 21631 [2025-03-03 15:10:12,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:10:12,364 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 3182 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3182 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:12,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3182 Valid, 3182 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:10:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21631 states. [2025-03-03 15:10:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21631 to 14367. [2025-03-03 15:10:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14367 states, 14366 states have (on average 1.3408046777112628) internal successors, (19262), 14366 states have internal predecessors, (19262), 0 states have call successors, (0), 0 states 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:10:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14367 states to 14367 states and 19262 transitions. [2025-03-03 15:10:12,588 INFO L78 Accepts]: Start accepts. Automaton has 14367 states and 19262 transitions. Word has length 92 [2025-03-03 15:10:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:12,588 INFO L471 AbstractCegarLoop]: Abstraction has 14367 states and 19262 transitions. [2025-03-03 15:10:12,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 14367 states and 19262 transitions. [2025-03-03 15:10:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:10:12,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:12,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:12,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 15:10:12,598 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:12,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash 829693954, now seen corresponding path program 1 times [2025-03-03 15:10:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940863248] [2025-03-03 15:10:12,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:12,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:10:12,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:10:12,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:12,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:13,079 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:10:13,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940863248] [2025-03-03 15:10:13,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940863248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:13,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:13,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:10:13,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522709131] [2025-03-03 15:10:13,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:13,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:10:13,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:13,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:10:13,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:10:13,081 INFO L87 Difference]: Start difference. First operand 14367 states and 19262 transitions. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:13,861 INFO L93 Difference]: Finished difference Result 41878 states and 57108 transitions. [2025-03-03 15:10:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:10:13,861 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 15:10:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:13,904 INFO L225 Difference]: With dead ends: 41878 [2025-03-03 15:10:13,904 INFO L226 Difference]: Without dead ends: 40588 [2025-03-03 15:10:13,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:10:13,920 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 3776 mSDsluCounter, 4948 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3776 SdHoareTripleChecker+Valid, 5666 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:13,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3776 Valid, 5666 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:10:13,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40588 states. [2025-03-03 15:10:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40588 to 14333. [2025-03-03 15:10:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14333 states, 14332 states have (on average 1.3407061121964834) internal successors, (19215), 14332 states have internal predecessors, (19215), 0 states have call successors, (0), 0 states 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:10:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14333 states to 14333 states and 19215 transitions. [2025-03-03 15:10:14,172 INFO L78 Accepts]: Start accepts. Automaton has 14333 states and 19215 transitions. Word has length 92 [2025-03-03 15:10:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:14,172 INFO L471 AbstractCegarLoop]: Abstraction has 14333 states and 19215 transitions. [2025-03-03 15:10:14,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 14333 states and 19215 transitions. [2025-03-03 15:10:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:10:14,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:14,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:14,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 15:10:14,180 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:14,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:14,181 INFO L85 PathProgramCache]: Analyzing trace with hash -922024500, now seen corresponding path program 1 times [2025-03-03 15:10:14,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:14,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894964127] [2025-03-03 15:10:14,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:14,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:10:14,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:10:14,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:14,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:14,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:10:14,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:14,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894964127] [2025-03-03 15:10:14,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894964127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:14,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:14,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:10:14,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451816311] [2025-03-03 15:10:14,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:14,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:10:14,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:14,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:10:14,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:10:14,531 INFO L87 Difference]: Start difference. First operand 14333 states and 19215 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:15,334 INFO L93 Difference]: Finished difference Result 37721 states and 51393 transitions. [2025-03-03 15:10:15,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:10:15,334 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 15:10:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:15,373 INFO L225 Difference]: With dead ends: 37721 [2025-03-03 15:10:15,373 INFO L226 Difference]: Without dead ends: 37285 [2025-03-03 15:10:15,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:10:15,385 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 5076 mSDsluCounter, 2986 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5076 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:15,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5076 Valid, 3572 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:10:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37285 states. [2025-03-03 15:10:15,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37285 to 14331. [2025-03-03 15:10:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14331 states, 14330 states have (on average 1.3406140963014654) internal successors, (19211), 14330 states have internal predecessors, (19211), 0 states have call successors, (0), 0 states 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:10:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14331 states to 14331 states and 19211 transitions. [2025-03-03 15:10:15,639 INFO L78 Accepts]: Start accepts. Automaton has 14331 states and 19211 transitions. Word has length 92 [2025-03-03 15:10:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:15,639 INFO L471 AbstractCegarLoop]: Abstraction has 14331 states and 19211 transitions. [2025-03-03 15:10:15,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 14331 states and 19211 transitions. [2025-03-03 15:10:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:10:15,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:15,647 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:10:15,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 15:10:15,647 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:15,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:15,648 INFO L85 PathProgramCache]: Analyzing trace with hash -630296502, now seen corresponding path program 1 times [2025-03-03 15:10:15,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:15,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278889553] [2025-03-03 15:10:15,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:15,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:15,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:10:15,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:10:15,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:15,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:15,740 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:10:15,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:15,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278889553] [2025-03-03 15:10:15,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278889553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:15,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:15,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:10:15,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141427926] [2025-03-03 15:10:15,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:15,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:10:15,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:15,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:10:15,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:15,741 INFO L87 Difference]: Start difference. First operand 14331 states and 19211 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) 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:10:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:16,144 INFO L93 Difference]: Finished difference Result 32277 states and 43544 transitions. [2025-03-03 15:10:16,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:10:16,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) 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:10:16,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:16,178 INFO L225 Difference]: With dead ends: 32277 [2025-03-03 15:10:16,178 INFO L226 Difference]: Without dead ends: 31969 [2025-03-03 15:10:16,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:10:16,190 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 3051 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:16,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 1108 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:10:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31969 states. [2025-03-03 15:10:16,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31969 to 14334. [2025-03-03 15:10:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14334 states, 14333 states have (on average 1.3405428033210074) internal successors, (19214), 14333 states have internal predecessors, (19214), 0 states have call successors, (0), 0 states 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:10:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14334 states to 14334 states and 19214 transitions. [2025-03-03 15:10:16,436 INFO L78 Accepts]: Start accepts. Automaton has 14334 states and 19214 transitions. Word has length 95 [2025-03-03 15:10:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:16,436 INFO L471 AbstractCegarLoop]: Abstraction has 14334 states and 19214 transitions. [2025-03-03 15:10:16,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) 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:10:16,436 INFO L276 IsEmpty]: Start isEmpty. Operand 14334 states and 19214 transitions. [2025-03-03 15:10:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:10:16,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:16,445 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:10:16,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 15:10:16,445 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:16,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash 842036253, now seen corresponding path program 1 times [2025-03-03 15:10:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:16,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609999829] [2025-03-03 15:10:16,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:16,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:16,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:10:16,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:10:16,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:16,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:16,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:16,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609999829] [2025-03-03 15:10:16,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609999829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:16,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:16,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595284188] [2025-03-03 15:10:16,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:16,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:16,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:16,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:16,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:16,497 INFO L87 Difference]: Start difference. First operand 14334 states and 19214 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:10:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:16,550 INFO L93 Difference]: Finished difference Result 22050 states and 29750 transitions. [2025-03-03 15:10:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:16,550 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:10:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:16,563 INFO L225 Difference]: With dead ends: 22050 [2025-03-03 15:10:16,563 INFO L226 Difference]: Without dead ends: 14336 [2025-03-03 15:10:16,571 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:10:16,571 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 378 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:16,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1471 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14336 states. [2025-03-03 15:10:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14336 to 14334. [2025-03-03 15:10:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14334 states, 14333 states have (on average 1.3311239796274332) internal successors, (19079), 14333 states have internal predecessors, (19079), 0 states have call successors, (0), 0 states 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:10:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14334 states to 14334 states and 19079 transitions. [2025-03-03 15:10:16,695 INFO L78 Accepts]: Start accepts. Automaton has 14334 states and 19079 transitions. Word has length 96 [2025-03-03 15:10:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:16,695 INFO L471 AbstractCegarLoop]: Abstraction has 14334 states and 19079 transitions. [2025-03-03 15:10:16,695 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:10:16,695 INFO L276 IsEmpty]: Start isEmpty. Operand 14334 states and 19079 transitions. [2025-03-03 15:10:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:10:16,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:16,703 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:10:16,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 15:10:16,703 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:16,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:16,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1614787656, now seen corresponding path program 1 times [2025-03-03 15:10:16,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:16,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145774373] [2025-03-03 15:10:16,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:16,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:16,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:10:16,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:10:16,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:16,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:16,742 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:10:16,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:16,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145774373] [2025-03-03 15:10:16,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145774373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:16,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:16,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083055976] [2025-03-03 15:10:16,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:16,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:16,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:16,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:16,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:16,743 INFO L87 Difference]: Start difference. First operand 14334 states and 19079 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:10:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:16,813 INFO L93 Difference]: Finished difference Result 26159 states and 35129 transitions. [2025-03-03 15:10:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:16,813 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:10:16,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:16,827 INFO L225 Difference]: With dead ends: 26159 [2025-03-03 15:10:16,827 INFO L226 Difference]: Without dead ends: 17269 [2025-03-03 15:10:16,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:16,836 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 575 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:16,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 861 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17269 states. [2025-03-03 15:10:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17269 to 13368. [2025-03-03 15:10:16,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13368 states, 13367 states have (on average 1.333582703673225) internal successors, (17826), 13367 states have internal predecessors, (17826), 0 states have call successors, (0), 0 states 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:10:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13368 states to 13368 states and 17826 transitions. [2025-03-03 15:10:16,953 INFO L78 Accepts]: Start accepts. Automaton has 13368 states and 17826 transitions. Word has length 97 [2025-03-03 15:10:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:16,953 INFO L471 AbstractCegarLoop]: Abstraction has 13368 states and 17826 transitions. [2025-03-03 15:10:16,953 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:10:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 13368 states and 17826 transitions. [2025-03-03 15:10:16,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:10:16,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:16,960 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:10:16,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 15:10:16,960 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:16,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1463171037, now seen corresponding path program 1 times [2025-03-03 15:10:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:16,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209465237] [2025-03-03 15:10:16,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:16,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:16,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:10:16,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:10:16,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:16,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:17,315 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:10:17,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209465237] [2025-03-03 15:10:17,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209465237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:17,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:17,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:10:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119826897] [2025-03-03 15:10:17,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:17,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:10:17,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:17,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:10:17,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:10:17,316 INFO L87 Difference]: Start difference. First operand 13368 states and 17826 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 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:10:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:17,842 INFO L93 Difference]: Finished difference Result 20557 states and 27661 transitions. [2025-03-03 15:10:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:10:17,843 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 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:10:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:17,863 INFO L225 Difference]: With dead ends: 20557 [2025-03-03 15:10:17,863 INFO L226 Difference]: Without dead ends: 20370 [2025-03-03 15:10:17,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:10:17,871 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 2937 mSDsluCounter, 2389 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2937 SdHoareTripleChecker+Valid, 2930 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:17,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2937 Valid, 2930 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:10:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20370 states. [2025-03-03 15:10:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20370 to 13329. [2025-03-03 15:10:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13329 states, 13328 states have (on average 1.3338835534213684) internal successors, (17778), 13328 states have internal predecessors, (17778), 0 states have call successors, (0), 0 states 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:10:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13329 states to 13329 states and 17778 transitions. [2025-03-03 15:10:18,045 INFO L78 Accepts]: Start accepts. Automaton has 13329 states and 17778 transitions. Word has length 98 [2025-03-03 15:10:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:18,046 INFO L471 AbstractCegarLoop]: Abstraction has 13329 states and 17778 transitions. [2025-03-03 15:10:18,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 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:10:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 13329 states and 17778 transitions. [2025-03-03 15:10:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 15:10:18,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:18,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:18,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 15:10:18,055 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:18,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2057235352, now seen corresponding path program 1 times [2025-03-03 15:10:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289279641] [2025-03-03 15:10:18,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:18,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:10:18,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:10:18,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:18,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:18,142 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:10:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289279641] [2025-03-03 15:10:18,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289279641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:18,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:18,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:10:18,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228638072] [2025-03-03 15:10:18,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:18,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:10:18,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:18,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:10:18,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:18,143 INFO L87 Difference]: Start difference. First operand 13329 states and 17778 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:10:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:18,306 INFO L93 Difference]: Finished difference Result 48225 states and 66114 transitions. [2025-03-03 15:10:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:10:18,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-03 15:10:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:18,343 INFO L225 Difference]: With dead ends: 48225 [2025-03-03 15:10:18,344 INFO L226 Difference]: Without dead ends: 37909 [2025-03-03 15:10:18,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:10:18,359 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 3509 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3509 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:18,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3509 Valid, 1933 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:10:18,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37909 states. [2025-03-03 15:10:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37909 to 23643. [2025-03-03 15:10:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23643 states, 23642 states have (on average 1.342399120209796) internal successors, (31737), 23642 states have internal predecessors, (31737), 0 states have call successors, (0), 0 states 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:10:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23643 states to 23643 states and 31737 transitions. [2025-03-03 15:10:18,603 INFO L78 Accepts]: Start accepts. Automaton has 23643 states and 31737 transitions. Word has length 104 [2025-03-03 15:10:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:18,603 INFO L471 AbstractCegarLoop]: Abstraction has 23643 states and 31737 transitions. [2025-03-03 15:10:18,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:10:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 23643 states and 31737 transitions. [2025-03-03 15:10:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:10:18,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:18,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:18,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-03 15:10:18,618 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:18,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:18,618 INFO L85 PathProgramCache]: Analyzing trace with hash -620628942, now seen corresponding path program 1 times [2025-03-03 15:10:18,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:18,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382628903] [2025-03-03 15:10:18,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:18,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:18,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:10:18,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:10:18,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:18,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:18,740 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:10:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382628903] [2025-03-03 15:10:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382628903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:10:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349469803] [2025-03-03 15:10:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:18,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:10:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:18,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:10:18,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:18,741 INFO L87 Difference]: Start difference. First operand 23643 states and 31737 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:10:18,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:18,917 INFO L93 Difference]: Finished difference Result 30429 states and 40773 transitions. [2025-03-03 15:10:18,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:10:18,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-03 15:10:18,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:18,943 INFO L225 Difference]: With dead ends: 30429 [2025-03-03 15:10:18,943 INFO L226 Difference]: Without dead ends: 28453 [2025-03-03 15:10:18,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:18,952 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 2105 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2105 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:18,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2105 Valid, 1907 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:10:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28453 states. [2025-03-03 15:10:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28453 to 27493. [2025-03-03 15:10:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27493 states, 27492 states have (on average 1.3423541393860032) internal successors, (36904), 27492 states have internal predecessors, (36904), 0 states have call successors, (0), 0 states 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:10:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27493 states to 27493 states and 36904 transitions. [2025-03-03 15:10:19,182 INFO L78 Accepts]: Start accepts. Automaton has 27493 states and 36904 transitions. Word has length 105 [2025-03-03 15:10:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:19,182 INFO L471 AbstractCegarLoop]: Abstraction has 27493 states and 36904 transitions. [2025-03-03 15:10:19,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:10:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 27493 states and 36904 transitions. [2025-03-03 15:10:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:10:19,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:19,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:19,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-03 15:10:19,199 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:19,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash -133978441, now seen corresponding path program 1 times [2025-03-03 15:10:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:19,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994606369] [2025-03-03 15:10:19,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:19,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:10:19,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:10:19,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:19,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:19,272 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:10:19,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:19,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994606369] [2025-03-03 15:10:19,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994606369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:19,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:19,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:19,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64150170] [2025-03-03 15:10:19,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:19,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:19,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:19,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:19,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:19,273 INFO L87 Difference]: Start difference. First operand 27493 states and 36904 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:10:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:19,410 INFO L93 Difference]: Finished difference Result 73793 states and 99954 transitions. [2025-03-03 15:10:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-03 15:10:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:19,466 INFO L225 Difference]: With dead ends: 73793 [2025-03-03 15:10:19,466 INFO L226 Difference]: Without dead ends: 49299 [2025-03-03 15:10:19,492 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:10:19,493 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 202 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:19,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1231 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49299 states. [2025-03-03 15:10:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49299 to 46049. [2025-03-03 15:10:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46049 states, 46048 states have (on average 1.3461170952050034) internal successors, (61986), 46048 states have internal predecessors, (61986), 0 states have call successors, (0), 0 states 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:10:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46049 states to 46049 states and 61986 transitions. [2025-03-03 15:10:19,922 INFO L78 Accepts]: Start accepts. Automaton has 46049 states and 61986 transitions. Word has length 106 [2025-03-03 15:10:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:19,922 INFO L471 AbstractCegarLoop]: Abstraction has 46049 states and 61986 transitions. [2025-03-03 15:10:19,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:10:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 46049 states and 61986 transitions. [2025-03-03 15:10:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 15:10:19,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:19,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:19,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-03 15:10:19,938 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:19,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1058545641, now seen corresponding path program 1 times [2025-03-03 15:10:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:19,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390470816] [2025-03-03 15:10:19,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:19,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:19,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:10:19,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:10:19,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:19,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:20,099 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:10:20,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:20,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390470816] [2025-03-03 15:10:20,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390470816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:20,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:20,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682920136] [2025-03-03 15:10:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:20,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:20,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:20,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:20,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:20,101 INFO L87 Difference]: Start difference. First operand 46049 states and 61986 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:10:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:20,372 INFO L93 Difference]: Finished difference Result 128389 states and 173556 transitions. [2025-03-03 15:10:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:20,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-03 15:10:20,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:20,462 INFO L225 Difference]: With dead ends: 128389 [2025-03-03 15:10:20,462 INFO L226 Difference]: Without dead ends: 85339 [2025-03-03 15:10:20,504 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:10:20,504 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 180 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:20,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1226 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85339 states. [2025-03-03 15:10:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85339 to 79241. [2025-03-03 15:10:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79241 states, 79240 states have (on average 1.3447501261988895) internal successors, (106558), 79240 states have internal predecessors, (106558), 0 states have call successors, (0), 0 states 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:10:21,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79241 states to 79241 states and 106558 transitions. [2025-03-03 15:10:21,244 INFO L78 Accepts]: Start accepts. Automaton has 79241 states and 106558 transitions. Word has length 107 [2025-03-03 15:10:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:21,244 INFO L471 AbstractCegarLoop]: Abstraction has 79241 states and 106558 transitions. [2025-03-03 15:10:21,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:10:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 79241 states and 106558 transitions. [2025-03-03 15:10:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:10:21,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:21,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:21,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-03 15:10:21,257 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:21,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:21,258 INFO L85 PathProgramCache]: Analyzing trace with hash 393587576, now seen corresponding path program 1 times [2025-03-03 15:10:21,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:21,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690061315] [2025-03-03 15:10:21,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:21,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:10:21,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:10:21,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:21,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:21,335 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:10:21,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690061315] [2025-03-03 15:10:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690061315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:21,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:21,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446627220] [2025-03-03 15:10:21,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:21,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:21,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:21,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:21,336 INFO L87 Difference]: Start difference. First operand 79241 states and 106558 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:10:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:21,809 INFO L93 Difference]: Finished difference Result 224645 states and 302456 transitions. [2025-03-03 15:10:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-03 15:10:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:21,971 INFO L225 Difference]: With dead ends: 224645 [2025-03-03 15:10:21,971 INFO L226 Difference]: Without dead ends: 148403 [2025-03-03 15:10:22,042 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:10:22,043 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 158 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:22,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1215 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:22,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148403 states. [2025-03-03 15:10:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148403 to 137141. [2025-03-03 15:10:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137141 states, 137140 states have (on average 1.3397258276214088) internal successors, (183730), 137140 states have internal predecessors, (183730), 0 states have call successors, (0), 0 states 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:10:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137141 states to 137141 states and 183730 transitions. [2025-03-03 15:10:23,679 INFO L78 Accepts]: Start accepts. Automaton has 137141 states and 183730 transitions. Word has length 108 [2025-03-03 15:10:23,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:23,679 INFO L471 AbstractCegarLoop]: Abstraction has 137141 states and 183730 transitions. [2025-03-03 15:10:23,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:10:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 137141 states and 183730 transitions. [2025-03-03 15:10:23,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:10:23,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:23,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:23,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-03 15:10:23,691 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:23,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:23,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1202955013, now seen corresponding path program 1 times [2025-03-03 15:10:23,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:23,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027779722] [2025-03-03 15:10:23,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:23,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:23,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:10:23,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:10:23,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:23,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:23,765 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:10:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027779722] [2025-03-03 15:10:23,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027779722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:23,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:23,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:23,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648537214] [2025-03-03 15:10:23,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:23,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:23,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:23,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:23,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:23,765 INFO L87 Difference]: Start difference. First operand 137141 states and 183730 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:10:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:25,256 INFO L93 Difference]: Finished difference Result 394541 states and 528424 transitions. [2025-03-03 15:10:25,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:25,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-03 15:10:25,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:25,714 INFO L225 Difference]: With dead ends: 394541 [2025-03-03 15:10:25,715 INFO L226 Difference]: Without dead ends: 256536 [2025-03-03 15:10:25,824 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:10:25,825 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 124 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:25,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1199 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256536 states. [2025-03-03 15:10:28,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256536 to 240379. [2025-03-03 15:10:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240379 states, 240378 states have (on average 1.3317566499430065) internal successors, (320125), 240378 states have internal predecessors, (320125), 0 states have call successors, (0), 0 states 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:10:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240379 states to 240379 states and 320125 transitions. [2025-03-03 15:10:29,280 INFO L78 Accepts]: Start accepts. Automaton has 240379 states and 320125 transitions. Word has length 111 [2025-03-03 15:10:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:29,280 INFO L471 AbstractCegarLoop]: Abstraction has 240379 states and 320125 transitions. [2025-03-03 15:10:29,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:10:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 240379 states and 320125 transitions. [2025-03-03 15:10:29,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:10:29,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:29,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:29,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-03 15:10:29,290 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-03 15:10:29,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:29,290 INFO L85 PathProgramCache]: Analyzing trace with hash 762392362, now seen corresponding path program 1 times [2025-03-03 15:10:29,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:29,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515799932] [2025-03-03 15:10:29,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:29,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:29,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:10:29,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:10:29,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:29,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:29,458 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:10:29,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:29,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515799932] [2025-03-03 15:10:29,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515799932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:29,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:29,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:10:29,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085842264] [2025-03-03 15:10:29,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:29,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:10:29,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:29,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:10:29,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:10:29,459 INFO L87 Difference]: Start difference. First operand 240379 states and 320125 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:10:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:30,169 INFO L93 Difference]: Finished difference Result 255360 states and 340097 transitions. [2025-03-03 15:10:30,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:10:30,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-03-03 15:10:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:30,501 INFO L225 Difference]: With dead ends: 255360 [2025-03-03 15:10:30,501 INFO L226 Difference]: Without dead ends: 255355 [2025-03-03 15:10:30,571 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:10:30,571 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 0 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3029 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:30,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3029 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255355 states.