./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.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac65b92526cdafd793de45207c8e0f67883c86dc6af3548ef3333097912e0ee4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:20:46,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:20:46,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:20:46,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:20:46,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:20:46,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:20:46,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:20:46,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:20:46,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:20:46,690 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:20:46,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:20:46,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:20:46,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:20:46,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:20:46,690 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:20:46,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:20:46,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:20:46,690 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:20:46,691 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:20:46,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:20:46,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:20:46,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:20:46,693 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:20:46,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:20:46,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:20:46,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:20:46,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:20:46,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:20:46,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:20:46,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:20:46,693 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 -> ac65b92526cdafd793de45207c8e0f67883c86dc6af3548ef3333097912e0ee4 [2025-03-08 06:20:46,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:20:46,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:20:46,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:20:46,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:20:46,930 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:20:46,931 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:20:48,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e9e1ef9/3849483be154466ab3c5e56df3de11b7/FLAG029f1729d [2025-03-08 06:20:48,469 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:20:48,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:20:48,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e9e1ef9/3849483be154466ab3c5e56df3de11b7/FLAG029f1729d [2025-03-08 06:20:48,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0e9e1ef9/3849483be154466ab3c5e56df3de11b7 [2025-03-08 06:20:48,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:20:48,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:20:48,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:20:48,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:20:48,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:20:48,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:20:48" (1/1) ... [2025-03-08 06:20:48,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610356d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:48, skipping insertion in model container [2025-03-08 06:20:48,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:20:48" (1/1) ... [2025-03-08 06:20:48,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:20:48,894 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13606,13619] [2025-03-08 06:20:48,918 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.UNBOUNDED.pals.c.v+lhb-reducer.c[19227,19240] [2025-03-08 06:20:48,922 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.UNBOUNDED.pals.c.v+lhb-reducer.c[20416,20429] [2025-03-08 06:20:48,931 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.UNBOUNDED.pals.c.v+lhb-reducer.c[22562,22575] [2025-03-08 06:20:48,940 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.UNBOUNDED.pals.c.v+lhb-reducer.c[25842,25855] [2025-03-08 06:20:48,958 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.UNBOUNDED.pals.c.v+lhb-reducer.c[32130,32143] [2025-03-08 06:20:49,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:20:49,279 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:20:49,359 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.UNBOUNDED.pals.c.v+lhb-reducer.c[13606,13619] [2025-03-08 06:20:49,365 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.UNBOUNDED.pals.c.v+lhb-reducer.c[19227,19240] [2025-03-08 06:20:49,368 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.UNBOUNDED.pals.c.v+lhb-reducer.c[20416,20429] [2025-03-08 06:20:49,371 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.UNBOUNDED.pals.c.v+lhb-reducer.c[22562,22575] [2025-03-08 06:20:49,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25842,25855] [2025-03-08 06:20:49,385 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.UNBOUNDED.pals.c.v+lhb-reducer.c[32130,32143] [2025-03-08 06:20:49,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:20:49,595 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:20:49,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49 WrapperNode [2025-03-08 06:20:49,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:20:49,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:20:49,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:20:49,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:20:49,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (1/1) ... [2025-03-08 06:20:49,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (1/1) ... [2025-03-08 06:20:49,825 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9476 [2025-03-08 06:20:49,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:20:49,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:20:49,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:20:49,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:20:49,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (1/1) ... [2025-03-08 06:20:49,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (1/1) ... [2025-03-08 06:20:49,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (1/1) ... [2025-03-08 06:20:49,915 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:20:49,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (1/1) ... [2025-03-08 06:20:49,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (1/1) ... [2025-03-08 06:20:49,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (1/1) ... [2025-03-08 06:20:49,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (1/1) ... [2025-03-08 06:20:49,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (1/1) ... [2025-03-08 06:20:49,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (1/1) ... [2025-03-08 06:20:50,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:20:50,023 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:20:50,023 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:20:50,024 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:20:50,024 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (1/1) ... [2025-03-08 06:20:50,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:20:50,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:20:50,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:20:50,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:20:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:20:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:20:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:20:50,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:20:50,305 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:20:50,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:20:53,839 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12125: havoc main_~node5__m5~68#1; [2025-03-08 06:20:53,840 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10011: havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-08 06:20:53,840 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8956: 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-08 06:20:53,840 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6050: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~51#1; [2025-03-08 06:20:53,840 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1558: havoc main_~node5__m5~5#1; [2025-03-08 06:20:53,841 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13451: havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~135#1; [2025-03-08 06:20:53,841 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: 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-08 06:20:53,841 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11602: havoc main_~node5__m5~65#1; [2025-03-08 06:20:53,841 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14245: havoc main_~node5__m5~80#1; [2025-03-08 06:20:53,841 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L506: havoc main_~node2__m2~1#1; [2025-03-08 06:20:53,841 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8170: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~75#1; [2025-03-08 06:20:53,841 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10020: havoc main_~node5__m5~56#1; [2025-03-08 06:20:53,842 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15571: havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~159#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13722: havoc main_~node5__m5~77#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1302: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12665: 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-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3945: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~27#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5531: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~45#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6588: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~57#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11346: havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~111#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9497: havoc main_~node5__m5~53#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13199: 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-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2365: havoc main_~check__tmp~14#1;havoc main_~node5__m5~11#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14785: 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-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8708: havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~81#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7651: havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~69#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5802: 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-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10560: 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-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1047: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4483: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~33#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3426: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~21#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15319: 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-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12413: havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~123#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5279: 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-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7922: 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-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: havoc main_~node3__m3~1#1; [2025-03-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11094: 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-08 06:20:53,843 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L789: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3697: 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-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14533: havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~147#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6342: havoc main_~node5____CPAchecker_TMP_1~20#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7399: 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-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10308: havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~99#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12951: havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~129#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11894: havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~117#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174: 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-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1853: havoc main_~check__tmp~10#1;havoc main_~node5__m5~7#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6876: havoc main_~node5____CPAchecker_TMP_1~23#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8462: havoc main_~node5____CPAchecker_TMP_1~32#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2649: havoc main_~node3__m3~5#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14014: havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~141#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15071: havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~153#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4237: havoc main_~node5____CPAchecker_TMP_1~8#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12165: 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-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8996: havoc main_~node5____CPAchecker_TMP_1~35#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9789: havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~93#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: havoc main_~node4__m4~1#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10846: havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~105#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4771: havoc main_~node5____CPAchecker_TMP_1~11#1; [2025-03-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11642: 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-08 06:20:53,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14285: 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-08 06:20:53,846 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5036: havoc main_~node3__m3~6#1; [2025-03-08 06:20:53,846 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6094: havoc main_~node5__m5~34#1;havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-08 06:20:53,846 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1075: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-08 06:20:53,846 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10060: 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-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13762: 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-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12705: havoc main_~node5____CPAchecker_TMP_1~56#1; [2025-03-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7156: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6628: havoc main_~node5__m5~37#1; [2025-03-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8214: havoc main_~node5__m5~46#1;havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2666: havoc main_~node4__m4~8#1; [2025-03-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1345: havoc main_~check__tmp~5#1; [2025-03-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9537: 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-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L817: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9274: havoc main_~node2__m2~4#1; [2025-03-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5046: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3989: havoc main_~node5__m5~22#1;havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5575: havoc main_~node5__m5~31#1; [2025-03-08 06:20:53,847 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13239: havoc main_~node5____CPAchecker_TMP_1~59#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14825: havoc main_~node5____CPAchecker_TMP_1~68#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8748: havoc main_~node5__m5~49#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842: havoc main_~node5____CPAchecker_TMP_1~17#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L557: havoc main_~node5__m5~1#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10600: havoc main_~node5____CPAchecker_TMP_1~44#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4523: havoc main_~node5__m5~25#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7166: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7695: havoc main_~node5__m5~43#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15359: havoc main_~node5____CPAchecker_TMP_1~71#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5319: havoc main_~node5____CPAchecker_TMP_1~14#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7962: havoc main_~node5____CPAchecker_TMP_1~29#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3470: havoc main_~node5__m5~19#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9284: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5056: havoc main_~node4__m4~12#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11134: havoc main_~node5____CPAchecker_TMP_1~47#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11399: havoc main_~node3__m3~9#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12457: havoc main_~node5__m5~70#1;havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3737: havoc main_~node5____CPAchecker_TMP_1~5#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7439: havoc main_~node5____CPAchecker_TMP_1~26#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7176: havoc main_~node4__m4~15#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13519: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12991: havoc main_~node5__m5~73#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3214: havoc main_~node5____CPAchecker_TMP_1~2#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14577: havoc main_~node5__m5~82#1;havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6386: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~55#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5066: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9294: havoc main_~node3__m3~8#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10352: havoc main_~node5__m5~58#1;havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11409: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11938: havoc main_~node5__m5~67#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2162: havoc main_~node2__m2~3#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15111: havoc main_~node5__m5~85#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12205: havoc main_~node5____CPAchecker_TMP_1~53#1; [2025-03-08 06:20:53,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6920: havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~61#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8506: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~79#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7186: havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10886: havoc main_~node5__m5~61#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13529: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14058: havoc main_~node5__m5~79#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4281: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~31#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5075: havoc main_~node5__m5~28#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11682: havoc main_~node5____CPAchecker_TMP_1~50#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14325: havoc main_~node5____CPAchecker_TMP_1~65#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9304: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9040: havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~85#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9833: havoc main_~node5__m5~55#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11419: havoc main_~node4__m4~21#1; [2025-03-08 06:20:53,849 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6134: 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-08 06:20:53,850 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10100: havoc main_~node5____CPAchecker_TMP_1~41#1; [2025-03-08 06:20:53,850 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4815: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~37#1; [2025-03-08 06:20:53,850 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7195: havoc main_~node5__m5~40#1; [2025-03-08 06:20:53,851 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13802: havoc main_~node5____CPAchecker_TMP_1~62#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6668: 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-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13539: havoc main_~node4__m4~24#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8254: 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-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9577: havoc main_~node5____CPAchecker_TMP_1~38#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12749: havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~127#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9314: havoc main_~node4__m4~18#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2179: havoc main_~node3__m3~4#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4029: 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-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5615: 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-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: havoc main_~node4__m4~7#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11429: havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8788: 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-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2710: havoc main_~check__tmp~16#1;havoc main_~node5__m5~14#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13283: havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~133#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14869: havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~151#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4563: 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-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7735: 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-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13549: havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5886: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~49#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10644: havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~103#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3510: 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-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9324: havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11438: havoc main_~node5__m5~64#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15403: havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~157#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L605: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12497: 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-08 06:20:53,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5363: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~43#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8006: havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~73#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11178: havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~109#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13558: havoc main_~node5__m5~76#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1138: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3781: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~25#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1667: havoc main_~node3__m3~3#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2196: havoc main_~node4__m4~6#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1932: havoc main_~node4__m4~5#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L875: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13031: 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-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14617: 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-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7483: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~67#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9333: havoc main_~node5__m5~52#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10392: 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-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11978: 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-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L351: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3258: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~19#1; [2025-03-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15151: 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-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10926: 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-08 06:20:53,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14098: 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-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12249: havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~121#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6964: havoc main_~node5__m5~39#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5115: 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-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1416: havoc main_~node4__m4~3#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9873: 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-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6174: havoc main_~node5____CPAchecker_TMP_1~19#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1684: havoc main_~node4__m4~4#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11726: havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~115#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2213: havoc main_~node5__m5~10#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9084: havoc main_~node5__m5~51#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14369: havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~145#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: havoc main_~node2__m2~2#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7235: 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-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6708: havoc main_~node5____CPAchecker_TMP_1~22#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8294: havoc main_~node5____CPAchecker_TMP_1~31#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4859: havoc main_~node5__m5~27#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10144: havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~97#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6445: havoc main_~node4__m4~14#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13846: havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~139#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4069: havoc main_~node5____CPAchecker_TMP_1~7#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5655: havoc main_~node5____CPAchecker_TMP_1~16#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8828: havoc main_~node5____CPAchecker_TMP_1~34#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9621: havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~91#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8565: havoc main_~node4__m4~17#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2488: havoc main_~check__tmp~15#1;havoc main_~node5__m5~12#1; [2025-03-08 06:20:53,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L903: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4603: havoc main_~node5____CPAchecker_TMP_1~10#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7775: havoc main_~node5____CPAchecker_TMP_1~28#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1433: havoc main_~node5__m5~4#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4340: havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5926: havoc main_~node5__m5~33#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6455: havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13327: havoc main_~node5__m5~75#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3550: havoc main_~node5____CPAchecker_TMP_1~4#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11478: 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-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1701: havoc main_~node5__m5~6#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12537: havoc main_~node5____CPAchecker_TMP_1~55#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L646: havoc main_~node3__m3~2#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8046: havoc main_~node5__m5~45#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8575: havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15447: havoc main_~node5__m5~87#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13598: 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-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2764: havoc main_~node5__m5~15#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3821: havoc main_~node5__m5~21#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5407: havoc main_~node5__m5~30#1;havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4350: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6464: havoc main_~node5__m5~36#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13071: havoc main_~node5____CPAchecker_TMP_1~58#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14657: havoc main_~node5____CPAchecker_TMP_1~67#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11222: havoc main_~node5__m5~63#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12808: havoc main_~node4__m4~23#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-08 06:20:53,856 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9373: 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-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10432: havoc main_~node5____CPAchecker_TMP_1~43#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976: havoc main_~check__tmp~11#1;havoc main_~node5__m5~8#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12018: havoc main_~node5____CPAchecker_TMP_1~52#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: havoc main_~node3__m3~0#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7527: havoc main_~node5__m5~42#1;havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8584: havoc main_~node5__m5~48#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15191: havoc main_~node5____CPAchecker_TMP_1~70#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14928: havoc main_~node4__m4~26#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4359: havoc main_~node5__m5~24#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3302: havoc main_~node5__m5~18#1;havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10966: havoc main_~node5____CPAchecker_TMP_1~46#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14138: havoc main_~node5____CPAchecker_TMP_1~64#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10703: havoc main_~node4__m4~20#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12289: havoc main_~node5__m5~69#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7004: 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-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12818: havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-08 06:20:53,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5155: havoc main_~node5____CPAchecker_TMP_1~13#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2249: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~12#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L664: havoc main_~node4__m4~2#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9913: havoc main_~node5____CPAchecker_TMP_1~40#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L401: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9124: 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-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14409: havoc main_~node5__m5~81#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14938: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6218: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~53#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7275: havoc main_~node5____CPAchecker_TMP_1~25#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4899: 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-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10184: havoc main_~node5__m5~57#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12827: havoc main_~node5__m5~72#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11770: havoc main_~node5__m5~66#1;havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10713: havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3050: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6752: havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~59#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8338: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~77#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: havoc main_~node4__m4~0#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~6#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13890: havoc main_~node5__m5~78#1;havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14947: havoc main_~node5__m5~84#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4113: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~29#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5699: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~47#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1208: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1737: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~8#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10722: havoc main_~node5__m5~60#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8872: havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~83#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9665: havoc main_~node5__m5~54#1;havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5966: 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-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13367: 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-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: havoc main_~node5__m5~2#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4647: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~35#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11518: havoc main_~node5____CPAchecker_TMP_1~49#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7819: havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~71#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L421: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8086: 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-08 06:20:53,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~23#1; [2025-03-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15487: 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-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12581: havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~125#1; [2025-03-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13638: havoc main_~node5____CPAchecker_TMP_1~61#1; [2025-03-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3861: 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-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5447: 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-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6504: 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-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11262: 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-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542: havoc main_~node5__m5~13#1; [2025-03-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9413: havoc main_~node5____CPAchecker_TMP_1~37#1; [2025-03-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L430: havoc main_~node5__m5~0#1; [2025-03-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13115: havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~131#1; [2025-03-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14701: havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~149#1; [2025-03-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7567: 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-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8624: 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-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L961: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10476: havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~101#1; [2025-03-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12062: havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~119#1; [2025-03-08 06:20:53,861 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4399: 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-08 06:20:53,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3342: 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-08 06:20:53,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15235: havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~155#1; [2025-03-08 06:20:53,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12329: 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-08 06:20:53,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7044: havoc main_~node5____CPAchecker_TMP_1~24#1; [2025-03-08 06:20:53,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11010: havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~107#1; [2025-03-08 06:20:53,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14182: havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~143#1; [2025-03-08 06:20:53,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2292: havoc main_~check__tmp~13#1; [2025-03-08 06:20:53,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5199: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~41#1; [2025-03-08 06:20:53,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9164: havoc main_~node5____CPAchecker_TMP_1~36#1; [2025-03-08 06:20:53,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14449: 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-08 06:20:53,864 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9957: havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~95#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2030: havoc main_~node5__m5~9#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4939: havoc main_~node5____CPAchecker_TMP_1~12#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10224: 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-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12867: 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-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11810: 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-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6262: havoc main_~node5__m5~35#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7319: havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~65#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3094: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~17#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13930: 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-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14987: 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-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6796: havoc main_~node5__m5~38#1;havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8382: havoc main_~node5__m5~47#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1512: havoc main_~check__tmp~7#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10762: 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-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9705: 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-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6006: havoc main_~node5____CPAchecker_TMP_1~18#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4157: havoc main_~node5__m5~23#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5743: havoc main_~node4__m4~13#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13407: havoc main_~node5____CPAchecker_TMP_1~60#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1780: havoc main_~check__tmp~9#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8916: havoc main_~node5__m5~50#1;havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L724: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L989: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8126: havoc main_~node5____CPAchecker_TMP_1~30#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4691: havoc main_~node5__m5~26#1;havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11562: havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~113#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7863: havoc main_~node4__m4~16#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15527: havoc main_~node5____CPAchecker_TMP_1~72#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3901: havoc main_~node5____CPAchecker_TMP_1~6#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5487: havoc main_~node5____CPAchecker_TMP_1~15#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6544: havoc main_~node5____CPAchecker_TMP_1~21#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3638: havoc main_~node4__m4~10#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11302: havoc main_~node5____CPAchecker_TMP_1~48#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5753: havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13682: havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~137#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12625: havoc main_~node5__m5~71#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7607: havoc main_~node5____CPAchecker_TMP_1~27#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8664: havoc main_~node5____CPAchecker_TMP_1~33#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9457: havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~89#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1266: havoc main_~node5__m5~3#1; [2025-03-08 06:20:53,865 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7873: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-08 06:20:53,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13159: havoc main_~node5__m5~74#1;havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-08 06:20:53,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4439: havoc main_~node5____CPAchecker_TMP_1~9#1; [2025-03-08 06:20:53,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3382: havoc main_~node5____CPAchecker_TMP_1~3#1; [2025-03-08 06:20:53,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14745: havoc main_~node5__m5~83#1; [2025-03-08 06:20:53,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5762: havoc main_~node5__m5~32#1; [2025-03-08 06:20:53,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3648: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-08 06:20:53,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12369: havoc main_~node5____CPAchecker_TMP_1~54#1; [2025-03-08 06:20:53,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10520: havoc main_~node5__m5~59#1; [2025-03-08 06:20:53,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12106: havoc main_~node4__m4~22#1; [2025-03-08 06:20:53,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15279: havoc main_~node5__m5~86#1;havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-08 06:20:53,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7088: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~63#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L482: havoc main_~node1__m1~1#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-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5239: havoc main_~node5__m5~29#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7882: havoc main_~node5__m5~44#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14489: havoc main_~node5____CPAchecker_TMP_1~66#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11054: havoc main_~node5__m5~62#1;havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14226: havoc main_~node4__m4~25#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2863: havoc main_~node5__m5~16#1;havoc main_~node4__m4~9#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3657: havoc main_~node5__m5~20#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10264: havoc main_~node5____CPAchecker_TMP_1~42#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12907: havoc main_~node5____CPAchecker_TMP_1~57#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11850: havoc main_~node5____CPAchecker_TMP_1~51#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9208: havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~87#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10001: havoc main_~node4__m4~19#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6302: 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-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7359: havoc main_~node5__m5~41#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12116: havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4983: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~39#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3134: havoc main_~node5__m5~17#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13970: havoc main_~node5____CPAchecker_TMP_1~63#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15027: havoc main_~node5____CPAchecker_TMP_1~69#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6836: 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-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8422: 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-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14236: havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10802: havoc main_~node5____CPAchecker_TMP_1~45#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9745: havoc main_~node5____CPAchecker_TMP_1~39#1; [2025-03-08 06:20:53,867 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4197: 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-08 06:20:54,161 INFO L? ?]: Removed 1319 outVars from TransFormulas that were not future-live. [2025-03-08 06:20:54,161 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:20:54,204 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:20:54,208 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:20:54,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:20:54 BoogieIcfgContainer [2025-03-08 06:20:54,209 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:20:54,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:20:54,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:20:54,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:20:54,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:20:48" (1/3) ... [2025-03-08 06:20:54,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a71ab0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:20:54, skipping insertion in model container [2025-03-08 06:20:54,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:20:49" (2/3) ... [2025-03-08 06:20:54,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a71ab0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:20:54, skipping insertion in model container [2025-03-08 06:20:54,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:20:54" (3/3) ... [2025-03-08 06:20:54,218 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:20:54,230 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:20:54,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 1751 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-08 06:20:54,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:20:54,317 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;@77668023, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:20:54,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-08 06:20:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 1751 states, 1744 states have (on average 1.8004587155963303) internal successors, (3140), 1750 states have internal predecessors, (3140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:20:54,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:54,349 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] [2025-03-08 06:20:54,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:20:54,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:54,354 INFO L85 PathProgramCache]: Analyzing trace with hash -928448870, now seen corresponding path program 1 times [2025-03-08 06:20:54,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:54,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044529084] [2025-03-08 06:20:54,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:54,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:54,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:20:54,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:20:54,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:54,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:54,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:54,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044529084] [2025-03-08 06:20:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044529084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:54,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:54,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:54,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271738285] [2025-03-08 06:20:54,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:54,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:54,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:54,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:54,754 INFO L87 Difference]: Start difference. First operand has 1751 states, 1744 states have (on average 1.8004587155963303) internal successors, (3140), 1750 states have internal predecessors, (3140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:54,885 INFO L93 Difference]: Finished difference Result 2319 states and 4089 transitions. [2025-03-08 06:20:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:54,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-08 06:20:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:54,907 INFO L225 Difference]: With dead ends: 2319 [2025-03-08 06:20:54,907 INFO L226 Difference]: Without dead ends: 1975 [2025-03-08 06:20:54,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:54,913 INFO L435 NwaCegarLoop]: 3162 mSDtfsCounter, 1597 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 5041 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:54,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 5041 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:20:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2025-03-08 06:20:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1965. [2025-03-08 06:20:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1959 states have (on average 1.3532414497192444) internal successors, (2651), 1964 states have internal predecessors, (2651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2651 transitions. [2025-03-08 06:20:55,038 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2651 transitions. Word has length 75 [2025-03-08 06:20:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:55,038 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2651 transitions. [2025-03-08 06:20:55,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2651 transitions. [2025-03-08 06:20:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:20:55,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:55,045 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] [2025-03-08 06:20:55,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:20:55,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:20:55,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1589398570, now seen corresponding path program 1 times [2025-03-08 06:20:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:55,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738213354] [2025-03-08 06:20:55,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:55,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:20:55,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:20:55,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:55,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:55,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:55,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738213354] [2025-03-08 06:20:55,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738213354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:55,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:55,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:55,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804569161] [2025-03-08 06:20:55,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:55,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:55,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:55,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:55,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:55,252 INFO L87 Difference]: Start difference. First operand 1965 states and 2651 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:55,476 INFO L93 Difference]: Finished difference Result 3035 states and 4109 transitions. [2025-03-08 06:20:55,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:55,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-08 06:20:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:55,485 INFO L225 Difference]: With dead ends: 3035 [2025-03-08 06:20:55,485 INFO L226 Difference]: Without dead ends: 2709 [2025-03-08 06:20:55,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:55,489 INFO L435 NwaCegarLoop]: 2589 mSDtfsCounter, 1325 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 4070 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:55,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 4070 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:20:55,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2025-03-08 06:20:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 2699. [2025-03-08 06:20:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2693 states have (on average 1.3345711102859266) internal successors, (3594), 2698 states have internal predecessors, (3594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3594 transitions. [2025-03-08 06:20:55,552 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3594 transitions. Word has length 75 [2025-03-08 06:20:55,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:55,552 INFO L471 AbstractCegarLoop]: Abstraction has 2699 states and 3594 transitions. [2025-03-08 06:20:55,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3594 transitions. [2025-03-08 06:20:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:20:55,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:55,559 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] [2025-03-08 06:20:55,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:20:55,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:20:55,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:55,560 INFO L85 PathProgramCache]: Analyzing trace with hash 8953322, now seen corresponding path program 1 times [2025-03-08 06:20:55,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:55,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91831542] [2025-03-08 06:20:55,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:55,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:55,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:20:55,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:20:55,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:55,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:55,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:55,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91831542] [2025-03-08 06:20:55,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91831542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:55,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:55,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614252314] [2025-03-08 06:20:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:55,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:55,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:55,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:55,700 INFO L87 Difference]: Start difference. First operand 2699 states and 3594 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:55,798 INFO L93 Difference]: Finished difference Result 4226 states and 5859 transitions. [2025-03-08 06:20:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:55,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-08 06:20:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:55,808 INFO L225 Difference]: With dead ends: 4226 [2025-03-08 06:20:55,808 INFO L226 Difference]: Without dead ends: 3451 [2025-03-08 06:20:55,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:55,810 INFO L435 NwaCegarLoop]: 2345 mSDtfsCounter, 1183 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:55,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 3768 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:20:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2025-03-08 06:20:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 3441. [2025-03-08 06:20:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3441 states, 3435 states have (on average 1.3612809315866083) internal successors, (4676), 3440 states have internal predecessors, (4676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 4676 transitions. [2025-03-08 06:20:55,863 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 4676 transitions. Word has length 75 [2025-03-08 06:20:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:55,863 INFO L471 AbstractCegarLoop]: Abstraction has 3441 states and 4676 transitions. [2025-03-08 06:20:55,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 4676 transitions. [2025-03-08 06:20:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:20:55,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:55,867 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] [2025-03-08 06:20:55,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:20:55,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:20:55,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash -453474599, now seen corresponding path program 1 times [2025-03-08 06:20:55,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:55,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834210292] [2025-03-08 06:20:55,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:55,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:55,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:20:55,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:20:55,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:55,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:56,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:56,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834210292] [2025-03-08 06:20:56,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834210292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:56,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:56,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:20:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871599857] [2025-03-08 06:20:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:56,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:20:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:56,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:20:56,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:20:56,053 INFO L87 Difference]: Start difference. First operand 3441 states and 4676 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:56,871 INFO L93 Difference]: Finished difference Result 6903 states and 9680 transitions. [2025-03-08 06:20:56,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:20:56,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-08 06:20:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:56,886 INFO L225 Difference]: With dead ends: 6903 [2025-03-08 06:20:56,886 INFO L226 Difference]: Without dead ends: 4064 [2025-03-08 06:20:56,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:20:56,894 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 5807 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5807 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:56,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5807 Valid, 1211 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:20:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2025-03-08 06:20:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 4054. [2025-03-08 06:20:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4054 states, 4048 states have (on average 1.412796442687747) internal successors, (5719), 4053 states have internal predecessors, (5719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 5719 transitions. [2025-03-08 06:20:56,981 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 5719 transitions. Word has length 75 [2025-03-08 06:20:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:56,982 INFO L471 AbstractCegarLoop]: Abstraction has 4054 states and 5719 transitions. [2025-03-08 06:20:56,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 5719 transitions. [2025-03-08 06:20:56,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:20:56,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:56,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] [2025-03-08 06:20:56,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:20:56,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:20:56,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:56,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1097795906, now seen corresponding path program 1 times [2025-03-08 06:20:56,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:56,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499583921] [2025-03-08 06:20:56,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:56,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:57,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:20:57,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:20:57,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:57,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:57,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:57,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499583921] [2025-03-08 06:20:57,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499583921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:57,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:57,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:20:57,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688074651] [2025-03-08 06:20:57,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:57,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:20:57,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:57,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:20:57,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:20:57,220 INFO L87 Difference]: Start difference. First operand 4054 states and 5719 transitions. 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-08 06:20:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:57,938 INFO L93 Difference]: Finished difference Result 9302 states and 13406 transitions. [2025-03-08 06:20:57,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:20:57,939 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-08 06:20:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:57,958 INFO L225 Difference]: With dead ends: 9302 [2025-03-08 06:20:57,958 INFO L226 Difference]: Without dead ends: 5690 [2025-03-08 06:20:57,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:20:57,965 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 4627 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4627 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:57,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4627 Valid, 990 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:20:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2025-03-08 06:20:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 5680. [2025-03-08 06:20:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 5674 states have (on average 1.4427211843496652) internal successors, (8186), 5679 states have internal predecessors, (8186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 8186 transitions. [2025-03-08 06:20:58,077 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 8186 transitions. Word has length 76 [2025-03-08 06:20:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:58,078 INFO L471 AbstractCegarLoop]: Abstraction has 5680 states and 8186 transitions. [2025-03-08 06:20:58,078 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-08 06:20:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 8186 transitions. [2025-03-08 06:20:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:20:58,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:58,084 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-08 06:20:58,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:20:58,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:20:58,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash 426788737, now seen corresponding path program 1 times [2025-03-08 06:20:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:58,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193367809] [2025-03-08 06:20:58,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:58,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:58,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:20:58,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:20:58,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:58,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:58,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:58,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193367809] [2025-03-08 06:20:58,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193367809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:58,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:58,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:58,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230465202] [2025-03-08 06:20:58,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:58,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:58,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:58,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:58,191 INFO L87 Difference]: Start difference. First operand 5680 states and 8186 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-08 06:20:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:58,257 INFO L93 Difference]: Finished difference Result 11936 states and 17377 transitions. [2025-03-08 06:20:58,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:58,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-08 06:20:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:58,279 INFO L225 Difference]: With dead ends: 11936 [2025-03-08 06:20:58,280 INFO L226 Difference]: Without dead ends: 8016 [2025-03-08 06:20:58,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:58,287 INFO L435 NwaCegarLoop]: 1762 mSDtfsCounter, 1094 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 2702 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-08 06:20:58,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 2702 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:20:58,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8016 states. [2025-03-08 06:20:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8016 to 7990. [2025-03-08 06:20:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7990 states, 7984 states have (on average 1.4279809619238477) internal successors, (11401), 7989 states have internal predecessors, (11401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7990 states to 7990 states and 11401 transitions. [2025-03-08 06:20:58,467 INFO L78 Accepts]: Start accepts. Automaton has 7990 states and 11401 transitions. Word has length 77 [2025-03-08 06:20:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:58,467 INFO L471 AbstractCegarLoop]: Abstraction has 7990 states and 11401 transitions. [2025-03-08 06:20:58,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-08 06:20:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 7990 states and 11401 transitions. [2025-03-08 06:20:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:20:58,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:58,474 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-08 06:20:58,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:20:58,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:20:58,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:58,475 INFO L85 PathProgramCache]: Analyzing trace with hash 935565855, now seen corresponding path program 1 times [2025-03-08 06:20:58,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:58,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781284656] [2025-03-08 06:20:58,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:58,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:58,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:20:58,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:20:58,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:58,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:58,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781284656] [2025-03-08 06:20:58,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781284656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:58,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:58,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:20:58,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993666874] [2025-03-08 06:20:58,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:58,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:20:58,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:58,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:20:58,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:58,563 INFO L87 Difference]: Start difference. First operand 7990 states and 11401 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-08 06:20:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:58,626 INFO L93 Difference]: Finished difference Result 16754 states and 24121 transitions. [2025-03-08 06:20:58,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:20:58,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-08 06:20:58,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:58,647 INFO L225 Difference]: With dead ends: 16754 [2025-03-08 06:20:58,648 INFO L226 Difference]: Without dead ends: 11163 [2025-03-08 06:20:58,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:20:58,658 INFO L435 NwaCegarLoop]: 1779 mSDtfsCounter, 1112 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 2714 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-08 06:20:58,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 2714 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:20:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11163 states. [2025-03-08 06:20:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11163 to 11129. [2025-03-08 06:20:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11129 states, 11123 states have (on average 1.4129281668614582) internal successors, (15716), 11128 states have internal predecessors, (15716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:58,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11129 states to 11129 states and 15716 transitions. [2025-03-08 06:20:58,828 INFO L78 Accepts]: Start accepts. Automaton has 11129 states and 15716 transitions. Word has length 77 [2025-03-08 06:20:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:58,828 INFO L471 AbstractCegarLoop]: Abstraction has 11129 states and 15716 transitions. [2025-03-08 06:20:58,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-08 06:20:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 11129 states and 15716 transitions. [2025-03-08 06:20:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:20:58,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:58,837 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-08 06:20:58,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:20:58,838 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-08 06:20:58,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:58,838 INFO L85 PathProgramCache]: Analyzing trace with hash 71369299, now seen corresponding path program 1 times [2025-03-08 06:20:58,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:58,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683757187] [2025-03-08 06:20:58,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:58,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:58,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:20:58,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:20:58,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:58,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:20:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:20:58,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:20:58,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683757187] [2025-03-08 06:20:58,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683757187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:20:58,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:20:58,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:20:58,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492161665] [2025-03-08 06:20:58,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:20:58,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:20:58,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:20:58,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:20:58,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:20:58,999 INFO L87 Difference]: Start difference. First operand 11129 states and 15716 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-08 06:20:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:20:59,613 INFO L93 Difference]: Finished difference Result 24320 states and 34641 transitions. [2025-03-08 06:20:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:20:59,613 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-08 06:20:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:20:59,638 INFO L225 Difference]: With dead ends: 24320 [2025-03-08 06:20:59,638 INFO L226 Difference]: Without dead ends: 14157 [2025-03-08 06:20:59,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:20:59,651 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 3965 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3965 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:20:59,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3965 Valid, 861 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:20:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2025-03-08 06:20:59,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 14111. [2025-03-08 06:20:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14111 states, 14105 states have (on average 1.4162353775257002) internal successors, (19976), 14110 states have internal predecessors, (19976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:20:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14111 states to 14111 states and 19976 transitions. [2025-03-08 06:20:59,846 INFO L78 Accepts]: Start accepts. Automaton has 14111 states and 19976 transitions. Word has length 77 [2025-03-08 06:20:59,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:20:59,847 INFO L471 AbstractCegarLoop]: Abstraction has 14111 states and 19976 transitions. [2025-03-08 06:20:59,847 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-08 06:20:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 14111 states and 19976 transitions. [2025-03-08 06:20:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:20:59,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:20:59,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:20:59,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:20:59,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:20:59,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:20:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash -943144956, now seen corresponding path program 1 times [2025-03-08 06:20:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:20:59,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354399972] [2025-03-08 06:20:59,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:20:59,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:20:59,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:20:59,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:20:59,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:20:59,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:00,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:00,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354399972] [2025-03-08 06:21:00,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354399972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:00,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:00,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:21:00,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793401303] [2025-03-08 06:21:00,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:00,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:00,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:00,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:00,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:00,078 INFO L87 Difference]: Start difference. First operand 14111 states and 19976 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 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-08 06:21:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:01,016 INFO L93 Difference]: Finished difference Result 29931 states and 42980 transitions. [2025-03-08 06:21:01,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:21:01,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 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-08 06:21:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:01,061 INFO L225 Difference]: With dead ends: 29931 [2025-03-08 06:21:01,061 INFO L226 Difference]: Without dead ends: 25587 [2025-03-08 06:21:01,073 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-08 06:21:01,076 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 5181 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:01,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 1757 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:21:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25587 states. [2025-03-08 06:21:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25587 to 14159. [2025-03-08 06:21:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14159 states, 14153 states have (on average 1.4159542146541368) internal successors, (20040), 14158 states have internal predecessors, (20040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14159 states to 14159 states and 20040 transitions. [2025-03-08 06:21:01,397 INFO L78 Accepts]: Start accepts. Automaton has 14159 states and 20040 transitions. Word has length 78 [2025-03-08 06:21:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:01,398 INFO L471 AbstractCegarLoop]: Abstraction has 14159 states and 20040 transitions. [2025-03-08 06:21:01,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 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-08 06:21:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 14159 states and 20040 transitions. [2025-03-08 06:21:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:21:01,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:01,409 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-08 06:21:01,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:21:01,409 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:21:01,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:01,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1372865421, now seen corresponding path program 1 times [2025-03-08 06:21:01,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552892641] [2025-03-08 06:21:01,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:01,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:21:01,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:21:01,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:01,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:01,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:01,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552892641] [2025-03-08 06:21:01,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552892641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:01,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:01,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:21:01,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572342938] [2025-03-08 06:21:01,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:01,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:01,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:01,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:01,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:01,609 INFO L87 Difference]: Start difference. First operand 14159 states and 20040 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 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-08 06:21:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:02,403 INFO L93 Difference]: Finished difference Result 34907 states and 50277 transitions. [2025-03-08 06:21:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:21:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 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-08 06:21:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:02,446 INFO L225 Difference]: With dead ends: 34907 [2025-03-08 06:21:02,446 INFO L226 Difference]: Without dead ends: 29287 [2025-03-08 06:21:02,459 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-08 06:21:02,459 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 5081 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5081 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:02,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5081 Valid, 1726 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:21:02,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29287 states. [2025-03-08 06:21:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29287 to 14339. [2025-03-08 06:21:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14339 states, 14333 states have (on average 1.4149166259680457) internal successors, (20280), 14338 states have internal predecessors, (20280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14339 states to 14339 states and 20280 transitions. [2025-03-08 06:21:02,784 INFO L78 Accepts]: Start accepts. Automaton has 14339 states and 20280 transitions. Word has length 78 [2025-03-08 06:21:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:02,784 INFO L471 AbstractCegarLoop]: Abstraction has 14339 states and 20280 transitions. [2025-03-08 06:21:02,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 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-08 06:21:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 14339 states and 20280 transitions. [2025-03-08 06:21:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:21:02,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:02,794 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-08 06:21:02,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:21:02,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:21:02,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1907352661, now seen corresponding path program 1 times [2025-03-08 06:21:02,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:02,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906342591] [2025-03-08 06:21:02,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:02,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:02,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:21:02,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:21:02,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:02,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:02,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:02,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906342591] [2025-03-08 06:21:02,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906342591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:02,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:02,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:21:02,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336035930] [2025-03-08 06:21:02,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:02,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:02,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:02,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:02,951 INFO L87 Difference]: Start difference. First operand 14339 states and 20280 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 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-08 06:21:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:03,806 INFO L93 Difference]: Finished difference Result 32593 states and 46876 transitions. [2025-03-08 06:21:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:21:03,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 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-08 06:21:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:03,848 INFO L225 Difference]: With dead ends: 32593 [2025-03-08 06:21:03,848 INFO L226 Difference]: Without dead ends: 27259 [2025-03-08 06:21:03,860 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-08 06:21:03,860 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 5036 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5036 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:03,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5036 Valid, 1701 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:21:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27259 states. [2025-03-08 06:21:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27259 to 14639. [2025-03-08 06:21:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14639 states, 14633 states have (on average 1.413517392195722) internal successors, (20684), 14638 states have internal predecessors, (20684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14639 states to 14639 states and 20684 transitions. [2025-03-08 06:21:04,241 INFO L78 Accepts]: Start accepts. Automaton has 14639 states and 20684 transitions. Word has length 78 [2025-03-08 06:21:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:04,241 INFO L471 AbstractCegarLoop]: Abstraction has 14639 states and 20684 transitions. [2025-03-08 06:21:04,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 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-08 06:21:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 14639 states and 20684 transitions. [2025-03-08 06:21:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:21:04,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:04,251 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-08 06:21:04,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:21:04,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:21:04,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:04,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1068106501, now seen corresponding path program 1 times [2025-03-08 06:21:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:04,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525002772] [2025-03-08 06:21:04,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:04,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:04,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:21:04,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:21:04,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:04,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:04,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:04,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525002772] [2025-03-08 06:21:04,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525002772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:04,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:04,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:21:04,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203677149] [2025-03-08 06:21:04,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:04,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:21:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:04,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:21:04,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:21:04,368 INFO L87 Difference]: Start difference. First operand 14639 states and 20684 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 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-08 06:21:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:04,904 INFO L93 Difference]: Finished difference Result 33517 states and 47578 transitions. [2025-03-08 06:21:04,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:21:04,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 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-08 06:21:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:04,927 INFO L225 Difference]: With dead ends: 33517 [2025-03-08 06:21:04,928 INFO L226 Difference]: Without dead ends: 19749 [2025-03-08 06:21:04,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:04,943 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 4144 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4144 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:04,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4144 Valid, 912 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:21:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19749 states. [2025-03-08 06:21:05,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19749 to 14639. [2025-03-08 06:21:05,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14639 states, 14633 states have (on average 1.4097587644365475) internal successors, (20629), 14638 states have internal predecessors, (20629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14639 states to 14639 states and 20629 transitions. [2025-03-08 06:21:05,265 INFO L78 Accepts]: Start accepts. Automaton has 14639 states and 20629 transitions. Word has length 79 [2025-03-08 06:21:05,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:05,265 INFO L471 AbstractCegarLoop]: Abstraction has 14639 states and 20629 transitions. [2025-03-08 06:21:05,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 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-08 06:21:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 14639 states and 20629 transitions. [2025-03-08 06:21:05,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:21:05,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:05,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] [2025-03-08 06:21:05,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:21:05,278 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:21:05,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:05,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1182902264, now seen corresponding path program 1 times [2025-03-08 06:21:05,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:05,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422549922] [2025-03-08 06:21:05,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:05,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:05,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:21:05,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:21:05,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:05,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:05,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:05,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422549922] [2025-03-08 06:21:05,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422549922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:05,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:05,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:21:05,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412724541] [2025-03-08 06:21:05,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:05,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:21:05,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:05,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:21:05,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:21:05,604 INFO L87 Difference]: Start difference. First operand 14639 states and 20629 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-08 06:21:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:05,652 INFO L93 Difference]: Finished difference Result 14639 states and 20629 transitions. [2025-03-08 06:21:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:21:05,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-08 06:21:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:05,671 INFO L225 Difference]: With dead ends: 14639 [2025-03-08 06:21:05,672 INFO L226 Difference]: Without dead ends: 14637 [2025-03-08 06:21:05,677 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-08 06:21:05,678 INFO L435 NwaCegarLoop]: 1175 mSDtfsCounter, 0 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3521 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:05,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3521 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14637 states. [2025-03-08 06:21:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14637 to 14637. [2025-03-08 06:21:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14637 states, 14632 states have (on average 1.4073264078731547) internal successors, (20592), 14636 states have internal predecessors, (20592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14637 states to 14637 states and 20592 transitions. [2025-03-08 06:21:05,894 INFO L78 Accepts]: Start accepts. Automaton has 14637 states and 20592 transitions. Word has length 79 [2025-03-08 06:21:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:05,894 INFO L471 AbstractCegarLoop]: Abstraction has 14637 states and 20592 transitions. [2025-03-08 06:21:05,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-08 06:21:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 14637 states and 20592 transitions. [2025-03-08 06:21:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:21:05,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:05,904 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-08 06:21:05,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:21:05,904 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:21:05,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:05,905 INFO L85 PathProgramCache]: Analyzing trace with hash -411262655, now seen corresponding path program 1 times [2025-03-08 06:21:05,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:05,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13895068] [2025-03-08 06:21:05,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:05,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:05,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:21:05,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:21:05,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:05,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:06,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:06,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13895068] [2025-03-08 06:21:06,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13895068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:06,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:06,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:21:06,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011777234] [2025-03-08 06:21:06,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:06,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:21:06,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:06,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:21:06,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:21:06,132 INFO L87 Difference]: Start difference. First operand 14637 states and 20592 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-08 06:21:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:06,220 INFO L93 Difference]: Finished difference Result 14637 states and 20592 transitions. [2025-03-08 06:21:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:21:06,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-08 06:21:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:06,235 INFO L225 Difference]: With dead ends: 14637 [2025-03-08 06:21:06,236 INFO L226 Difference]: Without dead ends: 14635 [2025-03-08 06:21:06,237 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-08 06:21:06,238 INFO L435 NwaCegarLoop]: 1173 mSDtfsCounter, 0 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:06,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3515 Invalid, 8 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:06,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14635 states. [2025-03-08 06:21:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14635 to 14635. [2025-03-08 06:21:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14635 states, 14631 states have (on average 1.404893718816212) internal successors, (20555), 14634 states have internal predecessors, (20555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14635 states to 14635 states and 20555 transitions. [2025-03-08 06:21:06,368 INFO L78 Accepts]: Start accepts. Automaton has 14635 states and 20555 transitions. Word has length 79 [2025-03-08 06:21:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:06,369 INFO L471 AbstractCegarLoop]: Abstraction has 14635 states and 20555 transitions. [2025-03-08 06:21:06,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-08 06:21:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 14635 states and 20555 transitions. [2025-03-08 06:21:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:21:06,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:06,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:06,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:21:06,377 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:21:06,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:06,378 INFO L85 PathProgramCache]: Analyzing trace with hash -47349220, now seen corresponding path program 1 times [2025-03-08 06:21:06,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:06,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603013304] [2025-03-08 06:21:06,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:06,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:06,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:21:06,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:21:06,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:06,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:06,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:06,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603013304] [2025-03-08 06:21:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603013304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:06,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:06,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:21:06,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385651539] [2025-03-08 06:21:06,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:06,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:21:06,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:06,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:21:06,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:21:06,466 INFO L87 Difference]: Start difference. First operand 14635 states and 20555 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 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-08 06:21:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:07,028 INFO L93 Difference]: Finished difference Result 32708 states and 45968 transitions. [2025-03-08 06:21:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:21:07,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 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-08 06:21:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:07,050 INFO L225 Difference]: With dead ends: 32708 [2025-03-08 06:21:07,051 INFO L226 Difference]: Without dead ends: 18877 [2025-03-08 06:21:07,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:07,066 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 3591 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3591 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:07,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3591 Valid, 770 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:21:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18877 states. [2025-03-08 06:21:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18877 to 18817. [2025-03-08 06:21:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18817 states, 18813 states have (on average 1.3933450273746877) internal successors, (26213), 18816 states have internal predecessors, (26213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18817 states to 18817 states and 26213 transitions. [2025-03-08 06:21:07,260 INFO L78 Accepts]: Start accepts. Automaton has 18817 states and 26213 transitions. Word has length 79 [2025-03-08 06:21:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:07,261 INFO L471 AbstractCegarLoop]: Abstraction has 18817 states and 26213 transitions. [2025-03-08 06:21:07,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 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-08 06:21:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 18817 states and 26213 transitions. [2025-03-08 06:21:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:21:07,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:07,268 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-08 06:21:07,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:21:07,268 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:21:07,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:07,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1097788848, now seen corresponding path program 1 times [2025-03-08 06:21:07,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:07,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241498902] [2025-03-08 06:21:07,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:07,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:07,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:21:07,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:21:07,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:07,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:07,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:07,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241498902] [2025-03-08 06:21:07,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241498902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:07,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:07,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:21:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508352520] [2025-03-08 06:21:07,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:07,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:07,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:07,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:07,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:07,402 INFO L87 Difference]: Start difference. First operand 18817 states and 26213 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 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-08 06:21:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:08,192 INFO L93 Difference]: Finished difference Result 38743 states and 54534 transitions. [2025-03-08 06:21:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:21:08,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 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-08 06:21:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:08,224 INFO L225 Difference]: With dead ends: 38743 [2025-03-08 06:21:08,225 INFO L226 Difference]: Without dead ends: 29601 [2025-03-08 06:21:08,238 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-08 06:21:08,239 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 4574 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:08,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 1593 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:21:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29601 states. [2025-03-08 06:21:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29601 to 18901. [2025-03-08 06:21:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18901 states, 18897 states have (on average 1.392866592580833) internal successors, (26321), 18900 states have internal predecessors, (26321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18901 states to 18901 states and 26321 transitions. [2025-03-08 06:21:08,507 INFO L78 Accepts]: Start accepts. Automaton has 18901 states and 26321 transitions. Word has length 80 [2025-03-08 06:21:08,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:08,507 INFO L471 AbstractCegarLoop]: Abstraction has 18901 states and 26321 transitions. [2025-03-08 06:21:08,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 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-08 06:21:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 18901 states and 26321 transitions. [2025-03-08 06:21:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:21:08,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:08,515 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-08 06:21:08,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:21:08,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:21:08,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1238061003, now seen corresponding path program 1 times [2025-03-08 06:21:08,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:08,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679228100] [2025-03-08 06:21:08,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:08,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:08,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:21:08,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:21:08,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:08,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:08,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:08,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679228100] [2025-03-08 06:21:08,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679228100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:08,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:08,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:21:08,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279104546] [2025-03-08 06:21:08,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:08,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:08,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:08,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:08,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:08,673 INFO L87 Difference]: Start difference. First operand 18901 states and 26321 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 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-08 06:21:09,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:09,742 INFO L93 Difference]: Finished difference Result 42060 states and 59372 transitions. [2025-03-08 06:21:09,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:21:09,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 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-08 06:21:09,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:09,769 INFO L225 Difference]: With dead ends: 42060 [2025-03-08 06:21:09,769 INFO L226 Difference]: Without dead ends: 34586 [2025-03-08 06:21:09,774 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-08 06:21:09,775 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 4771 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4771 SdHoareTripleChecker+Valid, 1673 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.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:09,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4771 Valid, 1673 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:21:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34586 states. [2025-03-08 06:21:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34586 to 19408. [2025-03-08 06:21:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19408 states, 19404 states have (on average 1.3918264275407133) internal successors, (27007), 19407 states have internal predecessors, (27007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19408 states to 19408 states and 27007 transitions. [2025-03-08 06:21:10,043 INFO L78 Accepts]: Start accepts. Automaton has 19408 states and 27007 transitions. Word has length 80 [2025-03-08 06:21:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:10,043 INFO L471 AbstractCegarLoop]: Abstraction has 19408 states and 27007 transitions. [2025-03-08 06:21:10,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 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-08 06:21:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 19408 states and 27007 transitions. [2025-03-08 06:21:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:21:10,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:10,050 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-08 06:21:10,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:21:10,050 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:21:10,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:10,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1078514170, now seen corresponding path program 1 times [2025-03-08 06:21:10,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:10,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060331422] [2025-03-08 06:21:10,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:10,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:10,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:21:10,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:21:10,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:10,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:10,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:10,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060331422] [2025-03-08 06:21:10,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060331422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:10,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:21:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264687898] [2025-03-08 06:21:10,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:10,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:21:10,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:10,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:21:10,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:21:10,243 INFO L87 Difference]: Start difference. First operand 19408 states and 27007 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-08 06:21:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:10,289 INFO L93 Difference]: Finished difference Result 19408 states and 27007 transitions. [2025-03-08 06:21:10,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:21:10,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-08 06:21:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:10,309 INFO L225 Difference]: With dead ends: 19408 [2025-03-08 06:21:10,309 INFO L226 Difference]: Without dead ends: 19406 [2025-03-08 06:21:10,316 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-08 06:21:10,317 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 0 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:10,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3362 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:10,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19406 states. [2025-03-08 06:21:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19406 to 19406. [2025-03-08 06:21:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19406 states, 19403 states have (on average 1.3890635468741948) internal successors, (26952), 19405 states have internal predecessors, (26952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19406 states to 19406 states and 26952 transitions. [2025-03-08 06:21:10,617 INFO L78 Accepts]: Start accepts. Automaton has 19406 states and 26952 transitions. Word has length 81 [2025-03-08 06:21:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:10,618 INFO L471 AbstractCegarLoop]: Abstraction has 19406 states and 26952 transitions. [2025-03-08 06:21:10,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-08 06:21:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 19406 states and 26952 transitions. [2025-03-08 06:21:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:21:10,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:10,628 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-08 06:21:10,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:21:10,629 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-08 06:21:10,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:10,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1435717695, now seen corresponding path program 1 times [2025-03-08 06:21:10,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:10,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627879106] [2025-03-08 06:21:10,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:10,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:10,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:21:10,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:21:10,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:10,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627879106] [2025-03-08 06:21:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627879106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:10,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:10,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:21:10,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623084222] [2025-03-08 06:21:10,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:10,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:21:10,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:10,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:21:10,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:21:10,878 INFO L87 Difference]: Start difference. First operand 19406 states and 26952 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-08 06:21:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:10,933 INFO L93 Difference]: Finished difference Result 19406 states and 26952 transitions. [2025-03-08 06:21:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:21:10,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-08 06:21:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:10,954 INFO L225 Difference]: With dead ends: 19406 [2025-03-08 06:21:10,954 INFO L226 Difference]: Without dead ends: 19404 [2025-03-08 06:21:10,961 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-08 06:21:10,962 INFO L435 NwaCegarLoop]: 1120 mSDtfsCounter, 0 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3356 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:10,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3356 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19404 states. [2025-03-08 06:21:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19404 to 19404. [2025-03-08 06:21:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19404 states, 19402 states have (on average 1.386300381403979) internal successors, (26897), 19403 states have internal predecessors, (26897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19404 states to 19404 states and 26897 transitions. [2025-03-08 06:21:11,219 INFO L78 Accepts]: Start accepts. Automaton has 19404 states and 26897 transitions. Word has length 81 [2025-03-08 06:21:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:11,219 INFO L471 AbstractCegarLoop]: Abstraction has 19404 states and 26897 transitions. [2025-03-08 06:21:11,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-08 06:21:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 19404 states and 26897 transitions. [2025-03-08 06:21:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 06:21:11,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:11,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:11,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:21:11,230 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-08 06:21:11,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1981113873, now seen corresponding path program 1 times [2025-03-08 06:21:11,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:11,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019161338] [2025-03-08 06:21:11,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:11,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 06:21:11,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 06:21:11,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:11,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:11,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:11,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019161338] [2025-03-08 06:21:11,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019161338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:11,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:11,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:21:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744427935] [2025-03-08 06:21:11,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:11,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:21:11,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:11,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:21:11,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:21:11,448 INFO L87 Difference]: Start difference. First operand 19404 states and 26897 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:11,491 INFO L93 Difference]: Finished difference Result 19404 states and 26897 transitions. [2025-03-08 06:21:11,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:21:11,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-08 06:21:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:11,509 INFO L225 Difference]: With dead ends: 19404 [2025-03-08 06:21:11,509 INFO L226 Difference]: Without dead ends: 19402 [2025-03-08 06:21:11,515 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-08 06:21:11,516 INFO L435 NwaCegarLoop]: 1118 mSDtfsCounter, 0 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:11,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3350 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19402 states. [2025-03-08 06:21:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19402 to 19402. [2025-03-08 06:21:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19402 states, 19401 states have (on average 1.3821452502448328) internal successors, (26815), 19401 states have internal predecessors, (26815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19402 states to 19402 states and 26815 transitions. [2025-03-08 06:21:11,693 INFO L78 Accepts]: Start accepts. Automaton has 19402 states and 26815 transitions. Word has length 83 [2025-03-08 06:21:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:11,693 INFO L471 AbstractCegarLoop]: Abstraction has 19402 states and 26815 transitions. [2025-03-08 06:21:11,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 19402 states and 26815 transitions. [2025-03-08 06:21:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 06:21:11,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:11,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:11,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:21:11,702 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-08 06:21:11,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1015337039, now seen corresponding path program 1 times [2025-03-08 06:21:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:11,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560769660] [2025-03-08 06:21:11,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:11,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:11,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 06:21:11,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 06:21:11,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:11,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:11,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:11,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560769660] [2025-03-08 06:21:11,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560769660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:11,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:11,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:21:11,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839244155] [2025-03-08 06:21:11,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:11,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:21:11,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:11,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:21:11,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:21:11,941 INFO L87 Difference]: Start difference. First operand 19402 states and 26815 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:13,003 INFO L93 Difference]: Finished difference Result 46593 states and 65832 transitions. [2025-03-08 06:21:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:21:13,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-08 06:21:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:13,041 INFO L225 Difference]: With dead ends: 46593 [2025-03-08 06:21:13,041 INFO L226 Difference]: Without dead ends: 35737 [2025-03-08 06:21:13,058 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-08 06:21:13,058 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 5139 mSDsluCounter, 2266 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5139 SdHoareTripleChecker+Valid, 2976 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:13,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5139 Valid, 2976 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:21:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35737 states. [2025-03-08 06:21:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35737 to 19402. [2025-03-08 06:21:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19402 states, 19401 states have (on average 1.3815267254265244) internal successors, (26803), 19401 states have internal predecessors, (26803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19402 states to 19402 states and 26803 transitions. [2025-03-08 06:21:13,379 INFO L78 Accepts]: Start accepts. Automaton has 19402 states and 26803 transitions. Word has length 83 [2025-03-08 06:21:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:13,379 INFO L471 AbstractCegarLoop]: Abstraction has 19402 states and 26803 transitions. [2025-03-08 06:21:13,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 19402 states and 26803 transitions. [2025-03-08 06:21:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 06:21:13,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:13,388 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-08 06:21:13,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:21:13,388 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-08 06:21:13,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1923607275, now seen corresponding path program 1 times [2025-03-08 06:21:13,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:13,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465374419] [2025-03-08 06:21:13,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:13,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:13,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 06:21:13,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 06:21:13,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:13,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:13,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465374419] [2025-03-08 06:21:13,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465374419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:13,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:13,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:21:13,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966757867] [2025-03-08 06:21:13,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:13,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:21:13,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:13,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:21:13,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:21:13,609 INFO L87 Difference]: Start difference. First operand 19402 states and 26803 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 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-08 06:21:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:14,473 INFO L93 Difference]: Finished difference Result 47246 states and 66759 transitions. [2025-03-08 06:21:14,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:21:14,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 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-08 06:21:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:14,510 INFO L225 Difference]: With dead ends: 47246 [2025-03-08 06:21:14,510 INFO L226 Difference]: Without dead ends: 36322 [2025-03-08 06:21:14,528 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-08 06:21:14,533 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 5133 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5133 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:14,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5133 Valid, 2892 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2046 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:21:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36322 states. [2025-03-08 06:21:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36322 to 19368. [2025-03-08 06:21:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19368 states, 19367 states have (on average 1.3812671038364228) internal successors, (26751), 19367 states have internal predecessors, (26751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19368 states to 19368 states and 26751 transitions. [2025-03-08 06:21:14,897 INFO L78 Accepts]: Start accepts. Automaton has 19368 states and 26751 transitions. Word has length 84 [2025-03-08 06:21:14,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:14,897 INFO L471 AbstractCegarLoop]: Abstraction has 19368 states and 26751 transitions. [2025-03-08 06:21:14,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 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-08 06:21:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand 19368 states and 26751 transitions. [2025-03-08 06:21:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 06:21:14,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:14,905 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-08 06:21:14,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:21:14,905 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-08 06:21:14,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:14,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1249067849, now seen corresponding path program 1 times [2025-03-08 06:21:14,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:14,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864393410] [2025-03-08 06:21:14,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:14,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:14,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 06:21:14,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 06:21:14,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:14,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:14,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:14,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864393410] [2025-03-08 06:21:14,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864393410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:14,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:14,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:21:14,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759011471] [2025-03-08 06:21:14,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:14,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:14,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:14,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:14,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:14,999 INFO L87 Difference]: Start difference. First operand 19368 states and 26751 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 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-08 06:21:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:15,705 INFO L93 Difference]: Finished difference Result 45284 states and 63920 transitions. [2025-03-08 06:21:15,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:21:15,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 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-08 06:21:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:15,745 INFO L225 Difference]: With dead ends: 45284 [2025-03-08 06:21:15,745 INFO L226 Difference]: Without dead ends: 37936 [2025-03-08 06:21:15,761 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-08 06:21:15,762 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 4791 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4791 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:15,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4791 Valid, 1681 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:21:15,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37936 states. [2025-03-08 06:21:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37936 to 19428. [2025-03-08 06:21:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19428 states, 19427 states have (on average 1.3811190611005302) internal successors, (26831), 19427 states have internal predecessors, (26831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19428 states to 19428 states and 26831 transitions. [2025-03-08 06:21:16,043 INFO L78 Accepts]: Start accepts. Automaton has 19428 states and 26831 transitions. Word has length 84 [2025-03-08 06:21:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:16,043 INFO L471 AbstractCegarLoop]: Abstraction has 19428 states and 26831 transitions. [2025-03-08 06:21:16,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 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-08 06:21:16,043 INFO L276 IsEmpty]: Start isEmpty. Operand 19428 states and 26831 transitions. [2025-03-08 06:21:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 06:21:16,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:16,052 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-08 06:21:16,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:21:16,052 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-08 06:21:16,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:16,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1225895241, now seen corresponding path program 1 times [2025-03-08 06:21:16,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:16,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176767504] [2025-03-08 06:21:16,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:16,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:16,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 06:21:16,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 06:21:16,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:16,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:16,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176767504] [2025-03-08 06:21:16,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176767504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:16,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:16,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:21:16,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505403519] [2025-03-08 06:21:16,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:16,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:16,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:16,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:16,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:16,145 INFO L87 Difference]: Start difference. First operand 19428 states and 26831 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 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-08 06:21:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:16,888 INFO L93 Difference]: Finished difference Result 41854 states and 58883 transitions. [2025-03-08 06:21:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:21:16,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 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-08 06:21:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:16,921 INFO L225 Difference]: With dead ends: 41854 [2025-03-08 06:21:16,921 INFO L226 Difference]: Without dead ends: 34598 [2025-03-08 06:21:16,932 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-08 06:21:16,933 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 4732 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4732 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:16,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4732 Valid, 1661 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:21:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34598 states. [2025-03-08 06:21:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34598 to 19518. [2025-03-08 06:21:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19518 states, 19517 states have (on average 1.3808987036942153) internal successors, (26951), 19517 states have internal predecessors, (26951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19518 states to 19518 states and 26951 transitions. [2025-03-08 06:21:17,197 INFO L78 Accepts]: Start accepts. Automaton has 19518 states and 26951 transitions. Word has length 84 [2025-03-08 06:21:17,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:17,197 INFO L471 AbstractCegarLoop]: Abstraction has 19518 states and 26951 transitions. [2025-03-08 06:21:17,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 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-08 06:21:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 19518 states and 26951 transitions. [2025-03-08 06:21:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 06:21:17,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:17,206 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-08 06:21:17,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:21:17,206 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-08 06:21:17,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash 340470656, now seen corresponding path program 1 times [2025-03-08 06:21:17,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:17,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520548363] [2025-03-08 06:21:17,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:17,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:17,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 06:21:17,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 06:21:17,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:17,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:18,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:18,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520548363] [2025-03-08 06:21:18,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520548363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:18,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:18,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:21:18,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842562239] [2025-03-08 06:21:18,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:18,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:21:18,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:18,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:21:18,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:21:18,044 INFO L87 Difference]: Start difference. First operand 19518 states and 26951 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 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-08 06:21:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:19,127 INFO L93 Difference]: Finished difference Result 63277 states and 89874 transitions. [2025-03-08 06:21:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 06:21:19,128 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 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-08 06:21:19,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:19,181 INFO L225 Difference]: With dead ends: 63277 [2025-03-08 06:21:19,182 INFO L226 Difference]: Without dead ends: 51737 [2025-03-08 06:21:19,196 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-08 06:21:19,196 INFO L435 NwaCegarLoop]: 995 mSDtfsCounter, 5992 mSDsluCounter, 5711 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5992 SdHoareTripleChecker+Valid, 6706 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:19,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5992 Valid, 6706 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:21:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51737 states. [2025-03-08 06:21:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51737 to 18814. [2025-03-08 06:21:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18814 states, 18813 states have (on average 1.3830330090894594) internal successors, (26019), 18813 states have internal predecessors, (26019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18814 states to 18814 states and 26019 transitions. [2025-03-08 06:21:19,539 INFO L78 Accepts]: Start accepts. Automaton has 18814 states and 26019 transitions. Word has length 84 [2025-03-08 06:21:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:19,539 INFO L471 AbstractCegarLoop]: Abstraction has 18814 states and 26019 transitions. [2025-03-08 06:21:19,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 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-08 06:21:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 18814 states and 26019 transitions. [2025-03-08 06:21:19,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 06:21:19,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:19,547 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-08 06:21:19,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:21:19,547 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-08 06:21:19,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1856393175, now seen corresponding path program 1 times [2025-03-08 06:21:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:19,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888389748] [2025-03-08 06:21:19,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:19,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:19,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 06:21:19,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 06:21:19,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:19,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:19,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:19,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888389748] [2025-03-08 06:21:19,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888389748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:19,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:19,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:21:19,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125663601] [2025-03-08 06:21:19,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:19,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:21:19,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:19,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:21:19,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:21:19,732 INFO L87 Difference]: Start difference. First operand 18814 states and 26019 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 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-08 06:21:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:20,907 INFO L93 Difference]: Finished difference Result 30950 states and 43091 transitions. [2025-03-08 06:21:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:21:20,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 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-08 06:21:20,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:20,934 INFO L225 Difference]: With dead ends: 30950 [2025-03-08 06:21:20,934 INFO L226 Difference]: Without dead ends: 27141 [2025-03-08 06:21:20,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:21:20,944 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 3550 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 2627 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3550 SdHoareTripleChecker+Valid, 3047 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:20,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3550 Valid, 3047 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2627 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:21:20,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27141 states. [2025-03-08 06:21:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27141 to 18818. [2025-03-08 06:21:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18818 states, 18817 states have (on average 1.38289844289738) internal successors, (26022), 18817 states have internal predecessors, (26022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18818 states to 18818 states and 26022 transitions. [2025-03-08 06:21:21,257 INFO L78 Accepts]: Start accepts. Automaton has 18818 states and 26022 transitions. Word has length 84 [2025-03-08 06:21:21,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:21,257 INFO L471 AbstractCegarLoop]: Abstraction has 18818 states and 26022 transitions. [2025-03-08 06:21:21,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 9 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-08 06:21:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 18818 states and 26022 transitions. [2025-03-08 06:21:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 06:21:21,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:21,266 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-08 06:21:21,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:21:21,266 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-08 06:21:21,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1067325022, now seen corresponding path program 1 times [2025-03-08 06:21:21,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:21,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241556422] [2025-03-08 06:21:21,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:21,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:21,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 06:21:21,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 06:21:21,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:21,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:22,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241556422] [2025-03-08 06:21:22,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241556422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:22,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:22,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 06:21:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74371867] [2025-03-08 06:21:22,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:22,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:21:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:22,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:21:22,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:21:22,002 INFO L87 Difference]: Start difference. First operand 18818 states and 26022 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 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-08 06:21:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:23,151 INFO L93 Difference]: Finished difference Result 67844 states and 96427 transitions. [2025-03-08 06:21:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 06:21:23,151 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 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-08 06:21:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:23,227 INFO L225 Difference]: With dead ends: 67844 [2025-03-08 06:21:23,227 INFO L226 Difference]: Without dead ends: 56078 [2025-03-08 06:21:23,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:21:23,254 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 7768 mSDsluCounter, 6288 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7768 SdHoareTripleChecker+Valid, 7219 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:23,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7768 Valid, 7219 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:21:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56078 states. [2025-03-08 06:21:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56078 to 17896. [2025-03-08 06:21:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17896 states, 17895 states have (on average 1.385526683431126) internal successors, (24794), 17895 states have internal predecessors, (24794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17896 states to 17896 states and 24794 transitions. [2025-03-08 06:21:23,754 INFO L78 Accepts]: Start accepts. Automaton has 17896 states and 24794 transitions. Word has length 85 [2025-03-08 06:21:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:23,754 INFO L471 AbstractCegarLoop]: Abstraction has 17896 states and 24794 transitions. [2025-03-08 06:21:23,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 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-08 06:21:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 17896 states and 24794 transitions. [2025-03-08 06:21:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 06:21:23,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:23,762 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-08 06:21:23,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:21:23,762 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-08 06:21:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1446132019, now seen corresponding path program 1 times [2025-03-08 06:21:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822335116] [2025-03-08 06:21:23,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:23,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:23,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 06:21:23,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 06:21:23,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:23,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:23,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:23,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822335116] [2025-03-08 06:21:23,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822335116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:23,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:23,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:21:23,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103658178] [2025-03-08 06:21:23,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:23,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:23,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:23,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:23,862 INFO L87 Difference]: Start difference. First operand 17896 states and 24794 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-08 06:21:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:24,501 INFO L93 Difference]: Finished difference Result 40152 states and 56652 transitions. [2025-03-08 06:21:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:21:24,501 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-08 06:21:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:24,532 INFO L225 Difference]: With dead ends: 40152 [2025-03-08 06:21:24,532 INFO L226 Difference]: Without dead ends: 32860 [2025-03-08 06:21:24,546 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-08 06:21:24,546 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 4205 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4205 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:24,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4205 Valid, 1533 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:21:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32860 states. [2025-03-08 06:21:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32860 to 18091. [2025-03-08 06:21:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18091 states, 18090 states have (on average 1.3852404643449419) internal successors, (25059), 18090 states have internal predecessors, (25059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18091 states to 18091 states and 25059 transitions. [2025-03-08 06:21:24,860 INFO L78 Accepts]: Start accepts. Automaton has 18091 states and 25059 transitions. Word has length 85 [2025-03-08 06:21:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:24,860 INFO L471 AbstractCegarLoop]: Abstraction has 18091 states and 25059 transitions. [2025-03-08 06:21:24,860 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-08 06:21:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 18091 states and 25059 transitions. [2025-03-08 06:21:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 06:21:24,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:24,869 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-08 06:21:24,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:21:24,869 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-08 06:21:24,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:24,870 INFO L85 PathProgramCache]: Analyzing trace with hash -452637678, now seen corresponding path program 1 times [2025-03-08 06:21:24,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:24,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799939998] [2025-03-08 06:21:24,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:24,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 06:21:24,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 06:21:24,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:24,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:25,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799939998] [2025-03-08 06:21:25,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799939998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:25,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:25,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:21:25,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691957255] [2025-03-08 06:21:25,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:25,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:21:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:25,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:21:25,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:21:25,252 INFO L87 Difference]: Start difference. First operand 18091 states and 25059 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-08 06:21:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:26,307 INFO L93 Difference]: Finished difference Result 32055 states and 44826 transitions. [2025-03-08 06:21:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:21:26,310 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-08 06:21:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:26,338 INFO L225 Difference]: With dead ends: 32055 [2025-03-08 06:21:26,338 INFO L226 Difference]: Without dead ends: 26292 [2025-03-08 06:21:26,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:21:26,351 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 4094 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4094 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:26,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4094 Valid, 3056 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:21:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26292 states. [2025-03-08 06:21:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26292 to 18087. [2025-03-08 06:21:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18087 states, 18086 states have (on average 1.385104500718788) internal successors, (25051), 18086 states have internal predecessors, (25051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18087 states to 18087 states and 25051 transitions. [2025-03-08 06:21:26,592 INFO L78 Accepts]: Start accepts. Automaton has 18087 states and 25051 transitions. Word has length 85 [2025-03-08 06:21:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:26,592 INFO L471 AbstractCegarLoop]: Abstraction has 18087 states and 25051 transitions. [2025-03-08 06:21:26,592 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-08 06:21:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 18087 states and 25051 transitions. [2025-03-08 06:21:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 06:21:26,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:26,600 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-08 06:21:26,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:21:26,600 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-08 06:21:26,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1812887922, now seen corresponding path program 1 times [2025-03-08 06:21:26,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:26,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239521246] [2025-03-08 06:21:26,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:26,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 06:21:26,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 06:21:26,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:26,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:27,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239521246] [2025-03-08 06:21:27,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239521246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:27,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:27,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:21:27,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193341797] [2025-03-08 06:21:27,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:27,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:21:27,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:27,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:21:27,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:21:27,098 INFO L87 Difference]: Start difference. First operand 18087 states and 25051 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 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-08 06:21:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:28,457 INFO L93 Difference]: Finished difference Result 59877 states and 85180 transitions. [2025-03-08 06:21:28,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:21:28,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 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-08 06:21:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:28,514 INFO L225 Difference]: With dead ends: 59877 [2025-03-08 06:21:28,514 INFO L226 Difference]: Without dead ends: 49003 [2025-03-08 06:21:28,536 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-08 06:21:28,537 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 6456 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 1869 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6456 SdHoareTripleChecker+Valid, 5157 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:28,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6456 Valid, 5157 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1869 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:21:28,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49003 states. [2025-03-08 06:21:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49003 to 18069. [2025-03-08 06:21:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18069 states, 18068 states have (on average 1.3844919194155414) internal successors, (25015), 18068 states have internal predecessors, (25015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18069 states to 18069 states and 25015 transitions. [2025-03-08 06:21:28,906 INFO L78 Accepts]: Start accepts. Automaton has 18069 states and 25015 transitions. Word has length 85 [2025-03-08 06:21:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:28,906 INFO L471 AbstractCegarLoop]: Abstraction has 18069 states and 25015 transitions. [2025-03-08 06:21:28,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 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-08 06:21:28,906 INFO L276 IsEmpty]: Start isEmpty. Operand 18069 states and 25015 transitions. [2025-03-08 06:21:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 06:21:28,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:28,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, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:28,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:21:28,915 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-08 06:21:28,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash -296139146, now seen corresponding path program 1 times [2025-03-08 06:21:28,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:28,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351944480] [2025-03-08 06:21:28,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:28,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:28,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 06:21:28,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 06:21:28,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:28,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351944480] [2025-03-08 06:21:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351944480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:29,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:21:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535054362] [2025-03-08 06:21:29,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:29,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:21:29,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:29,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:21:29,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:21:29,091 INFO L87 Difference]: Start difference. First operand 18069 states and 25015 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-08 06:21:29,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:29,925 INFO L93 Difference]: Finished difference Result 38457 states and 54262 transitions. [2025-03-08 06:21:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:21:29,925 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-08 06:21:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:29,950 INFO L225 Difference]: With dead ends: 38457 [2025-03-08 06:21:29,950 INFO L226 Difference]: Without dead ends: 27435 [2025-03-08 06:21:29,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:21:29,957 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 2554 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2554 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:29,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2554 Valid, 2377 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:21:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27435 states. [2025-03-08 06:21:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27435 to 17986. [2025-03-08 06:21:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17986 states, 17985 states have (on average 1.3841534612176813) internal successors, (24894), 17985 states have internal predecessors, (24894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17986 states to 17986 states and 24894 transitions. [2025-03-08 06:21:30,169 INFO L78 Accepts]: Start accepts. Automaton has 17986 states and 24894 transitions. Word has length 86 [2025-03-08 06:21:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:30,169 INFO L471 AbstractCegarLoop]: Abstraction has 17986 states and 24894 transitions. [2025-03-08 06:21:30,169 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-08 06:21:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 17986 states and 24894 transitions. [2025-03-08 06:21:30,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 06:21:30,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:30,177 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-08 06:21:30,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:21:30,177 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-08 06:21:30,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:30,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1806262743, now seen corresponding path program 1 times [2025-03-08 06:21:30,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:30,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038176543] [2025-03-08 06:21:30,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:30,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:30,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 06:21:30,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 06:21:30,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:30,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:30,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:30,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038176543] [2025-03-08 06:21:30,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038176543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:30,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:30,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:21:30,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733192040] [2025-03-08 06:21:30,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:30,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:30,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:30,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:30,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:30,265 INFO L87 Difference]: Start difference. First operand 17986 states and 24894 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-08 06:21:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:30,937 INFO L93 Difference]: Finished difference Result 47814 states and 67735 transitions. [2025-03-08 06:21:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:21:30,937 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-08 06:21:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:30,976 INFO L225 Difference]: With dead ends: 47814 [2025-03-08 06:21:30,977 INFO L226 Difference]: Without dead ends: 40212 [2025-03-08 06:21:30,986 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-08 06:21:30,986 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 4366 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4366 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:30,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4366 Valid, 1562 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:21:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40212 states. [2025-03-08 06:21:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40212 to 18061. [2025-03-08 06:21:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18061 states, 18060 states have (on average 1.3839424141749723) internal successors, (24994), 18060 states have internal predecessors, (24994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18061 states to 18061 states and 24994 transitions. [2025-03-08 06:21:31,296 INFO L78 Accepts]: Start accepts. Automaton has 18061 states and 24994 transitions. Word has length 86 [2025-03-08 06:21:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:31,296 INFO L471 AbstractCegarLoop]: Abstraction has 18061 states and 24994 transitions. [2025-03-08 06:21:31,296 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-08 06:21:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 18061 states and 24994 transitions. [2025-03-08 06:21:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 06:21:31,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:31,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:31,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:21:31,305 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-08 06:21:31,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1976786479, now seen corresponding path program 1 times [2025-03-08 06:21:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883380950] [2025-03-08 06:21:31,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:31,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 06:21:31,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 06:21:31,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:31,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:31,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:31,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883380950] [2025-03-08 06:21:31,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883380950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:31,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:31,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 06:21:31,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101029328] [2025-03-08 06:21:31,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:31,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 06:21:31,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:31,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 06:21:31,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 06:21:31,537 INFO L87 Difference]: Start difference. First operand 18061 states and 24994 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 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-08 06:21:32,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:32,339 INFO L93 Difference]: Finished difference Result 43641 states and 61550 transitions. [2025-03-08 06:21:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:21:32,339 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 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-08 06:21:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:32,374 INFO L225 Difference]: With dead ends: 43641 [2025-03-08 06:21:32,374 INFO L226 Difference]: Without dead ends: 31737 [2025-03-08 06:21:32,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:21:32,391 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 4831 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4831 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:32,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4831 Valid, 2967 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1929 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:21:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31737 states. [2025-03-08 06:21:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31737 to 17522. [2025-03-08 06:21:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17522 states, 17521 states have (on average 1.3846241652873694) internal successors, (24260), 17521 states have internal predecessors, (24260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17522 states to 17522 states and 24260 transitions. [2025-03-08 06:21:32,690 INFO L78 Accepts]: Start accepts. Automaton has 17522 states and 24260 transitions. Word has length 86 [2025-03-08 06:21:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:32,690 INFO L471 AbstractCegarLoop]: Abstraction has 17522 states and 24260 transitions. [2025-03-08 06:21:32,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 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-08 06:21:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 17522 states and 24260 transitions. [2025-03-08 06:21:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 06:21:32,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:32,700 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-08 06:21:32,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:21:32,700 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-08 06:21:32,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:32,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1212856481, now seen corresponding path program 1 times [2025-03-08 06:21:32,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:32,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138379588] [2025-03-08 06:21:32,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:32,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:32,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 06:21:32,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 06:21:32,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:32,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:33,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:33,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138379588] [2025-03-08 06:21:33,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138379588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:33,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:33,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 06:21:33,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649192756] [2025-03-08 06:21:33,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:33,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 06:21:33,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:33,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 06:21:33,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:21:33,251 INFO L87 Difference]: Start difference. First operand 17522 states and 24260 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 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-08 06:21:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:34,155 INFO L93 Difference]: Finished difference Result 66304 states and 94292 transitions. [2025-03-08 06:21:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:21:34,155 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 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-08 06:21:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:34,223 INFO L225 Difference]: With dead ends: 66304 [2025-03-08 06:21:34,223 INFO L226 Difference]: Without dead ends: 55192 [2025-03-08 06:21:34,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:21:34,247 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 5916 mSDsluCounter, 6806 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5916 SdHoareTripleChecker+Valid, 7766 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:34,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5916 Valid, 7766 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:21:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55192 states. [2025-03-08 06:21:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55192 to 17266. [2025-03-08 06:21:34,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17266 states, 17265 states have (on average 1.3841297422531131) internal successors, (23897), 17265 states have internal predecessors, (23897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17266 states to 17266 states and 23897 transitions. [2025-03-08 06:21:34,647 INFO L78 Accepts]: Start accepts. Automaton has 17266 states and 23897 transitions. Word has length 87 [2025-03-08 06:21:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:34,647 INFO L471 AbstractCegarLoop]: Abstraction has 17266 states and 23897 transitions. [2025-03-08 06:21:34,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 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-08 06:21:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 17266 states and 23897 transitions. [2025-03-08 06:21:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 06:21:34,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:34,655 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-08 06:21:34,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:21:34,655 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-08 06:21:34,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash -932662435, now seen corresponding path program 1 times [2025-03-08 06:21:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:34,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63920978] [2025-03-08 06:21:34,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:34,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:34,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 06:21:34,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 06:21:34,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:34,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:35,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:35,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63920978] [2025-03-08 06:21:35,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63920978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:35,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:35,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:21:35,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459832070] [2025-03-08 06:21:35,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:35,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:21:35,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:35,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:21:35,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:21:35,045 INFO L87 Difference]: Start difference. First operand 17266 states and 23897 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 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-08 06:21:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:36,025 INFO L93 Difference]: Finished difference Result 29912 states and 42026 transitions. [2025-03-08 06:21:36,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 06:21:36,026 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 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-08 06:21:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:36,058 INFO L225 Difference]: With dead ends: 29912 [2025-03-08 06:21:36,058 INFO L226 Difference]: Without dead ends: 25053 [2025-03-08 06:21:36,070 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-08 06:21:36,070 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 2646 mSDsluCounter, 4042 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2646 SdHoareTripleChecker+Valid, 4782 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:36,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2646 Valid, 4782 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:21:36,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25053 states. [2025-03-08 06:21:36,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25053 to 17273. [2025-03-08 06:21:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17273 states, 17272 states have (on average 1.3841477535896247) internal successors, (23907), 17272 states have internal predecessors, (23907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17273 states to 17273 states and 23907 transitions. [2025-03-08 06:21:36,338 INFO L78 Accepts]: Start accepts. Automaton has 17273 states and 23907 transitions. Word has length 87 [2025-03-08 06:21:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:36,339 INFO L471 AbstractCegarLoop]: Abstraction has 17273 states and 23907 transitions. [2025-03-08 06:21:36,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 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-08 06:21:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 17273 states and 23907 transitions. [2025-03-08 06:21:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:21:36,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:36,347 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-08 06:21:36,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:21:36,348 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-08 06:21:36,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:36,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2092775166, now seen corresponding path program 1 times [2025-03-08 06:21:36,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:36,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349370241] [2025-03-08 06:21:36,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:36,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:36,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:21:36,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:21:36,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:36,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:36,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:36,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349370241] [2025-03-08 06:21:36,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349370241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:36,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:36,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:36,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430209093] [2025-03-08 06:21:36,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:36,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:36,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:36,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:36,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:36,393 INFO L87 Difference]: Start difference. First operand 17273 states and 23907 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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-08 06:21:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:36,452 INFO L93 Difference]: Finished difference Result 25964 states and 36260 transitions. [2025-03-08 06:21:36,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:36,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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-08 06:21:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:36,467 INFO L225 Difference]: With dead ends: 25964 [2025-03-08 06:21:36,467 INFO L226 Difference]: Without dead ends: 17275 [2025-03-08 06:21:36,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:36,475 INFO L435 NwaCegarLoop]: 1204 mSDtfsCounter, 555 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 2099 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-08 06:21:36,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 2099 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17275 states. [2025-03-08 06:21:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17275 to 17273. [2025-03-08 06:21:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17273 states, 17272 states have (on average 1.3752315886984716) internal successors, (23753), 17272 states have internal predecessors, (23753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17273 states to 17273 states and 23753 transitions. [2025-03-08 06:21:36,642 INFO L78 Accepts]: Start accepts. Automaton has 17273 states and 23753 transitions. Word has length 88 [2025-03-08 06:21:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:36,642 INFO L471 AbstractCegarLoop]: Abstraction has 17273 states and 23753 transitions. [2025-03-08 06:21:36,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 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-08 06:21:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 17273 states and 23753 transitions. [2025-03-08 06:21:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:21:36,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:36,652 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-08 06:21:36,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:21:36,652 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-08 06:21:36,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:36,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2143331523, now seen corresponding path program 1 times [2025-03-08 06:21:36,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:36,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769543274] [2025-03-08 06:21:36,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:36,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:36,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:21:36,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:21:36,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:36,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:36,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769543274] [2025-03-08 06:21:36,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769543274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:36,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:36,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:21:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564396116] [2025-03-08 06:21:36,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:36,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:21:36,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:36,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:21:36,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:21:36,901 INFO L87 Difference]: Start difference. First operand 17273 states and 23753 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 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-08 06:21:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:37,704 INFO L93 Difference]: Finished difference Result 37523 states and 52590 transitions. [2025-03-08 06:21:37,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:21:37,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 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-08 06:21:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:37,733 INFO L225 Difference]: With dead ends: 37523 [2025-03-08 06:21:37,733 INFO L226 Difference]: Without dead ends: 26343 [2025-03-08 06:21:37,746 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-08 06:21:37,747 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 4195 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4195 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:37,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4195 Valid, 2493 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:21:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26343 states. [2025-03-08 06:21:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26343 to 17400. [2025-03-08 06:21:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17400 states, 17399 states have (on average 1.3733547905052015) internal successors, (23895), 17399 states have internal predecessors, (23895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 23895 transitions. [2025-03-08 06:21:38,019 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 23895 transitions. Word has length 88 [2025-03-08 06:21:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:38,019 INFO L471 AbstractCegarLoop]: Abstraction has 17400 states and 23895 transitions. [2025-03-08 06:21:38,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 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-08 06:21:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 23895 transitions. [2025-03-08 06:21:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 06:21:38,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:38,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:38,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:21:38,028 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-08 06:21:38,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1395420354, now seen corresponding path program 1 times [2025-03-08 06:21:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:38,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445404110] [2025-03-08 06:21:38,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:38,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 06:21:38,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 06:21:38,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:38,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:38,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:38,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445404110] [2025-03-08 06:21:38,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445404110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:38,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:38,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:21:38,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494404415] [2025-03-08 06:21:38,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:38,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:21:38,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:38,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:21:38,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:21:38,192 INFO L87 Difference]: Start difference. First operand 17400 states and 23895 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 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-08 06:21:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:38,890 INFO L93 Difference]: Finished difference Result 36686 states and 51472 transitions. [2025-03-08 06:21:38,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:21:38,890 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 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-08 06:21:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:38,917 INFO L225 Difference]: With dead ends: 36686 [2025-03-08 06:21:38,917 INFO L226 Difference]: Without dead ends: 25806 [2025-03-08 06:21:38,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:21:38,930 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 4466 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4466 SdHoareTripleChecker+Valid, 2297 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:38,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4466 Valid, 2297 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:21:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25806 states. [2025-03-08 06:21:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25806 to 17388. [2025-03-08 06:21:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17388 states, 17387 states have (on average 1.3729222982688216) internal successors, (23871), 17387 states have internal predecessors, (23871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17388 states to 17388 states and 23871 transitions. [2025-03-08 06:21:39,123 INFO L78 Accepts]: Start accepts. Automaton has 17388 states and 23871 transitions. Word has length 88 [2025-03-08 06:21:39,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:39,124 INFO L471 AbstractCegarLoop]: Abstraction has 17388 states and 23871 transitions. [2025-03-08 06:21:39,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 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-08 06:21:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 17388 states and 23871 transitions. [2025-03-08 06:21:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:21:39,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:39,133 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-08 06:21:39,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:21:39,133 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-08 06:21:39,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash -737527114, now seen corresponding path program 1 times [2025-03-08 06:21:39,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:39,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485892150] [2025-03-08 06:21:39,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:39,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:39,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:21:39,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:21:39,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:39,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:39,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:39,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485892150] [2025-03-08 06:21:39,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485892150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:39,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:39,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:39,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804617440] [2025-03-08 06:21:39,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:39,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:39,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:39,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:39,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:39,177 INFO L87 Difference]: Start difference. First operand 17388 states and 23871 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-08 06:21:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:39,280 INFO L93 Difference]: Finished difference Result 32147 states and 44496 transitions. [2025-03-08 06:21:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:39,281 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-08 06:21:39,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:39,304 INFO L225 Difference]: With dead ends: 32147 [2025-03-08 06:21:39,304 INFO L226 Difference]: Without dead ends: 21661 [2025-03-08 06:21:39,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:39,317 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 869 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1274 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-08 06:21:39,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1274 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21661 states. [2025-03-08 06:21:39,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21661 to 16375. [2025-03-08 06:21:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16375 states, 16374 states have (on average 1.3766336875534384) internal successors, (22541), 16374 states have internal predecessors, (22541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16375 states to 16375 states and 22541 transitions. [2025-03-08 06:21:39,611 INFO L78 Accepts]: Start accepts. Automaton has 16375 states and 22541 transitions. Word has length 89 [2025-03-08 06:21:39,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:39,612 INFO L471 AbstractCegarLoop]: Abstraction has 16375 states and 22541 transitions. [2025-03-08 06:21:39,612 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-08 06:21:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 16375 states and 22541 transitions. [2025-03-08 06:21:39,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:21:39,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:39,621 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-08 06:21:39,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:21:39,622 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-08 06:21:39,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:39,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2040932025, now seen corresponding path program 1 times [2025-03-08 06:21:39,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:39,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108032702] [2025-03-08 06:21:39,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:39,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:39,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:21:39,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:21:39,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:39,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:39,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:39,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108032702] [2025-03-08 06:21:39,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108032702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:39,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:39,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:39,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270972571] [2025-03-08 06:21:39,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:39,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:39,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:39,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:39,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:39,684 INFO L87 Difference]: Start difference. First operand 16375 states and 22541 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-08 06:21:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:39,756 INFO L93 Difference]: Finished difference Result 24046 states and 33431 transitions. [2025-03-08 06:21:39,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:39,756 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-08 06:21:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:39,770 INFO L225 Difference]: With dead ends: 24046 [2025-03-08 06:21:39,770 INFO L226 Difference]: Without dead ends: 16377 [2025-03-08 06:21:39,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:39,779 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 431 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1814 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-08 06:21:39,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1814 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16377 states. [2025-03-08 06:21:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16377 to 16375. [2025-03-08 06:21:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16375 states, 16374 states have (on average 1.365518504946867) internal successors, (22359), 16374 states have internal predecessors, (22359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16375 states to 16375 states and 22359 transitions. [2025-03-08 06:21:39,989 INFO L78 Accepts]: Start accepts. Automaton has 16375 states and 22359 transitions. Word has length 89 [2025-03-08 06:21:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:39,990 INFO L471 AbstractCegarLoop]: Abstraction has 16375 states and 22359 transitions. [2025-03-08 06:21:39,990 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-08 06:21:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 16375 states and 22359 transitions. [2025-03-08 06:21:39,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:21:39,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:39,999 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-08 06:21:39,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 06:21:40,000 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-08 06:21:40,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash 856114624, now seen corresponding path program 1 times [2025-03-08 06:21:40,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:40,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171159023] [2025-03-08 06:21:40,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:40,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:21:40,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:21:40,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:40,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:40,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:40,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171159023] [2025-03-08 06:21:40,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171159023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:40,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:40,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:40,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216666469] [2025-03-08 06:21:40,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:40,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:40,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:40,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:40,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:40,066 INFO L87 Difference]: Start difference. First operand 16375 states and 22359 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-08 06:21:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:40,160 INFO L93 Difference]: Finished difference Result 23788 states and 32794 transitions. [2025-03-08 06:21:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:40,160 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-08 06:21:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:40,175 INFO L225 Difference]: With dead ends: 23788 [2025-03-08 06:21:40,175 INFO L226 Difference]: Without dead ends: 16377 [2025-03-08 06:21:40,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:40,183 INFO L435 NwaCegarLoop]: 1089 mSDtfsCounter, 435 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1833 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-08 06:21:40,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1833 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16377 states. [2025-03-08 06:21:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16377 to 16375. [2025-03-08 06:21:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16375 states, 16374 states have (on average 1.3501282521069988) internal successors, (22107), 16374 states have internal predecessors, (22107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16375 states to 16375 states and 22107 transitions. [2025-03-08 06:21:40,393 INFO L78 Accepts]: Start accepts. Automaton has 16375 states and 22107 transitions. Word has length 89 [2025-03-08 06:21:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:40,393 INFO L471 AbstractCegarLoop]: Abstraction has 16375 states and 22107 transitions. [2025-03-08 06:21:40,393 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-08 06:21:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 16375 states and 22107 transitions. [2025-03-08 06:21:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:21:40,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:40,403 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-08 06:21:40,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 06:21:40,403 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-08 06:21:40,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash -639084350, now seen corresponding path program 1 times [2025-03-08 06:21:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:40,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690660480] [2025-03-08 06:21:40,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:40,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:40,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:21:40,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:21:40,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:40,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:40,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690660480] [2025-03-08 06:21:40,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690660480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:40,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:40,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:40,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253352897] [2025-03-08 06:21:40,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:40,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:40,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:40,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:40,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:40,451 INFO L87 Difference]: Start difference. First operand 16375 states and 22107 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-08 06:21:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:40,537 INFO L93 Difference]: Finished difference Result 28735 states and 39235 transitions. [2025-03-08 06:21:40,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:40,537 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-08 06:21:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:40,556 INFO L225 Difference]: With dead ends: 28735 [2025-03-08 06:21:40,556 INFO L226 Difference]: Without dead ends: 19473 [2025-03-08 06:21:40,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:40,567 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 683 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 904 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-08 06:21:40,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 904 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19473 states. [2025-03-08 06:21:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19473 to 15138. [2025-03-08 06:21:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 1.35370284732774) internal successors, (20491), 15137 states have internal predecessors, (20491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 20491 transitions. [2025-03-08 06:21:40,722 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 20491 transitions. Word has length 89 [2025-03-08 06:21:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:40,722 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 20491 transitions. [2025-03-08 06:21:40,722 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-08 06:21:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 20491 transitions. [2025-03-08 06:21:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:21:40,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:40,729 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-08 06:21:40,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 06:21:40,729 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-08 06:21:40,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash 747650700, now seen corresponding path program 1 times [2025-03-08 06:21:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:40,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488760644] [2025-03-08 06:21:40,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:40,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:21:40,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:21:40,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:40,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:40,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:40,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:40,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488760644] [2025-03-08 06:21:40,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488760644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:40,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:40,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:40,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780771542] [2025-03-08 06:21:40,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:40,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:40,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:40,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:40,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:40,770 INFO L87 Difference]: Start difference. First operand 15138 states and 20491 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-08 06:21:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:40,884 INFO L93 Difference]: Finished difference Result 27107 states and 37106 transitions. [2025-03-08 06:21:40,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:40,885 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-08 06:21:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:40,903 INFO L225 Difference]: With dead ends: 27107 [2025-03-08 06:21:40,903 INFO L226 Difference]: Without dead ends: 18029 [2025-03-08 06:21:40,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:40,913 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 609 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 780 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-08 06:21:40,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 780 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:21:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18029 states. [2025-03-08 06:21:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18029 to 14207. [2025-03-08 06:21:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14207 states, 14206 states have (on average 1.3592848092355343) internal successors, (19310), 14206 states have internal predecessors, (19310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14207 states to 14207 states and 19310 transitions. [2025-03-08 06:21:41,084 INFO L78 Accepts]: Start accepts. Automaton has 14207 states and 19310 transitions. Word has length 89 [2025-03-08 06:21:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:41,085 INFO L471 AbstractCegarLoop]: Abstraction has 14207 states and 19310 transitions. [2025-03-08 06:21:41,085 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-08 06:21:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 14207 states and 19310 transitions. [2025-03-08 06:21:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:21:41,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:41,092 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-08 06:21:41,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 06:21:41,092 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-08 06:21:41,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:41,093 INFO L85 PathProgramCache]: Analyzing trace with hash 59987070, now seen corresponding path program 1 times [2025-03-08 06:21:41,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:41,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217717996] [2025-03-08 06:21:41,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:41,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:41,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:21:41,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:21:41,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:41,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:41,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:41,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217717996] [2025-03-08 06:21:41,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217717996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:41,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:41,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:21:41,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67734733] [2025-03-08 06:21:41,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:41,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:21:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:41,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:21:41,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:21:41,269 INFO L87 Difference]: Start difference. First operand 14207 states and 19310 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 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-08 06:21:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:41,848 INFO L93 Difference]: Finished difference Result 23090 states and 31709 transitions. [2025-03-08 06:21:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:21:41,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 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-08 06:21:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:41,867 INFO L225 Difference]: With dead ends: 23090 [2025-03-08 06:21:41,868 INFO L226 Difference]: Without dead ends: 21852 [2025-03-08 06:21:41,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:21:41,874 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 3068 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3068 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:41,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3068 Valid, 1999 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:21:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21852 states. [2025-03-08 06:21:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21852 to 14198. [2025-03-08 06:21:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14198 states, 14197 states have (on average 1.3591603859970416) internal successors, (19296), 14197 states have internal predecessors, (19296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14198 states to 14198 states and 19296 transitions. [2025-03-08 06:21:42,026 INFO L78 Accepts]: Start accepts. Automaton has 14198 states and 19296 transitions. Word has length 90 [2025-03-08 06:21:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:42,026 INFO L471 AbstractCegarLoop]: Abstraction has 14198 states and 19296 transitions. [2025-03-08 06:21:42,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 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-08 06:21:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 14198 states and 19296 transitions. [2025-03-08 06:21:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:21:42,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:42,033 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-08 06:21:42,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 06:21:42,033 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-08 06:21:42,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1858602684, now seen corresponding path program 1 times [2025-03-08 06:21:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:42,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725294254] [2025-03-08 06:21:42,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:42,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:42,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:21:42,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:21:42,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:42,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:42,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:42,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725294254] [2025-03-08 06:21:42,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725294254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:42,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:42,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:21:42,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043609940] [2025-03-08 06:21:42,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:42,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:21:42,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:42,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:21:42,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:21:42,180 INFO L87 Difference]: Start difference. First operand 14198 states and 19296 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 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-08 06:21:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:42,931 INFO L93 Difference]: Finished difference Result 30230 states and 41740 transitions. [2025-03-08 06:21:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 06:21:42,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 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-08 06:21:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:42,960 INFO L225 Difference]: With dead ends: 30230 [2025-03-08 06:21:42,960 INFO L226 Difference]: Without dead ends: 28909 [2025-03-08 06:21:42,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:21:42,970 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 2489 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2489 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:42,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2489 Valid, 2440 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:21:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28909 states. [2025-03-08 06:21:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28909 to 14139. [2025-03-08 06:21:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14139 states, 14138 states have (on average 1.3594567831376432) internal successors, (19220), 14138 states have internal predecessors, (19220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14139 states to 14139 states and 19220 transitions. [2025-03-08 06:21:43,154 INFO L78 Accepts]: Start accepts. Automaton has 14139 states and 19220 transitions. Word has length 90 [2025-03-08 06:21:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:43,154 INFO L471 AbstractCegarLoop]: Abstraction has 14139 states and 19220 transitions. [2025-03-08 06:21:43,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 8 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-08 06:21:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14139 states and 19220 transitions. [2025-03-08 06:21:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:21:43,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:43,164 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-08 06:21:43,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 06:21:43,164 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-08 06:21:43,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:43,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1860665462, now seen corresponding path program 1 times [2025-03-08 06:21:43,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:43,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717498148] [2025-03-08 06:21:43,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:43,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:43,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:21:43,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:21:43,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:43,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:43,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:43,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717498148] [2025-03-08 06:21:43,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717498148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:43,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:43,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:21:43,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140815581] [2025-03-08 06:21:43,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:43,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:21:43,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:43,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:21:43,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:21:43,539 INFO L87 Difference]: Start difference. First operand 14139 states and 19220 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 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-08 06:21:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:44,250 INFO L93 Difference]: Finished difference Result 40858 states and 56670 transitions. [2025-03-08 06:21:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 06:21:44,250 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 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-08 06:21:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:44,293 INFO L225 Difference]: With dead ends: 40858 [2025-03-08 06:21:44,293 INFO L226 Difference]: Without dead ends: 39605 [2025-03-08 06:21:44,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:21:44,308 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 5256 mSDsluCounter, 4638 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5256 SdHoareTripleChecker+Valid, 5330 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:44,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5256 Valid, 5330 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:21:44,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39605 states. [2025-03-08 06:21:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39605 to 14106. [2025-03-08 06:21:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14106 states, 14105 states have (on average 1.3593761077632045) internal successors, (19174), 14105 states have internal predecessors, (19174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14106 states to 14106 states and 19174 transitions. [2025-03-08 06:21:44,520 INFO L78 Accepts]: Start accepts. Automaton has 14106 states and 19174 transitions. Word has length 91 [2025-03-08 06:21:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:44,520 INFO L471 AbstractCegarLoop]: Abstraction has 14106 states and 19174 transitions. [2025-03-08 06:21:44,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 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-08 06:21:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 14106 states and 19174 transitions. [2025-03-08 06:21:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:21:44,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:44,526 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-08 06:21:44,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 06:21:44,526 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-08 06:21:44,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1869526635, now seen corresponding path program 1 times [2025-03-08 06:21:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:44,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127572080] [2025-03-08 06:21:44,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:44,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:44,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:21:44,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:21:44,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:44,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127572080] [2025-03-08 06:21:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127572080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:44,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:44,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:21:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120851853] [2025-03-08 06:21:44,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:21:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:44,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:21:44,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:21:44,857 INFO L87 Difference]: Start difference. First operand 14106 states and 19174 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 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-08 06:21:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:45,452 INFO L93 Difference]: Finished difference Result 21474 states and 29506 transitions. [2025-03-08 06:21:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:21:45,453 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 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-08 06:21:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:45,471 INFO L225 Difference]: With dead ends: 21474 [2025-03-08 06:21:45,471 INFO L226 Difference]: Without dead ends: 21157 [2025-03-08 06:21:45,477 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-08 06:21:45,477 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 3021 mSDsluCounter, 3183 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3021 SdHoareTripleChecker+Valid, 3750 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:45,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3021 Valid, 3750 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:21:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21157 states. [2025-03-08 06:21:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21157 to 14093. [2025-03-08 06:21:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14093 states, 14092 states have (on average 1.3594947487936417) internal successors, (19158), 14092 states have internal predecessors, (19158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14093 states to 14093 states and 19158 transitions. [2025-03-08 06:21:45,624 INFO L78 Accepts]: Start accepts. Automaton has 14093 states and 19158 transitions. Word has length 91 [2025-03-08 06:21:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:45,624 INFO L471 AbstractCegarLoop]: Abstraction has 14093 states and 19158 transitions. [2025-03-08 06:21:45,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 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-08 06:21:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 14093 states and 19158 transitions. [2025-03-08 06:21:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:21:45,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:45,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:45,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 06:21:45,631 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-08 06:21:45,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:45,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2038276480, now seen corresponding path program 1 times [2025-03-08 06:21:45,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:45,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449941586] [2025-03-08 06:21:45,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:45,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:45,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:21:45,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:21:45,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:45,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:45,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:45,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449941586] [2025-03-08 06:21:45,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449941586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:45,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:45,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:21:45,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133960809] [2025-03-08 06:21:45,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:45,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:21:45,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:45,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:21:45,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:21:45,993 INFO L87 Difference]: Start difference. First operand 14093 states and 19158 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 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-08 06:21:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:46,593 INFO L93 Difference]: Finished difference Result 21933 states and 30179 transitions. [2025-03-08 06:21:46,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:21:46,593 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 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-08 06:21:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:46,617 INFO L225 Difference]: With dead ends: 21933 [2025-03-08 06:21:46,617 INFO L226 Difference]: Without dead ends: 21035 [2025-03-08 06:21:46,627 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-08 06:21:46,627 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 3027 mSDsluCounter, 3050 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3027 SdHoareTripleChecker+Valid, 3617 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:46,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3027 Valid, 3617 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:21:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21035 states. [2025-03-08 06:21:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21035 to 13995. [2025-03-08 06:21:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13995 states, 13994 states have (on average 1.360154351865085) internal successors, (19034), 13994 states have internal predecessors, (19034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13995 states to 13995 states and 19034 transitions. [2025-03-08 06:21:46,805 INFO L78 Accepts]: Start accepts. Automaton has 13995 states and 19034 transitions. Word has length 91 [2025-03-08 06:21:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:46,806 INFO L471 AbstractCegarLoop]: Abstraction has 13995 states and 19034 transitions. [2025-03-08 06:21:46,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 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-08 06:21:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 13995 states and 19034 transitions. [2025-03-08 06:21:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:21:46,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:46,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:46,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 06:21:46,815 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-08 06:21:46,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:46,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1630397913, now seen corresponding path program 1 times [2025-03-08 06:21:46,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:46,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886589804] [2025-03-08 06:21:46,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:46,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:46,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:21:46,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:21:46,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:46,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:46,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:46,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886589804] [2025-03-08 06:21:46,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886589804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:46,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:46,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:46,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070879289] [2025-03-08 06:21:46,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:46,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:46,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:46,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:46,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:46,883 INFO L87 Difference]: Start difference. First operand 13995 states and 19034 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:46,960 INFO L93 Difference]: Finished difference Result 21496 states and 29464 transitions. [2025-03-08 06:21:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:46,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:21:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:46,978 INFO L225 Difference]: With dead ends: 21496 [2025-03-08 06:21:46,978 INFO L226 Difference]: Without dead ends: 13997 [2025-03-08 06:21:46,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:46,989 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 379 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1473 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-08 06:21:46,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1473 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13997 states. [2025-03-08 06:21:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13997 to 13995. [2025-03-08 06:21:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13995 states, 13994 states have (on average 1.3505073602972704) internal successors, (18899), 13994 states have internal predecessors, (18899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13995 states to 13995 states and 18899 transitions. [2025-03-08 06:21:47,134 INFO L78 Accepts]: Start accepts. Automaton has 13995 states and 18899 transitions. Word has length 95 [2025-03-08 06:21:47,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:47,138 INFO L471 AbstractCegarLoop]: Abstraction has 13995 states and 18899 transitions. [2025-03-08 06:21:47,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 13995 states and 18899 transitions. [2025-03-08 06:21:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:21:47,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:47,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:47,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 06:21:47,152 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-08 06:21:47,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1809453333, now seen corresponding path program 1 times [2025-03-08 06:21:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:47,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661609000] [2025-03-08 06:21:47,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:47,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:47,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:21:47,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:21:47,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:47,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:47,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:47,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661609000] [2025-03-08 06:21:47,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661609000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:47,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:47,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664467593] [2025-03-08 06:21:47,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:47,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:47,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:47,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:47,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:47,203 INFO L87 Difference]: Start difference. First operand 13995 states and 18899 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:47,288 INFO L93 Difference]: Finished difference Result 25485 states and 34775 transitions. [2025-03-08 06:21:47,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:47,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 06:21:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:47,305 INFO L225 Difference]: With dead ends: 25485 [2025-03-08 06:21:47,305 INFO L226 Difference]: Without dead ends: 16810 [2025-03-08 06:21:47,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:47,315 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 576 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 865 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-08 06:21:47,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 865 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16810 states. [2025-03-08 06:21:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16810 to 13016. [2025-03-08 06:21:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13016 states, 13015 states have (on average 1.3546676911256244) internal successors, (17631), 13015 states have internal predecessors, (17631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13016 states to 13016 states and 17631 transitions. [2025-03-08 06:21:47,445 INFO L78 Accepts]: Start accepts. Automaton has 13016 states and 17631 transitions. Word has length 96 [2025-03-08 06:21:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:47,445 INFO L471 AbstractCegarLoop]: Abstraction has 13016 states and 17631 transitions. [2025-03-08 06:21:47,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 13016 states and 17631 transitions. [2025-03-08 06:21:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:21:47,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:47,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 06:21:47,453 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-08 06:21:47,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1134301319, now seen corresponding path program 1 times [2025-03-08 06:21:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699931330] [2025-03-08 06:21:47,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:47,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:21:47,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:21:47,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:47,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699931330] [2025-03-08 06:21:48,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699931330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:48,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:48,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 06:21:48,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944048558] [2025-03-08 06:21:48,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:48,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 06:21:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:48,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 06:21:48,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:21:48,103 INFO L87 Difference]: Start difference. First operand 13016 states and 17631 transitions. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:49,353 INFO L93 Difference]: Finished difference Result 31560 states and 43313 transitions. [2025-03-08 06:21:49,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:21:49,353 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 06:21:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:49,383 INFO L225 Difference]: With dead ends: 31560 [2025-03-08 06:21:49,383 INFO L226 Difference]: Without dead ends: 31381 [2025-03-08 06:21:49,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 06:21:49,393 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 4136 mSDsluCounter, 4971 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:49,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 5500 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:21:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31381 states. [2025-03-08 06:21:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31381 to 13016. [2025-03-08 06:21:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13016 states, 13015 states have (on average 1.3545908567038034) internal successors, (17630), 13015 states have internal predecessors, (17630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13016 states to 13016 states and 17630 transitions. [2025-03-08 06:21:49,569 INFO L78 Accepts]: Start accepts. Automaton has 13016 states and 17630 transitions. Word has length 97 [2025-03-08 06:21:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:49,569 INFO L471 AbstractCegarLoop]: Abstraction has 13016 states and 17630 transitions. [2025-03-08 06:21:49,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 13016 states and 17630 transitions. [2025-03-08 06:21:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:21:49,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:49,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:49,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 06:21:49,578 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-08 06:21:49,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:49,578 INFO L85 PathProgramCache]: Analyzing trace with hash 629846884, now seen corresponding path program 1 times [2025-03-08 06:21:49,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:49,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248691558] [2025-03-08 06:21:49,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:49,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:21:49,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:21:49,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:49,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:49,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248691558] [2025-03-08 06:21:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248691558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:49,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:49,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:21:49,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128402719] [2025-03-08 06:21:49,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:49,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:21:49,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:49,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:21:49,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:21:49,937 INFO L87 Difference]: Start difference. First operand 13016 states and 17630 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-08 06:21:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:50,471 INFO L93 Difference]: Finished difference Result 19980 states and 27350 transitions. [2025-03-08 06:21:50,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:21:50,472 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-08 06:21:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:50,488 INFO L225 Difference]: With dead ends: 19980 [2025-03-08 06:21:50,488 INFO L226 Difference]: Without dead ends: 19796 [2025-03-08 06:21:50,492 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-08 06:21:50,493 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 2348 mSDsluCounter, 2499 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:50,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 3034 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:21:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19796 states. [2025-03-08 06:21:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19796 to 12976. [2025-03-08 06:21:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12976 states, 12975 states have (on average 1.354990366088632) internal successors, (17581), 12975 states have internal predecessors, (17581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12976 states to 12976 states and 17581 transitions. [2025-03-08 06:21:50,683 INFO L78 Accepts]: Start accepts. Automaton has 12976 states and 17581 transitions. Word has length 98 [2025-03-08 06:21:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:50,683 INFO L471 AbstractCegarLoop]: Abstraction has 12976 states and 17581 transitions. [2025-03-08 06:21:50,684 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-08 06:21:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 12976 states and 17581 transitions. [2025-03-08 06:21:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:21:50,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:50,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:50,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 06:21:50,692 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-08 06:21:50,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1776557067, now seen corresponding path program 1 times [2025-03-08 06:21:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:50,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799885774] [2025-03-08 06:21:50,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:50,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:50,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:21:50,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:21:50,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:50,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:50,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799885774] [2025-03-08 06:21:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799885774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:50,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:50,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:21:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070706890] [2025-03-08 06:21:50,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:50,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:50,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:50,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:50,774 INFO L87 Difference]: Start difference. First operand 12976 states and 17581 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:50,940 INFO L93 Difference]: Finished difference Result 46792 states and 65377 transitions. [2025-03-08 06:21:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:21:50,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-08 06:21:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:50,979 INFO L225 Difference]: With dead ends: 46792 [2025-03-08 06:21:50,980 INFO L226 Difference]: Without dead ends: 36800 [2025-03-08 06:21:50,994 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-08 06:21:50,994 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 3463 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3463 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:50,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3463 Valid, 2040 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:21:51,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36800 states. [2025-03-08 06:21:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36800 to 22966. [2025-03-08 06:21:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22966 states, 22965 states have (on average 1.3663400827345962) internal successors, (31378), 22965 states have internal predecessors, (31378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22966 states to 22966 states and 31378 transitions. [2025-03-08 06:21:51,262 INFO L78 Accepts]: Start accepts. Automaton has 22966 states and 31378 transitions. Word has length 100 [2025-03-08 06:21:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:51,262 INFO L471 AbstractCegarLoop]: Abstraction has 22966 states and 31378 transitions. [2025-03-08 06:21:51,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 22966 states and 31378 transitions. [2025-03-08 06:21:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:21:51,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:21:51,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-08 06:21:51,277 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-08 06:21:51,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:51,277 INFO L85 PathProgramCache]: Analyzing trace with hash -731721278, now seen corresponding path program 1 times [2025-03-08 06:21:51,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:51,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971396285] [2025-03-08 06:21:51,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:51,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:51,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:21:51,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:21:51,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:51,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971396285] [2025-03-08 06:21:51,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971396285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:51,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:51,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:21:51,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98264446] [2025-03-08 06:21:51,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:51,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:21:51,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:51,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:21:51,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:21:51,375 INFO L87 Difference]: Start difference. First operand 22966 states and 31378 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:51,540 INFO L93 Difference]: Finished difference Result 29496 states and 40286 transitions. [2025-03-08 06:21:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:21:51,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-08 06:21:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:51,565 INFO L225 Difference]: With dead ends: 29496 [2025-03-08 06:21:51,566 INFO L226 Difference]: Without dead ends: 27584 [2025-03-08 06:21:51,575 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-08 06:21:51,576 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 1586 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:51,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 2035 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:21:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27584 states. [2025-03-08 06:21:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27584 to 26656. [2025-03-08 06:21:51,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26656 states, 26655 states have (on average 1.3680360157568936) internal successors, (36465), 26655 states have internal predecessors, (36465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26656 states to 26656 states and 36465 transitions. [2025-03-08 06:21:51,824 INFO L78 Accepts]: Start accepts. Automaton has 26656 states and 36465 transitions. Word has length 101 [2025-03-08 06:21:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:51,824 INFO L471 AbstractCegarLoop]: Abstraction has 26656 states and 36465 transitions. [2025-03-08 06:21:51,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 26656 states and 36465 transitions. [2025-03-08 06:21:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 06:21:51,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:51,841 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] [2025-03-08 06:21:51,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 06:21:51,841 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-08 06:21:51,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:51,842 INFO L85 PathProgramCache]: Analyzing trace with hash 532535463, now seen corresponding path program 1 times [2025-03-08 06:21:51,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:51,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179239066] [2025-03-08 06:21:51,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:51,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:51,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 06:21:51,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 06:21:51,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:51,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:51,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179239066] [2025-03-08 06:21:51,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179239066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:51,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:51,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:51,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902524420] [2025-03-08 06:21:51,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:51,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:51,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:51,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:51,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:51,918 INFO L87 Difference]: Start difference. First operand 26656 states and 36465 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:52,060 INFO L93 Difference]: Finished difference Result 71404 states and 98739 transitions. [2025-03-08 06:21:52,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:52,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-03-08 06:21:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:52,109 INFO L225 Difference]: With dead ends: 71404 [2025-03-08 06:21:52,109 INFO L226 Difference]: Without dead ends: 47718 [2025-03-08 06:21:52,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:52,136 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 197 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1220 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-08 06:21:52,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1220 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47718 states. [2025-03-08 06:21:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47718 to 44532. [2025-03-08 06:21:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44532 states, 44531 states have (on average 1.374480698839011) internal successors, (61207), 44531 states have internal predecessors, (61207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44532 states to 44532 states and 61207 transitions. [2025-03-08 06:21:52,627 INFO L78 Accepts]: Start accepts. Automaton has 44532 states and 61207 transitions. Word has length 102 [2025-03-08 06:21:52,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:52,627 INFO L471 AbstractCegarLoop]: Abstraction has 44532 states and 61207 transitions. [2025-03-08 06:21:52,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 44532 states and 61207 transitions. [2025-03-08 06:21:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 06:21:52,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:52,641 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] [2025-03-08 06:21:52,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 06:21:52,642 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-08 06:21:52,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:52,642 INFO L85 PathProgramCache]: Analyzing trace with hash -719996479, now seen corresponding path program 1 times [2025-03-08 06:21:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:52,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816448204] [2025-03-08 06:21:52,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:52,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 06:21:52,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 06:21:52,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:52,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:52,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:52,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816448204] [2025-03-08 06:21:52,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816448204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:52,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:52,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:52,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046712844] [2025-03-08 06:21:52,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:52,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:52,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:52,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:52,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:52,708 INFO L87 Difference]: Start difference. First operand 44532 states and 61207 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:52,929 INFO L93 Difference]: Finished difference Result 123960 states and 171321 transitions. [2025-03-08 06:21:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:52,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2025-03-08 06:21:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:53,016 INFO L225 Difference]: With dead ends: 123960 [2025-03-08 06:21:53,016 INFO L226 Difference]: Without dead ends: 82398 [2025-03-08 06:21:53,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:53,062 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 175 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1215 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-08 06:21:53,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1215 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82398 states. [2025-03-08 06:21:53,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82398 to 76428. [2025-03-08 06:21:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76428 states, 76427 states have (on average 1.3755740772240177) internal successors, (105131), 76427 states have internal predecessors, (105131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:54,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76428 states to 76428 states and 105131 transitions. [2025-03-08 06:21:54,105 INFO L78 Accepts]: Start accepts. Automaton has 76428 states and 105131 transitions. Word has length 103 [2025-03-08 06:21:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:54,105 INFO L471 AbstractCegarLoop]: Abstraction has 76428 states and 105131 transitions. [2025-03-08 06:21:54,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:54,106 INFO L276 IsEmpty]: Start isEmpty. Operand 76428 states and 105131 transitions. [2025-03-08 06:21:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 06:21:54,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:54,121 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-08 06:21:54,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-08 06:21:54,121 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-08 06:21:54,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1318699947, now seen corresponding path program 1 times [2025-03-08 06:21:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:54,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832288835] [2025-03-08 06:21:54,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:54,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:54,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 06:21:54,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 06:21:54,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:54,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:54,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:54,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832288835] [2025-03-08 06:21:54,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832288835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:54,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:54,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:54,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340766603] [2025-03-08 06:21:54,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:54,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:54,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:54,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:54,236 INFO L87 Difference]: Start difference. First operand 76428 states and 105131 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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-08 06:21:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:54,872 INFO L93 Difference]: Finished difference Result 216392 states and 298309 transitions. [2025-03-08 06:21:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:54,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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-08 06:21:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:55,099 INFO L225 Difference]: With dead ends: 216392 [2025-03-08 06:21:55,099 INFO L226 Difference]: Without dead ends: 142934 [2025-03-08 06:21:55,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:55,186 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 157 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:55,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1201 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142934 states. [2025-03-08 06:21:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142934 to 131800. [2025-03-08 06:21:56,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131800 states, 131799 states have (on average 1.3731136048073203) internal successors, (180975), 131799 states have internal predecessors, (180975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131800 states to 131800 states and 180975 transitions. [2025-03-08 06:21:57,204 INFO L78 Accepts]: Start accepts. Automaton has 131800 states and 180975 transitions. Word has length 104 [2025-03-08 06:21:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:57,204 INFO L471 AbstractCegarLoop]: Abstraction has 131800 states and 180975 transitions. [2025-03-08 06:21:57,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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-08 06:21:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 131800 states and 180975 transitions. [2025-03-08 06:21:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 06:21:57,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:57,216 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-08 06:21:57,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-08 06:21:57,216 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-08 06:21:57,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:57,217 INFO L85 PathProgramCache]: Analyzing trace with hash 569919833, now seen corresponding path program 1 times [2025-03-08 06:21:57,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:57,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492622581] [2025-03-08 06:21:57,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:57,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:57,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:21:57,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:21:57,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:57,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:57,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:57,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492622581] [2025-03-08 06:21:57,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492622581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:57,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:57,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:57,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552318239] [2025-03-08 06:21:57,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:57,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:57,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:57,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:57,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:57,458 INFO L87 Difference]: Start difference. First operand 131800 states and 180975 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-08 06:21:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:21:57,979 INFO L93 Difference]: Finished difference Result 181009 states and 247292 transitions. [2025-03-08 06:21:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:21:57,980 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-08 06:21:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:21:58,171 INFO L225 Difference]: With dead ends: 181009 [2025-03-08 06:21:58,172 INFO L226 Difference]: Without dead ends: 118015 [2025-03-08 06:21:58,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:58,243 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 374 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:21:58,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1197 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:21:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118015 states. [2025-03-08 06:21:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118015 to 118013. [2025-03-08 06:21:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118013 states, 118012 states have (on average 1.3559807477205708) internal successors, (160022), 118012 states have internal predecessors, (160022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:21:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118013 states to 118013 states and 160022 transitions. [2025-03-08 06:21:59,789 INFO L78 Accepts]: Start accepts. Automaton has 118013 states and 160022 transitions. Word has length 107 [2025-03-08 06:21:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:21:59,790 INFO L471 AbstractCegarLoop]: Abstraction has 118013 states and 160022 transitions. [2025-03-08 06:21:59,790 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-08 06:21:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 118013 states and 160022 transitions. [2025-03-08 06:21:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 06:21:59,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:21:59,800 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-08 06:21:59,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-08 06:21:59,800 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-08 06:21:59,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:21:59,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1799249632, now seen corresponding path program 1 times [2025-03-08 06:21:59,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:21:59,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805403971] [2025-03-08 06:21:59,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:21:59,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:21:59,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:21:59,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:21:59,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:21:59,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:21:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:21:59,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:21:59,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805403971] [2025-03-08 06:21:59,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805403971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:21:59,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:21:59,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:21:59,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175404290] [2025-03-08 06:21:59,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:21:59,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:21:59,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:21:59,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:21:59,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:21:59,894 INFO L87 Difference]: Start difference. First operand 118013 states and 160022 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-08 06:22:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:22:01,068 INFO L93 Difference]: Finished difference Result 340417 states and 461528 transitions. [2025-03-08 06:22:01,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:22:01,068 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-08 06:22:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:22:01,476 INFO L225 Difference]: With dead ends: 340417 [2025-03-08 06:22:01,476 INFO L226 Difference]: Without dead ends: 225215 [2025-03-08 06:22:01,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:22:01,585 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 125 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1184 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:22:01,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1184 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:22:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225215 states.