./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0ed6e4196d49d75b29a7ddd297e9986c08c6bd65f18221f72f78571f381f483e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:31:04,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:31:04,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:31:04,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:31:04,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:31:04,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:31:04,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:31:04,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:31:04,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:31:04,423 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:31:04,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:31:04,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:31:04,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:31:04,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:31:04,424 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:31:04,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:31:04,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:31:04,424 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:31:04,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:31:04,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:31:04,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:31:04,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:31:04,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:31:04,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:31:04,425 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:31:04,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:31:04,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:31:04,425 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:31:04,425 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:31:04,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:31:04,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:31:04,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:31:04,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:31:04,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:31:04,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:31:04,426 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:31:04,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:31:04,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:31:04,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:31:04,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:31:04,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:31:04,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:31:04,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:31:04,426 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-jdk21/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 -> 0ed6e4196d49d75b29a7ddd297e9986c08c6bd65f18221f72f78571f381f483e [2025-02-05 16:31:04,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:31:04,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:31:04,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:31:04,691 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:31:04,691 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:31:04,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-02-05 16:31:05,903 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1285d2b5/6eb16a0b53ff40b79bf9308d3d423b6c/FLAGe70ccf3d8 [2025-02-05 16:31:06,301 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:31:06,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-02-05 16:31:06,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1285d2b5/6eb16a0b53ff40b79bf9308d3d423b6c/FLAGe70ccf3d8 [2025-02-05 16:31:06,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1285d2b5/6eb16a0b53ff40b79bf9308d3d423b6c [2025-02-05 16:31:06,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:31:06,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:31:06,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:31:06,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:31:06,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:31:06,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:06,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f798a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06, skipping insertion in model container [2025-02-05 16:31:06,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:06,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:31:06,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8637,8650] [2025-02-05 16:31:06,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15862,15875] [2025-02-05 16:31:06,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18059,18072] [2025-02-05 16:31:06,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19083,19096] [2025-02-05 16:31:06,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:31:06,785 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:31:06,835 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8637,8650] [2025-02-05 16:31:06,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15862,15875] [2025-02-05 16:31:06,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18059,18072] [2025-02-05 16:31:06,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19083,19096] [2025-02-05 16:31:06,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:31:06,934 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:31:06,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06 WrapperNode [2025-02-05 16:31:06,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:31:06,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:31:06,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:31:06,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:31:06,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:06,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:07,025 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2847 [2025-02-05 16:31:07,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:31:07,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:31:07,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:31:07,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:31:07,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:07,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:07,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:07,078 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-02-05 16:31:07,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:07,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:07,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:07,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:07,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:07,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:07,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:31:07,150 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:31:07,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:31:07,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:31:07,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (1/1) ... [2025-02-05 16:31:07,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:31:07,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:07,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:31:07,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:31:07,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:31:07,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:31:07,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:31:07,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:31:07,354 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:31:07,355 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:31:08,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-02-05 16:31:08,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L828: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-02-05 16:31:08,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2282: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~23#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-02-05 16:31:08,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L301: havoc main_~node2__m2~1#1; [2025-02-05 16:31:08,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L368: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:31:08,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1624: havoc main_~node3__m3~6#1; [2025-02-05 16:31:08,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3474: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~41#1; [2025-02-05 16:31:08,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3145: havoc main_~node3__m3~12#1; [2025-02-05 16:31:08,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3938: havoc main_~node3____CPAchecker_TMP_0~11#1; [2025-02-05 16:31:08,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4335: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~55#1;havoc main_~node3____CPAchecker_TMP_1~12#1; [2025-02-05 16:31:08,553 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2089: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~20#1; [2025-02-05 16:31:08,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2552: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~27#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-02-05 16:31:08,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3411: havoc main_~node2__m2~5#1;havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-02-05 16:31:08,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L241: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:31:08,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3677: havoc main_~node3__m3~14#1; [2025-02-05 16:31:08,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2224: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~22#1; [2025-02-05 16:31:08,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2687: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~29#1; [2025-02-05 16:31:08,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1300: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-05 16:31:08,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4142: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~52#1; [2025-02-05 16:31:08,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1634: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:31:08,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4277: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~54#1; [2025-02-05 16:31:08,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2031: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~19#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-02-05 16:31:08,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L908: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L512: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2494: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~26#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3155: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1042: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3421: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1175: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2894: havoc main_~node3__m3~11#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3687: havoc main_~node3____CPAchecker_TMP_0~10#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: havoc main_~node3__m3~1#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4084: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~51#1;havoc main_~node3____CPAchecker_TMP_1~11#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1838: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-02-05 16:31:08,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3359: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~40#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2170: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~21#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1973: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~18#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1116: havoc main_~node2__m2~3#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3891: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~48#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L390: havoc main_~node2__m2~2#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L192: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3430: havoc main_~node3__m3~13#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4223: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~53#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~25#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4026: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~50#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1780: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-02-05 16:31:08,556 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2904: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3301: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~39#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2377: havoc main_~node2__m2~4#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc main_~node3__m3~10#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3833: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~47#1;havoc main_~node3____CPAchecker_TMP_1~10#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~36#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1919: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~17#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L202: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1722: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3440: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1591: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~38#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L800: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3972: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~49#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1330: havoc main_~check__tmp~9#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2387: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3775: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~46#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1133: havoc main_~node3__m3~4#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3644: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~44#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2653: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1266: havoc main_~node3__m3~5#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3050: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~35#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L408: havoc main_~node3__m3~2#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2126: havoc main_~node3__m3~8#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1533: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L212: havoc main_~node2__m2~0#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L741: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:31:08,557 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2857: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~32#1; [2025-02-05 16:31:08,558 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1668: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2025-02-05 16:31:08,558 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4179: havoc main_~node3__m3~16#1; [2025-02-05 16:31:08,558 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2396: havoc main_~node3__m3~9#1; [2025-02-05 16:31:08,558 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3189: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~37#1; [2025-02-05 16:31:08,558 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3586: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~43#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-02-05 16:31:08,558 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L283: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:31:08,558 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2992: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~34#1; [2025-02-05 16:31:08,558 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3721: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~45#1; [2025-02-05 16:31:08,558 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1475: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-05 16:31:08,558 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2136: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:31:08,558 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L222: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:31:08,558 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2799: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~31#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1875: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3528: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~42#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4189: havoc main_~node3____CPAchecker_TMP_0~12#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2340: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~24#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1217: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928: havoc main_~node3__m3~15#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2938: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~33#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~30#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L231: havoc main_~node3__m3~0#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4393: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~56#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L958: havoc main_~node3__m3~3#1; [2025-02-05 16:31:08,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2610: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~28#1; [2025-02-05 16:31:08,643 INFO L? ?]: Removed 486 outVars from TransFormulas that were not future-live. [2025-02-05 16:31:08,644 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:31:08,671 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:31:08,671 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:31:08,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:31:08 BoogieIcfgContainer [2025-02-05 16:31:08,671 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:31:08,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:31:08,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:31:08,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:31:08,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:31:06" (1/3) ... [2025-02-05 16:31:08,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746bb6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:31:08, skipping insertion in model container [2025-02-05 16:31:08,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:06" (2/3) ... [2025-02-05 16:31:08,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746bb6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:31:08, skipping insertion in model container [2025-02-05 16:31:08,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:31:08" (3/3) ... [2025-02-05 16:31:08,685 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-02-05 16:31:08,706 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:31:08,712 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c that has 1 procedures, 457 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-05 16:31:08,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:31:08,798 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;@6160bba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:31:08,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-05 16:31:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 457 states, 452 states have (on average 1.8495575221238938) internal successors, (836), 456 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 16:31:08,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:08,815 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] [2025-02-05 16:31:08,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:08,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:08,818 INFO L85 PathProgramCache]: Analyzing trace with hash 692156089, now seen corresponding path program 1 times [2025-02-05 16:31:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:08,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310402619] [2025-02-05 16:31:08,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:08,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:08,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 16:31:08,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 16:31:08,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:08,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:09,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:09,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310402619] [2025-02-05 16:31:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310402619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:09,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:09,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:09,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962974969] [2025-02-05 16:31:09,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:09,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:09,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:09,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:09,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:09,177 INFO L87 Difference]: Start difference. First operand has 457 states, 452 states have (on average 1.8495575221238938) internal successors, (836), 456 states have internal predecessors, (836), 0 states have call successors, (0), 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 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:09,262 INFO L93 Difference]: Finished difference Result 713 states and 1249 transitions. [2025-02-05 16:31:09,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:09,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-02-05 16:31:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:09,278 INFO L225 Difference]: With dead ends: 713 [2025-02-05 16:31:09,279 INFO L226 Difference]: Without dead ends: 579 [2025-02-05 16:31:09,281 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-02-05 16:31:09,286 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 421 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:09,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1419 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-02-05 16:31:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 572. [2025-02-05 16:31:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 568 states have (on average 1.3433098591549295) internal successors, (763), 571 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 763 transitions. [2025-02-05 16:31:09,331 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 763 transitions. Word has length 51 [2025-02-05 16:31:09,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:09,331 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 763 transitions. [2025-02-05 16:31:09,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 763 transitions. [2025-02-05 16:31:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 16:31:09,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:09,334 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] [2025-02-05 16:31:09,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:31:09,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:09,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash 51738873, now seen corresponding path program 1 times [2025-02-05 16:31:09,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:09,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622476355] [2025-02-05 16:31:09,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:09,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:09,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 16:31:09,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 16:31:09,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:09,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:09,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:09,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622476355] [2025-02-05 16:31:09,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622476355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:09,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:09,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:09,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300994330] [2025-02-05 16:31:09,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:09,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:09,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:09,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:09,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:09,580 INFO L87 Difference]: Start difference. First operand 572 states and 763 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:09,888 INFO L93 Difference]: Finished difference Result 1153 states and 1594 transitions. [2025-02-05 16:31:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:09,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-02-05 16:31:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:09,892 INFO L225 Difference]: With dead ends: 1153 [2025-02-05 16:31:09,893 INFO L226 Difference]: Without dead ends: 698 [2025-02-05 16:31:09,894 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-02-05 16:31:09,897 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1742 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:09,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 392 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-02-05 16:31:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 692. [2025-02-05 16:31:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 688 states have (on average 1.3924418604651163) internal successors, (958), 691 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 958 transitions. [2025-02-05 16:31:09,929 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 958 transitions. Word has length 51 [2025-02-05 16:31:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:09,930 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 958 transitions. [2025-02-05 16:31:09,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 958 transitions. [2025-02-05 16:31:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:31:09,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:09,931 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] [2025-02-05 16:31:09,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:31:09,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:09,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2135862553, now seen corresponding path program 1 times [2025-02-05 16:31:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:09,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68386164] [2025-02-05 16:31:09,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:09,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:09,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:31:09,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:31:09,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:09,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:10,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:10,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68386164] [2025-02-05 16:31:10,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68386164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:10,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:10,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376635907] [2025-02-05 16:31:10,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:10,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:10,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:10,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:10,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:10,057 INFO L87 Difference]: Start difference. First operand 692 states and 958 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:10,335 INFO L93 Difference]: Finished difference Result 1389 states and 1957 transitions. [2025-02-05 16:31:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:10,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-05 16:31:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:10,338 INFO L225 Difference]: With dead ends: 1389 [2025-02-05 16:31:10,338 INFO L226 Difference]: Without dead ends: 847 [2025-02-05 16:31:10,339 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-02-05 16:31:10,339 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1518 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:10,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 359 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-02-05 16:31:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 838. [2025-02-05 16:31:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 834 states have (on average 1.39568345323741) internal successors, (1164), 837 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1164 transitions. [2025-02-05 16:31:10,358 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1164 transitions. Word has length 52 [2025-02-05 16:31:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:10,359 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1164 transitions. [2025-02-05 16:31:10,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:10,359 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1164 transitions. [2025-02-05 16:31:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:31:10,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:10,360 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] [2025-02-05 16:31:10,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:31:10,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:10,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:10,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1355098429, now seen corresponding path program 1 times [2025-02-05 16:31:10,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:10,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183441428] [2025-02-05 16:31:10,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:10,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:10,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:31:10,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:31:10,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:10,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:10,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:10,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183441428] [2025-02-05 16:31:10,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183441428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:10,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:10,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:10,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34462047] [2025-02-05 16:31:10,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:10,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:10,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:10,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:10,429 INFO L87 Difference]: Start difference. First operand 838 states and 1164 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:10,463 INFO L93 Difference]: Finished difference Result 2023 states and 2865 transitions. [2025-02-05 16:31:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:10,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-05 16:31:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:10,467 INFO L225 Difference]: With dead ends: 2023 [2025-02-05 16:31:10,467 INFO L226 Difference]: Without dead ends: 1377 [2025-02-05 16:31:10,468 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-02-05 16:31:10,468 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 323 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:10,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 851 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-02-05 16:31:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1365. [2025-02-05 16:31:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1361 states have (on average 1.3864805290227773) internal successors, (1887), 1364 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1887 transitions. [2025-02-05 16:31:10,496 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1887 transitions. Word has length 52 [2025-02-05 16:31:10,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:10,496 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 1887 transitions. [2025-02-05 16:31:10,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1887 transitions. [2025-02-05 16:31:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:31:10,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:10,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:10,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:31:10,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:10,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash 636112114, now seen corresponding path program 1 times [2025-02-05 16:31:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:10,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609492884] [2025-02-05 16:31:10,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:10,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:10,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:31:10,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:31:10,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:10,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:10,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609492884] [2025-02-05 16:31:10,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609492884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:10,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:10,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:10,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925244878] [2025-02-05 16:31:10,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:10,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:10,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:10,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:10,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:10,603 INFO L87 Difference]: Start difference. First operand 1365 states and 1887 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:10,816 INFO L93 Difference]: Finished difference Result 3432 states and 4855 transitions. [2025-02-05 16:31:10,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:10,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-05 16:31:10,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:10,823 INFO L225 Difference]: With dead ends: 3432 [2025-02-05 16:31:10,823 INFO L226 Difference]: Without dead ends: 2221 [2025-02-05 16:31:10,824 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-02-05 16:31:10,825 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 1465 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:10,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 353 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:31:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2025-02-05 16:31:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2215. [2025-02-05 16:31:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 2211 states have (on average 1.4084124830393487) internal successors, (3114), 2214 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3114 transitions. [2025-02-05 16:31:10,875 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3114 transitions. Word has length 53 [2025-02-05 16:31:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:10,875 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 3114 transitions. [2025-02-05 16:31:10,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3114 transitions. [2025-02-05 16:31:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:31:10,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:10,876 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] [2025-02-05 16:31:10,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:31:10,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:10,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:10,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1789828269, now seen corresponding path program 1 times [2025-02-05 16:31:10,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:10,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644474894] [2025-02-05 16:31:10,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:10,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:10,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:31:10,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:31:10,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:10,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:10,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:10,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644474894] [2025-02-05 16:31:10,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644474894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:10,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:10,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123826774] [2025-02-05 16:31:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:10,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:10,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:10,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:10,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:10,933 INFO L87 Difference]: Start difference. First operand 2215 states and 3114 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:10,969 INFO L93 Difference]: Finished difference Result 4627 states and 6581 transitions. [2025-02-05 16:31:10,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:10,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-05 16:31:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:10,978 INFO L225 Difference]: With dead ends: 4627 [2025-02-05 16:31:10,978 INFO L226 Difference]: Without dead ends: 2984 [2025-02-05 16:31:10,980 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-02-05 16:31:10,981 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 245 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 711 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-02-05 16:31:10,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 711 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2025-02-05 16:31:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2966. [2025-02-05 16:31:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2966 states, 2962 states have (on average 1.3902768399729912) internal successors, (4118), 2965 states have internal predecessors, (4118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 4118 transitions. [2025-02-05 16:31:11,028 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 4118 transitions. Word has length 53 [2025-02-05 16:31:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:11,028 INFO L471 AbstractCegarLoop]: Abstraction has 2966 states and 4118 transitions. [2025-02-05 16:31:11,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 4118 transitions. [2025-02-05 16:31:11,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:31:11,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:11,030 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] [2025-02-05 16:31:11,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:31:11,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:11,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1729728805, now seen corresponding path program 1 times [2025-02-05 16:31:11,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:11,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852899071] [2025-02-05 16:31:11,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:11,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:11,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:31:11,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:31:11,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:11,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:11,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:11,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852899071] [2025-02-05 16:31:11,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852899071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:11,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:11,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:31:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904787264] [2025-02-05 16:31:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:11,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:31:11,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:11,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:31:11,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:11,162 INFO L87 Difference]: Start difference. First operand 2966 states and 4118 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:11,491 INFO L93 Difference]: Finished difference Result 5867 states and 8228 transitions. [2025-02-05 16:31:11,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:31:11,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-05 16:31:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:11,503 INFO L225 Difference]: With dead ends: 5867 [2025-02-05 16:31:11,503 INFO L226 Difference]: Without dead ends: 4546 [2025-02-05 16:31:11,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:31:11,507 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1715 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:11,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 583 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2025-02-05 16:31:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2980. [2025-02-05 16:31:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2980 states, 2976 states have (on average 1.3897849462365592) internal successors, (4136), 2979 states have internal predecessors, (4136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4136 transitions. [2025-02-05 16:31:11,583 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4136 transitions. Word has length 54 [2025-02-05 16:31:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:11,583 INFO L471 AbstractCegarLoop]: Abstraction has 2980 states and 4136 transitions. [2025-02-05 16:31:11,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4136 transitions. [2025-02-05 16:31:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:31:11,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:11,585 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] [2025-02-05 16:31:11,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:31:11,586 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:11,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1813061798, now seen corresponding path program 1 times [2025-02-05 16:31:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:11,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940253008] [2025-02-05 16:31:11,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:11,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:11,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:31:11,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:31:11,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:11,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:11,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940253008] [2025-02-05 16:31:11,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940253008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:11,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:31:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727390946] [2025-02-05 16:31:11,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:11,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:31:11,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:11,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:31:11,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:11,754 INFO L87 Difference]: Start difference. First operand 2980 states and 4136 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:12,241 INFO L93 Difference]: Finished difference Result 6538 states and 9201 transitions. [2025-02-05 16:31:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:31:12,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-05 16:31:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:12,254 INFO L225 Difference]: With dead ends: 6538 [2025-02-05 16:31:12,255 INFO L226 Difference]: Without dead ends: 5420 [2025-02-05 16:31:12,257 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-02-05 16:31:12,257 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1840 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:12,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 618 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:31:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2025-02-05 16:31:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 3002. [2025-02-05 16:31:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2998 states have (on average 1.3899266177451635) internal successors, (4167), 3001 states have internal predecessors, (4167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 4167 transitions. [2025-02-05 16:31:12,319 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 4167 transitions. Word has length 54 [2025-02-05 16:31:12,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:12,320 INFO L471 AbstractCegarLoop]: Abstraction has 3002 states and 4167 transitions. [2025-02-05 16:31:12,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 4167 transitions. [2025-02-05 16:31:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:31:12,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:12,321 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] [2025-02-05 16:31:12,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:31:12,322 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:12,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 467795619, now seen corresponding path program 1 times [2025-02-05 16:31:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:12,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831303454] [2025-02-05 16:31:12,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:12,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:31:12,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:31:12,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:12,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:12,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:12,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831303454] [2025-02-05 16:31:12,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831303454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:12,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:12,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:31:12,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662688031] [2025-02-05 16:31:12,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:12,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:31:12,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:12,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:31:12,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:12,450 INFO L87 Difference]: Start difference. First operand 3002 states and 4167 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:12,828 INFO L93 Difference]: Finished difference Result 7320 states and 10266 transitions. [2025-02-05 16:31:12,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:31:12,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-05 16:31:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:12,845 INFO L225 Difference]: With dead ends: 7320 [2025-02-05 16:31:12,846 INFO L226 Difference]: Without dead ends: 6352 [2025-02-05 16:31:12,848 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-02-05 16:31:12,851 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1962 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:12,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 632 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6352 states. [2025-02-05 16:31:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6352 to 3036. [2025-02-05 16:31:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3032 states have (on average 1.3888522427440633) internal successors, (4211), 3035 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4211 transitions. [2025-02-05 16:31:12,927 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4211 transitions. Word has length 54 [2025-02-05 16:31:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:12,928 INFO L471 AbstractCegarLoop]: Abstraction has 3036 states and 4211 transitions. [2025-02-05 16:31:12,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4211 transitions. [2025-02-05 16:31:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:31:12,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:12,930 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] [2025-02-05 16:31:12,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:31:12,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:12,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1402362578, now seen corresponding path program 1 times [2025-02-05 16:31:12,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:12,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607923634] [2025-02-05 16:31:12,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:12,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:31:12,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:31:12,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:12,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:13,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-02-05 16:31:13,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:13,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607923634] [2025-02-05 16:31:13,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607923634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:13,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:13,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:31:13,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885824061] [2025-02-05 16:31:13,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:13,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:31:13,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:13,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:31:13,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:31:13,220 INFO L87 Difference]: Start difference. First operand 3036 states and 4211 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:13,637 INFO L93 Difference]: Finished difference Result 6220 states and 8782 transitions. [2025-02-05 16:31:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:31:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 16:31:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:13,652 INFO L225 Difference]: With dead ends: 6220 [2025-02-05 16:31:13,655 INFO L226 Difference]: Without dead ends: 4259 [2025-02-05 16:31:13,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:31:13,657 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1670 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:13,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 950 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2025-02-05 16:31:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 2949. [2025-02-05 16:31:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2945 states have (on average 1.3884550084889644) internal successors, (4089), 2948 states have internal predecessors, (4089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4089 transitions. [2025-02-05 16:31:13,690 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4089 transitions. Word has length 55 [2025-02-05 16:31:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:13,690 INFO L471 AbstractCegarLoop]: Abstraction has 2949 states and 4089 transitions. [2025-02-05 16:31:13,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4089 transitions. [2025-02-05 16:31:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:31:13,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:13,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] [2025-02-05 16:31:13,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:31:13,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:13,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash 496768009, now seen corresponding path program 1 times [2025-02-05 16:31:13,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:13,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896598760] [2025-02-05 16:31:13,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:13,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:13,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:31:13,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:31:13,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:13,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:13,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:13,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896598760] [2025-02-05 16:31:13,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896598760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:13,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:13,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:31:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139238734] [2025-02-05 16:31:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:13,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:31:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:13,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:31:13,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:31:13,917 INFO L87 Difference]: Start difference. First operand 2949 states and 4089 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:14,479 INFO L93 Difference]: Finished difference Result 5928 states and 8313 transitions. [2025-02-05 16:31:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:31:14,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 16:31:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:14,489 INFO L225 Difference]: With dead ends: 5928 [2025-02-05 16:31:14,491 INFO L226 Difference]: Without dead ends: 4121 [2025-02-05 16:31:14,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:31:14,494 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 1694 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:14,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 1195 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:31:14,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4121 states. [2025-02-05 16:31:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4121 to 2920. [2025-02-05 16:31:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2916 states have (on average 1.3882030178326474) internal successors, (4048), 2919 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4048 transitions. [2025-02-05 16:31:14,524 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4048 transitions. Word has length 55 [2025-02-05 16:31:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:14,524 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4048 transitions. [2025-02-05 16:31:14,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4048 transitions. [2025-02-05 16:31:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:31:14,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:14,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] [2025-02-05 16:31:14,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:31:14,526 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:14,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:14,527 INFO L85 PathProgramCache]: Analyzing trace with hash 761945362, now seen corresponding path program 1 times [2025-02-05 16:31:14,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:14,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622286806] [2025-02-05 16:31:14,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:14,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:14,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:31:14,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:31:14,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:14,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:14,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:14,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622286806] [2025-02-05 16:31:14,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622286806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:14,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:14,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:31:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188925240] [2025-02-05 16:31:14,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:14,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:31:14,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:14,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:31:14,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:31:14,696 INFO L87 Difference]: Start difference. First operand 2920 states and 4048 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:15,125 INFO L93 Difference]: Finished difference Result 4382 states and 6098 transitions. [2025-02-05 16:31:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:31:15,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 16:31:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:15,130 INFO L225 Difference]: With dead ends: 4382 [2025-02-05 16:31:15,130 INFO L226 Difference]: Without dead ends: 4377 [2025-02-05 16:31:15,131 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-02-05 16:31:15,132 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 2021 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2021 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:15,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2021 Valid, 1069 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2025-02-05 16:31:15,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 2920. [2025-02-05 16:31:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2916 states have (on average 1.387517146776406) internal successors, (4046), 2919 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4046 transitions. [2025-02-05 16:31:15,161 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4046 transitions. Word has length 55 [2025-02-05 16:31:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:15,162 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4046 transitions. [2025-02-05 16:31:15,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4046 transitions. [2025-02-05 16:31:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:31:15,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:15,163 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] [2025-02-05 16:31:15,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:31:15,164 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:15,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash 930432667, now seen corresponding path program 1 times [2025-02-05 16:31:15,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:15,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556924348] [2025-02-05 16:31:15,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:15,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:31:15,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:31:15,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:15,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:15,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556924348] [2025-02-05 16:31:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556924348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:15,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:15,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108693607] [2025-02-05 16:31:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:15,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:15,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:15,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:15,205 INFO L87 Difference]: Start difference. First operand 2920 states and 4046 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:15,227 INFO L93 Difference]: Finished difference Result 4010 states and 5564 transitions. [2025-02-05 16:31:15,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:15,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 16:31:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:15,231 INFO L225 Difference]: With dead ends: 4010 [2025-02-05 16:31:15,231 INFO L226 Difference]: Without dead ends: 2911 [2025-02-05 16:31:15,246 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-02-05 16:31:15,247 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 259 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:15,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 813 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2025-02-05 16:31:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2905. [2025-02-05 16:31:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2905 states, 2901 states have (on average 1.3602206135815236) internal successors, (3946), 2904 states have internal predecessors, (3946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 3946 transitions. [2025-02-05 16:31:15,281 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 3946 transitions. Word has length 56 [2025-02-05 16:31:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:15,282 INFO L471 AbstractCegarLoop]: Abstraction has 2905 states and 3946 transitions. [2025-02-05 16:31:15,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 3946 transitions. [2025-02-05 16:31:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:31:15,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:15,283 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] [2025-02-05 16:31:15,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:31:15,284 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:15,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash 125999415, now seen corresponding path program 1 times [2025-02-05 16:31:15,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:15,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9100568] [2025-02-05 16:31:15,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:15,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:15,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:31:15,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:31:15,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:15,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:15,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:15,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9100568] [2025-02-05 16:31:15,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9100568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:15,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:15,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139652239] [2025-02-05 16:31:15,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:15,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:15,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:15,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:15,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:15,337 INFO L87 Difference]: Start difference. First operand 2905 states and 3946 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:15,361 INFO L93 Difference]: Finished difference Result 4240 states and 5806 transitions. [2025-02-05 16:31:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:15,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 16:31:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:15,365 INFO L225 Difference]: With dead ends: 4240 [2025-02-05 16:31:15,365 INFO L226 Difference]: Without dead ends: 2911 [2025-02-05 16:31:15,366 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-02-05 16:31:15,366 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 240 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 811 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-02-05 16:31:15,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 811 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2025-02-05 16:31:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2905. [2025-02-05 16:31:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2905 states, 2901 states have (on average 1.3478110996208204) internal successors, (3910), 2904 states have internal predecessors, (3910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 3910 transitions. [2025-02-05 16:31:15,396 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 3910 transitions. Word has length 56 [2025-02-05 16:31:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:15,396 INFO L471 AbstractCegarLoop]: Abstraction has 2905 states and 3910 transitions. [2025-02-05 16:31:15,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 3910 transitions. [2025-02-05 16:31:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:31:15,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:15,398 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] [2025-02-05 16:31:15,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:31:15,398 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:15,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2108801605, now seen corresponding path program 1 times [2025-02-05 16:31:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:15,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229457662] [2025-02-05 16:31:15,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:15,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:31:15,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:31:15,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:15,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:15,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:15,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229457662] [2025-02-05 16:31:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229457662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:15,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:15,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867248959] [2025-02-05 16:31:15,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:15,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:15,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:15,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:15,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:15,448 INFO L87 Difference]: Start difference. First operand 2905 states and 3910 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:15,480 INFO L93 Difference]: Finished difference Result 4163 states and 5648 transitions. [2025-02-05 16:31:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:15,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 16:31:15,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:15,483 INFO L225 Difference]: With dead ends: 4163 [2025-02-05 16:31:15,483 INFO L226 Difference]: Without dead ends: 2912 [2025-02-05 16:31:15,484 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-02-05 16:31:15,486 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 224 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:15,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 809 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2025-02-05 16:31:15,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 2905. [2025-02-05 16:31:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2905 states, 2901 states have (on average 1.3340227507755946) internal successors, (3870), 2904 states have internal predecessors, (3870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 3870 transitions. [2025-02-05 16:31:15,506 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 3870 transitions. Word has length 56 [2025-02-05 16:31:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:15,506 INFO L471 AbstractCegarLoop]: Abstraction has 2905 states and 3870 transitions. [2025-02-05 16:31:15,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 3870 transitions. [2025-02-05 16:31:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:31:15,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:15,508 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] [2025-02-05 16:31:15,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:31:15,509 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:15,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash 369426516, now seen corresponding path program 1 times [2025-02-05 16:31:15,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:15,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728893624] [2025-02-05 16:31:15,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:15,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:15,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:31:15,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:31:15,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:15,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:15,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:15,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:15,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728893624] [2025-02-05 16:31:15,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728893624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:15,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:15,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:15,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929451095] [2025-02-05 16:31:15,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:15,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:15,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:15,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:15,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:15,544 INFO L87 Difference]: Start difference. First operand 2905 states and 3870 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:15,589 INFO L93 Difference]: Finished difference Result 4583 states and 6152 transitions. [2025-02-05 16:31:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:15,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-02-05 16:31:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:15,593 INFO L225 Difference]: With dead ends: 4583 [2025-02-05 16:31:15,594 INFO L226 Difference]: Without dead ends: 3323 [2025-02-05 16:31:15,595 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-02-05 16:31:15,595 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 324 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:15,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 532 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2025-02-05 16:31:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 2723. [2025-02-05 16:31:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2719 states have (on average 1.3365207796984184) internal successors, (3634), 2722 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3634 transitions. [2025-02-05 16:31:15,643 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3634 transitions. Word has length 57 [2025-02-05 16:31:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:15,644 INFO L471 AbstractCegarLoop]: Abstraction has 2723 states and 3634 transitions. [2025-02-05 16:31:15,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3634 transitions. [2025-02-05 16:31:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 16:31:15,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:15,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:15,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:31:15,646 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:15,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:15,647 INFO L85 PathProgramCache]: Analyzing trace with hash 522032144, now seen corresponding path program 1 times [2025-02-05 16:31:15,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:15,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260505143] [2025-02-05 16:31:15,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:15,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:15,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:31:15,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:31:15,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:15,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:15,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:15,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260505143] [2025-02-05 16:31:15,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260505143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:15,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:15,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:15,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493118846] [2025-02-05 16:31:15,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:15,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:15,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:15,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:15,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:15,687 INFO L87 Difference]: Start difference. First operand 2723 states and 3634 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:15,744 INFO L93 Difference]: Finished difference Result 5002 states and 6723 transitions. [2025-02-05 16:31:15,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:15,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 16:31:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:15,749 INFO L225 Difference]: With dead ends: 5002 [2025-02-05 16:31:15,749 INFO L226 Difference]: Without dead ends: 3341 [2025-02-05 16:31:15,751 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-02-05 16:31:15,752 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 300 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:15,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 459 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3341 states. [2025-02-05 16:31:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3341 to 2587. [2025-02-05 16:31:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 2583 states have (on average 1.3387533875338753) internal successors, (3458), 2586 states have internal predecessors, (3458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 3458 transitions. [2025-02-05 16:31:15,774 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 3458 transitions. Word has length 58 [2025-02-05 16:31:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:15,774 INFO L471 AbstractCegarLoop]: Abstraction has 2587 states and 3458 transitions. [2025-02-05 16:31:15,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3458 transitions. [2025-02-05 16:31:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 16:31:15,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:15,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:15,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:31:15,777 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:15,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1877891216, now seen corresponding path program 1 times [2025-02-05 16:31:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927707271] [2025-02-05 16:31:15,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:15,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:31:15,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:31:15,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:15,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:16,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:16,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927707271] [2025-02-05 16:31:16,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927707271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:16,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:16,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:31:16,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966470767] [2025-02-05 16:31:16,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:16,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:31:16,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:16,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:31:16,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:31:16,250 INFO L87 Difference]: Start difference. First operand 2587 states and 3458 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:16,798 INFO L93 Difference]: Finished difference Result 4530 states and 6118 transitions. [2025-02-05 16:31:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:31:16,798 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 16:31:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:16,804 INFO L225 Difference]: With dead ends: 4530 [2025-02-05 16:31:16,804 INFO L226 Difference]: Without dead ends: 4162 [2025-02-05 16:31:16,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:31:16,806 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1830 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1830 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:16,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1830 Valid, 1571 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2025-02-05 16:31:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 2524. [2025-02-05 16:31:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2524 states, 2522 states have (on average 1.3409992069785883) internal successors, (3382), 2523 states have internal predecessors, (3382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 3382 transitions. [2025-02-05 16:31:16,830 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 3382 transitions. Word has length 58 [2025-02-05 16:31:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:16,830 INFO L471 AbstractCegarLoop]: Abstraction has 2524 states and 3382 transitions. [2025-02-05 16:31:16,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 3382 transitions. [2025-02-05 16:31:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 16:31:16,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:16,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:16,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:31:16,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:16,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1984154437, now seen corresponding path program 1 times [2025-02-05 16:31:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624159341] [2025-02-05 16:31:16,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:16,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:31:16,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:31:16,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:16,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:17,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:17,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624159341] [2025-02-05 16:31:17,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624159341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:17,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:17,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:31:17,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608450830] [2025-02-05 16:31:17,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:17,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:31:17,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:17,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:31:17,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:31:17,330 INFO L87 Difference]: Start difference. First operand 2524 states and 3382 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:18,126 INFO L93 Difference]: Finished difference Result 5238 states and 7121 transitions. [2025-02-05 16:31:18,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 16:31:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 16:31:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:18,133 INFO L225 Difference]: With dead ends: 5238 [2025-02-05 16:31:18,133 INFO L226 Difference]: Without dead ends: 4832 [2025-02-05 16:31:18,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:31:18,135 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 1714 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:18,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 2521 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:31:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2025-02-05 16:31:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 2478. [2025-02-05 16:31:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2477 states have (on average 1.342349616471538) internal successors, (3325), 2477 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3325 transitions. [2025-02-05 16:31:18,176 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3325 transitions. Word has length 58 [2025-02-05 16:31:18,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:18,176 INFO L471 AbstractCegarLoop]: Abstraction has 2478 states and 3325 transitions. [2025-02-05 16:31:18,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3325 transitions. [2025-02-05 16:31:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:31:18,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:18,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:18,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:31:18,179 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:18,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:18,180 INFO L85 PathProgramCache]: Analyzing trace with hash 994384137, now seen corresponding path program 1 times [2025-02-05 16:31:18,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:18,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979877114] [2025-02-05 16:31:18,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:18,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:18,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:31:18,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:31:18,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:18,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:18,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:18,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979877114] [2025-02-05 16:31:18,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979877114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:18,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:18,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:18,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181221711] [2025-02-05 16:31:18,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:18,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:18,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:18,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:18,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:18,270 INFO L87 Difference]: Start difference. First operand 2478 states and 3325 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:18,338 INFO L93 Difference]: Finished difference Result 6001 states and 8265 transitions. [2025-02-05 16:31:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:18,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 16:31:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:18,345 INFO L225 Difference]: With dead ends: 6001 [2025-02-05 16:31:18,345 INFO L226 Difference]: Without dead ends: 4490 [2025-02-05 16:31:18,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-02-05 16:31:18,348 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1041 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:18,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 761 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2025-02-05 16:31:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3841. [2025-02-05 16:31:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3841 states, 3840 states have (on average 1.3432291666666667) internal successors, (5158), 3840 states have internal predecessors, (5158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5158 transitions. [2025-02-05 16:31:18,386 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5158 transitions. Word has length 68 [2025-02-05 16:31:18,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:18,386 INFO L471 AbstractCegarLoop]: Abstraction has 3841 states and 5158 transitions. [2025-02-05 16:31:18,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5158 transitions. [2025-02-05 16:31:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:31:18,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:18,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:18,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:31:18,390 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:18,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:18,390 INFO L85 PathProgramCache]: Analyzing trace with hash 790723175, now seen corresponding path program 1 times [2025-02-05 16:31:18,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:18,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145134562] [2025-02-05 16:31:18,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:18,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:18,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:31:18,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:31:18,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:18,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:18,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:18,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145134562] [2025-02-05 16:31:18,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145134562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:18,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:18,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:18,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039104470] [2025-02-05 16:31:18,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:18,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:18,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:18,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:18,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:18,474 INFO L87 Difference]: Start difference. First operand 3841 states and 5158 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:18,527 INFO L93 Difference]: Finished difference Result 3847 states and 5161 transitions. [2025-02-05 16:31:18,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:18,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 16:31:18,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:18,532 INFO L225 Difference]: With dead ends: 3847 [2025-02-05 16:31:18,532 INFO L226 Difference]: Without dead ends: 3376 [2025-02-05 16:31:18,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:18,533 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 672 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:18,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 756 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2025-02-05 16:31:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3372. [2025-02-05 16:31:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3372 states, 3371 states have (on average 1.3479679620290714) internal successors, (4544), 3371 states have internal predecessors, (4544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4544 transitions. [2025-02-05 16:31:18,560 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 4544 transitions. Word has length 69 [2025-02-05 16:31:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:18,562 INFO L471 AbstractCegarLoop]: Abstraction has 3372 states and 4544 transitions. [2025-02-05 16:31:18,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 4544 transitions. [2025-02-05 16:31:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:31:18,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:18,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:18,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:31:18,565 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:18,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:18,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1632978968, now seen corresponding path program 1 times [2025-02-05 16:31:18,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:18,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992453649] [2025-02-05 16:31:18,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:18,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:18,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:31:18,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:31:18,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:18,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:18,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:18,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992453649] [2025-02-05 16:31:18,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992453649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:18,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:18,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:18,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604232843] [2025-02-05 16:31:18,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:18,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:18,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:18,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:18,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:18,659 INFO L87 Difference]: Start difference. First operand 3372 states and 4544 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:18,686 INFO L93 Difference]: Finished difference Result 7984 states and 10890 transitions. [2025-02-05 16:31:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:18,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:31:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:18,695 INFO L225 Difference]: With dead ends: 7984 [2025-02-05 16:31:18,696 INFO L226 Difference]: Without dead ends: 5374 [2025-02-05 16:31:18,698 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-02-05 16:31:18,699 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 122 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:18,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 561 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5374 states. [2025-02-05 16:31:18,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5374 to 5056. [2025-02-05 16:31:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5056 states, 5055 states have (on average 1.3404549950544016) internal successors, (6776), 5055 states have internal predecessors, (6776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 6776 transitions. [2025-02-05 16:31:18,742 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 6776 transitions. Word has length 70 [2025-02-05 16:31:18,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:18,742 INFO L471 AbstractCegarLoop]: Abstraction has 5056 states and 6776 transitions. [2025-02-05 16:31:18,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 6776 transitions. [2025-02-05 16:31:18,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:31:18,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:18,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:18,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:31:18,745 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:18,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash 106887474, now seen corresponding path program 1 times [2025-02-05 16:31:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:18,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108352680] [2025-02-05 16:31:18,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:18,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:18,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:31:18,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:31:18,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:18,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:18,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108352680] [2025-02-05 16:31:18,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108352680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:18,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:18,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522972423] [2025-02-05 16:31:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:18,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:18,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:18,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:18,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:18,820 INFO L87 Difference]: Start difference. First operand 5056 states and 6776 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:18,860 INFO L93 Difference]: Finished difference Result 13176 states and 17878 transitions. [2025-02-05 16:31:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:18,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-05 16:31:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:18,872 INFO L225 Difference]: With dead ends: 13176 [2025-02-05 16:31:18,872 INFO L226 Difference]: Without dead ends: 8916 [2025-02-05 16:31:18,878 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-02-05 16:31:18,878 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 111 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:18,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 549 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8916 states. [2025-02-05 16:31:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8916 to 8178. [2025-02-05 16:31:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8178 states, 8177 states have (on average 1.3410786351962822) internal successors, (10966), 8177 states have internal predecessors, (10966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 10966 transitions. [2025-02-05 16:31:18,960 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 10966 transitions. Word has length 71 [2025-02-05 16:31:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:18,960 INFO L471 AbstractCegarLoop]: Abstraction has 8178 states and 10966 transitions. [2025-02-05 16:31:18,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 10966 transitions. [2025-02-05 16:31:18,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:31:18,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:18,963 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] [2025-02-05 16:31:18,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:31:18,963 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:18,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:18,964 INFO L85 PathProgramCache]: Analyzing trace with hash 643974055, now seen corresponding path program 1 times [2025-02-05 16:31:18,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:18,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861312910] [2025-02-05 16:31:18,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:18,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:31:18,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:31:18,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:18,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:19,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-02-05 16:31:19,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:19,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861312910] [2025-02-05 16:31:19,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861312910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:19,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:19,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:19,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889416834] [2025-02-05 16:31:19,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:19,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:19,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:19,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:19,046 INFO L87 Difference]: Start difference. First operand 8178 states and 10966 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:19,140 INFO L93 Difference]: Finished difference Result 22142 states and 29840 transitions. [2025-02-05 16:31:19,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:19,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-02-05 16:31:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:19,161 INFO L225 Difference]: With dead ends: 22142 [2025-02-05 16:31:19,161 INFO L226 Difference]: Without dead ends: 14760 [2025-02-05 16:31:19,168 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-02-05 16:31:19,169 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 98 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:19,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 533 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14760 states. [2025-02-05 16:31:19,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14760 to 13542. [2025-02-05 16:31:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13542 states, 13541 states have (on average 1.334170297614652) internal successors, (18066), 13541 states have internal predecessors, (18066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13542 states to 13542 states and 18066 transitions. [2025-02-05 16:31:19,293 INFO L78 Accepts]: Start accepts. Automaton has 13542 states and 18066 transitions. Word has length 73 [2025-02-05 16:31:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:19,293 INFO L471 AbstractCegarLoop]: Abstraction has 13542 states and 18066 transitions. [2025-02-05 16:31:19,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 13542 states and 18066 transitions. [2025-02-05 16:31:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:31:19,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:19,296 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-02-05 16:31:19,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:31:19,296 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:19,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:19,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1143784379, now seen corresponding path program 1 times [2025-02-05 16:31:19,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:19,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936460530] [2025-02-05 16:31:19,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:19,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:19,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:31:19,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:31:19,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:19,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:19,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936460530] [2025-02-05 16:31:19,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936460530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:19,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:19,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:31:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968327144] [2025-02-05 16:31:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:19,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:31:19,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:19,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:31:19,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:31:19,464 INFO L87 Difference]: Start difference. First operand 13542 states and 18066 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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-02-05 16:31:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:19,556 INFO L93 Difference]: Finished difference Result 14888 states and 19859 transitions. [2025-02-05 16:31:19,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:31:19,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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-02-05 16:31:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:19,581 INFO L225 Difference]: With dead ends: 14888 [2025-02-05 16:31:19,581 INFO L226 Difference]: Without dead ends: 14886 [2025-02-05 16:31:19,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:31:19,585 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:19,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1299 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:19,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14886 states. [2025-02-05 16:31:19,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14886 to 14886. [2025-02-05 16:31:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14886 states, 14885 states have (on average 1.3039973127309372) internal successors, (19410), 14885 states have internal predecessors, (19410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14886 states to 14886 states and 19410 transitions. [2025-02-05 16:31:19,723 INFO L78 Accepts]: Start accepts. Automaton has 14886 states and 19410 transitions. Word has length 75 [2025-02-05 16:31:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:19,723 INFO L471 AbstractCegarLoop]: Abstraction has 14886 states and 19410 transitions. [2025-02-05 16:31:19,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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-02-05 16:31:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 14886 states and 19410 transitions. [2025-02-05 16:31:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:31:19,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:19,726 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-02-05 16:31:19,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:31:19,726 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:19,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:19,727 INFO L85 PathProgramCache]: Analyzing trace with hash -949780693, now seen corresponding path program 1 times [2025-02-05 16:31:19,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:19,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8600267] [2025-02-05 16:31:19,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:19,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:19,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:31:19,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:31:19,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:19,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:19,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:19,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8600267] [2025-02-05 16:31:19,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8600267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:19,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:19,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:19,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13407610] [2025-02-05 16:31:19,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:19,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:19,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:19,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:19,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:19,764 INFO L87 Difference]: Start difference. First operand 14886 states and 19410 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-02-05 16:31:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:19,833 INFO L93 Difference]: Finished difference Result 36082 states and 47004 transitions. [2025-02-05 16:31:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:19,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-02-05 16:31:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:19,861 INFO L225 Difference]: With dead ends: 36082 [2025-02-05 16:31:19,861 INFO L226 Difference]: Without dead ends: 21992 [2025-02-05 16:31:19,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:19,875 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 196 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:19,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 404 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21992 states. [2025-02-05 16:31:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21992 to 21990. [2025-02-05 16:31:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21990 states, 21989 states have (on average 1.2865523670926373) internal successors, (28290), 21989 states have internal predecessors, (28290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21990 states to 21990 states and 28290 transitions. [2025-02-05 16:31:20,167 INFO L78 Accepts]: Start accepts. Automaton has 21990 states and 28290 transitions. Word has length 76 [2025-02-05 16:31:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:20,167 INFO L471 AbstractCegarLoop]: Abstraction has 21990 states and 28290 transitions. [2025-02-05 16:31:20,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-02-05 16:31:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 21990 states and 28290 transitions. [2025-02-05 16:31:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:31:20,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:20,170 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-02-05 16:31:20,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:31:20,171 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:20,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:20,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2095661317, now seen corresponding path program 1 times [2025-02-05 16:31:20,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:20,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708983112] [2025-02-05 16:31:20,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:20,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:31:20,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:31:20,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:20,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708983112] [2025-02-05 16:31:20,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708983112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:20,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:20,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484685414] [2025-02-05 16:31:20,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:20,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:20,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:20,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:20,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:20,258 INFO L87 Difference]: Start difference. First operand 21990 states and 28290 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-02-05 16:31:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:20,365 INFO L93 Difference]: Finished difference Result 32438 states and 41982 transitions. [2025-02-05 16:31:20,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:20,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-02-05 16:31:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:20,404 INFO L225 Difference]: With dead ends: 32438 [2025-02-05 16:31:20,404 INFO L226 Difference]: Without dead ends: 27576 [2025-02-05 16:31:20,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:20,418 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 643 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:20,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 833 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27576 states. [2025-02-05 16:31:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27576 to 25134. [2025-02-05 16:31:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25134 states, 25133 states have (on average 1.283969283412247) internal successors, (32270), 25133 states have internal predecessors, (32270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25134 states to 25134 states and 32270 transitions. [2025-02-05 16:31:20,912 INFO L78 Accepts]: Start accepts. Automaton has 25134 states and 32270 transitions. Word has length 77 [2025-02-05 16:31:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:20,912 INFO L471 AbstractCegarLoop]: Abstraction has 25134 states and 32270 transitions. [2025-02-05 16:31:20,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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-02-05 16:31:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 25134 states and 32270 transitions. [2025-02-05 16:31:20,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:31:20,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:20,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:20,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:31:20,920 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:20,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:20,921 INFO L85 PathProgramCache]: Analyzing trace with hash -231795413, now seen corresponding path program 1 times [2025-02-05 16:31:20,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:20,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102986864] [2025-02-05 16:31:20,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:20,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:20,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:31:20,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:31:20,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:20,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:21,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:21,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102986864] [2025-02-05 16:31:21,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102986864] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:21,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329794998] [2025-02-05 16:31:21,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:21,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:21,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:21,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:31:21,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:31:21,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:31:21,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:31:21,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:21,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:21,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:31:21,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:31:21,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:31:21,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329794998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:21,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:31:21,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2025-02-05 16:31:21,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514736127] [2025-02-05 16:31:21,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:21,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:31:21,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:21,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:31:21,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:31:21,539 INFO L87 Difference]: Start difference. First operand 25134 states and 32270 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:22,130 INFO L93 Difference]: Finished difference Result 63654 states and 81885 transitions. [2025-02-05 16:31:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:31:22,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:31:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:22,192 INFO L225 Difference]: With dead ends: 63654 [2025-02-05 16:31:22,192 INFO L226 Difference]: Without dead ends: 47224 [2025-02-05 16:31:22,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:31:22,216 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1166 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:22,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 859 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:22,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47224 states. [2025-02-05 16:31:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47224 to 25002. [2025-02-05 16:31:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25002 states, 25001 states have (on average 1.2843486260549577) internal successors, (32110), 25001 states have internal predecessors, (32110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25002 states to 25002 states and 32110 transitions. [2025-02-05 16:31:22,750 INFO L78 Accepts]: Start accepts. Automaton has 25002 states and 32110 transitions. Word has length 95 [2025-02-05 16:31:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:22,750 INFO L471 AbstractCegarLoop]: Abstraction has 25002 states and 32110 transitions. [2025-02-05 16:31:22,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 25002 states and 32110 transitions. [2025-02-05 16:31:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:31:22,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:22,758 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:22,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:31:22,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-05 16:31:22,959 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:22,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:22,960 INFO L85 PathProgramCache]: Analyzing trace with hash 104546868, now seen corresponding path program 1 times [2025-02-05 16:31:22,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:22,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575064230] [2025-02-05 16:31:22,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:22,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:31:22,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:31:22,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:22,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:23,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:23,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575064230] [2025-02-05 16:31:23,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575064230] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:23,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048558396] [2025-02-05 16:31:23,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:23,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:23,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:23,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:31:23,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:31:23,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:31:23,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:31:23,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:23,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:23,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 16:31:23,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:23,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:31:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:24,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048558396] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:31:24,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:31:24,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 19 [2025-02-05 16:31:24,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292275524] [2025-02-05 16:31:24,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:31:24,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:31:24,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:24,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:31:24,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:31:24,553 INFO L87 Difference]: Start difference. First operand 25002 states and 32110 transitions. Second operand has 19 states, 19 states have (on average 13.052631578947368) internal successors, (248), 19 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:26,394 INFO L93 Difference]: Finished difference Result 116125 states and 149242 transitions. [2025-02-05 16:31:26,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-02-05 16:31:26,395 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.052631578947368) internal successors, (248), 19 states have internal predecessors, (248), 0 states have call successors, (0), 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-02-05 16:31:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:26,510 INFO L225 Difference]: With dead ends: 116125 [2025-02-05 16:31:26,511 INFO L226 Difference]: Without dead ends: 91787 [2025-02-05 16:31:26,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1060, Invalid=3496, Unknown=0, NotChecked=0, Total=4556 [2025-02-05 16:31:26,542 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 3145 mSDsluCounter, 4547 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3145 SdHoareTripleChecker+Valid, 5261 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:26,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3145 Valid, 5261 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:31:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91787 states. [2025-02-05 16:31:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91787 to 66950. [2025-02-05 16:31:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66950 states, 66949 states have (on average 1.278316330341006) internal successors, (85582), 66949 states have internal predecessors, (85582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66950 states to 66950 states and 85582 transitions. [2025-02-05 16:31:27,603 INFO L78 Accepts]: Start accepts. Automaton has 66950 states and 85582 transitions. Word has length 95 [2025-02-05 16:31:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:27,604 INFO L471 AbstractCegarLoop]: Abstraction has 66950 states and 85582 transitions. [2025-02-05 16:31:27,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.052631578947368) internal successors, (248), 19 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 66950 states and 85582 transitions. [2025-02-05 16:31:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:31:27,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:27,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:27,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:31:27,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-05 16:31:27,813 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:27,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:27,813 INFO L85 PathProgramCache]: Analyzing trace with hash -528809163, now seen corresponding path program 1 times [2025-02-05 16:31:27,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:27,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115532083] [2025-02-05 16:31:27,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:27,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:27,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:31:27,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:31:27,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:27,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:27,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:27,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115532083] [2025-02-05 16:31:27,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115532083] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:27,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660184967] [2025-02-05 16:31:27,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:27,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:27,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:27,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:31:27,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:31:28,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:31:28,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:31:28,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:28,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:28,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:31:28,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:28,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:31:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660184967] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:31:28,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:31:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-02-05 16:31:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23611336] [2025-02-05 16:31:28,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:31:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:31:28,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:28,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:31:28,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:31:28,649 INFO L87 Difference]: Start difference. First operand 66950 states and 85582 transitions. Second operand has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:29,332 INFO L93 Difference]: Finished difference Result 135780 states and 173373 transitions. [2025-02-05 16:31:29,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:31:29,334 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 0 states have call successors, (0), 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-02-05 16:31:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:29,416 INFO L225 Difference]: With dead ends: 135780 [2025-02-05 16:31:29,416 INFO L226 Difference]: Without dead ends: 69398 [2025-02-05 16:31:29,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:31:29,458 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 2172 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:29,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 1102 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:29,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69398 states. [2025-02-05 16:31:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69398 to 66438. [2025-02-05 16:31:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66438 states, 66437 states have (on average 1.2505682074747506) internal successors, (83084), 66437 states have internal predecessors, (83084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66438 states to 66438 states and 83084 transitions. [2025-02-05 16:31:30,295 INFO L78 Accepts]: Start accepts. Automaton has 66438 states and 83084 transitions. Word has length 96 [2025-02-05 16:31:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:30,295 INFO L471 AbstractCegarLoop]: Abstraction has 66438 states and 83084 transitions. [2025-02-05 16:31:30,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 66438 states and 83084 transitions. [2025-02-05 16:31:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:31:30,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:30,302 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:30,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:31:30,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:30,507 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:30,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1106236589, now seen corresponding path program 1 times [2025-02-05 16:31:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:30,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949373699] [2025-02-05 16:31:30,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:30,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:30,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:31:30,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:31:30,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:30,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:30,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:30,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949373699] [2025-02-05 16:31:30,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949373699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:30,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:30,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:30,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322648191] [2025-02-05 16:31:30,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:30,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:30,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:30,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:30,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:30,600 INFO L87 Difference]: Start difference. First operand 66438 states and 83084 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-02-05 16:31:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:30,991 INFO L93 Difference]: Finished difference Result 134530 states and 167931 transitions. [2025-02-05 16:31:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:31:30,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-02-05 16:31:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:31,069 INFO L225 Difference]: With dead ends: 134530 [2025-02-05 16:31:31,070 INFO L226 Difference]: Without dead ends: 68748 [2025-02-05 16:31:31,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:31,119 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 485 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:31,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 455 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68748 states. [2025-02-05 16:31:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68748 to 64098. [2025-02-05 16:31:31,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64098 states, 64097 states have (on average 1.2278733794093328) internal successors, (78703), 64097 states have internal predecessors, (78703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64098 states to 64098 states and 78703 transitions. [2025-02-05 16:31:32,028 INFO L78 Accepts]: Start accepts. Automaton has 64098 states and 78703 transitions. Word has length 97 [2025-02-05 16:31:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:32,029 INFO L471 AbstractCegarLoop]: Abstraction has 64098 states and 78703 transitions. [2025-02-05 16:31:32,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-02-05 16:31:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 64098 states and 78703 transitions. [2025-02-05 16:31:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:31:32,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:32,036 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:32,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:31:32,036 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:32,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:32,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1120947418, now seen corresponding path program 1 times [2025-02-05 16:31:32,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:32,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361024300] [2025-02-05 16:31:32,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:32,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:32,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:31:32,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:31:32,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:32,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:31:32,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:32,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361024300] [2025-02-05 16:31:32,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361024300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:32,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:32,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:32,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233096406] [2025-02-05 16:31:32,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:32,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:32,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:32,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:32,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:32,104 INFO L87 Difference]: Start difference. First operand 64098 states and 78703 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:32,274 INFO L93 Difference]: Finished difference Result 86096 states and 106180 transitions. [2025-02-05 16:31:32,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:32,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-02-05 16:31:32,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:32,350 INFO L225 Difference]: With dead ends: 86096 [2025-02-05 16:31:32,350 INFO L226 Difference]: Without dead ends: 73122 [2025-02-05 16:31:32,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:32,378 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 585 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:32,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 773 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:32,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73122 states. [2025-02-05 16:31:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73122 to 71194. [2025-02-05 16:31:33,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71194 states, 71193 states have (on average 1.223406795611928) internal successors, (87098), 71193 states have internal predecessors, (87098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71194 states to 71194 states and 87098 transitions. [2025-02-05 16:31:33,417 INFO L78 Accepts]: Start accepts. Automaton has 71194 states and 87098 transitions. Word has length 100 [2025-02-05 16:31:33,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:33,418 INFO L471 AbstractCegarLoop]: Abstraction has 71194 states and 87098 transitions. [2025-02-05 16:31:33,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 71194 states and 87098 transitions. [2025-02-05 16:31:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 16:31:33,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:33,430 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:33,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:31:33,430 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:33,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1463155010, now seen corresponding path program 1 times [2025-02-05 16:31:33,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:33,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636982683] [2025-02-05 16:31:33,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:33,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:33,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 16:31:33,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 16:31:33,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:33,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:33,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:33,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636982683] [2025-02-05 16:31:33,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636982683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:33,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:33,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:33,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491347585] [2025-02-05 16:31:33,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:33,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:33,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:33,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:33,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:33,540 INFO L87 Difference]: Start difference. First operand 71194 states and 87098 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 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-02-05 16:31:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:33,805 INFO L93 Difference]: Finished difference Result 96602 states and 118940 transitions. [2025-02-05 16:31:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:33,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 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-02-05 16:31:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:33,892 INFO L225 Difference]: With dead ends: 96602 [2025-02-05 16:31:33,893 INFO L226 Difference]: Without dead ends: 81310 [2025-02-05 16:31:33,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:33,924 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 584 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:33,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 770 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81310 states. [2025-02-05 16:31:34,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81310 to 79382. [2025-02-05 16:31:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79382 states, 79381 states have (on average 1.218704727831597) internal successors, (96742), 79381 states have internal predecessors, (96742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79382 states to 79382 states and 96742 transitions. [2025-02-05 16:31:34,819 INFO L78 Accepts]: Start accepts. Automaton has 79382 states and 96742 transitions. Word has length 101 [2025-02-05 16:31:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:34,819 INFO L471 AbstractCegarLoop]: Abstraction has 79382 states and 96742 transitions. [2025-02-05 16:31:34,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 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-02-05 16:31:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 79382 states and 96742 transitions. [2025-02-05 16:31:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 16:31:34,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:34,828 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:34,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:31:34,829 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:34,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1380772824, now seen corresponding path program 1 times [2025-02-05 16:31:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:34,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097889764] [2025-02-05 16:31:34,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:34,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:31:34,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:31:34,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:34,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:31:34,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:34,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097889764] [2025-02-05 16:31:34,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097889764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:34,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:34,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:31:34,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997281711] [2025-02-05 16:31:34,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:34,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:31:34,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:34,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:31:34,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:34,916 INFO L87 Difference]: Start difference. First operand 79382 states and 96742 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:35,628 INFO L93 Difference]: Finished difference Result 133319 states and 162155 transitions. [2025-02-05 16:31:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:31:35,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-02-05 16:31:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:35,747 INFO L225 Difference]: With dead ends: 133319 [2025-02-05 16:31:35,747 INFO L226 Difference]: Without dead ends: 109523 [2025-02-05 16:31:35,788 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-02-05 16:31:35,788 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1168 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:35,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 504 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:31:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109523 states. [2025-02-05 16:31:36,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109523 to 79432. [2025-02-05 16:31:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79432 states, 79431 states have (on average 1.2186425954602107) internal successors, (96798), 79431 states have internal predecessors, (96798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79432 states to 79432 states and 96798 transitions. [2025-02-05 16:31:36,738 INFO L78 Accepts]: Start accepts. Automaton has 79432 states and 96798 transitions. Word has length 105 [2025-02-05 16:31:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:36,738 INFO L471 AbstractCegarLoop]: Abstraction has 79432 states and 96798 transitions. [2025-02-05 16:31:36,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 79432 states and 96798 transitions. [2025-02-05 16:31:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 16:31:36,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:36,747 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:36,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:31:36,747 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:36,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash -70973293, now seen corresponding path program 1 times [2025-02-05 16:31:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526799356] [2025-02-05 16:31:36,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:36,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:31:36,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:31:36,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:36,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:37,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:37,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526799356] [2025-02-05 16:31:37,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526799356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:37,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:37,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:31:37,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038971544] [2025-02-05 16:31:37,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:37,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:31:37,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:37,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:31:37,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:31:37,368 INFO L87 Difference]: Start difference. First operand 79432 states and 96798 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:38,158 INFO L93 Difference]: Finished difference Result 171260 states and 208263 transitions. [2025-02-05 16:31:38,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:31:38,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-02-05 16:31:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:38,316 INFO L225 Difference]: With dead ends: 171260 [2025-02-05 16:31:38,316 INFO L226 Difference]: Without dead ends: 135632 [2025-02-05 16:31:38,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:31:38,373 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 1149 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:38,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1150 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:31:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135632 states. [2025-02-05 16:31:39,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135632 to 120433. [2025-02-05 16:31:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120433 states, 120432 states have (on average 1.2200827022718215) internal successors, (146937), 120432 states have internal predecessors, (146937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120433 states to 120433 states and 146937 transitions. [2025-02-05 16:31:40,099 INFO L78 Accepts]: Start accepts. Automaton has 120433 states and 146937 transitions. Word has length 105 [2025-02-05 16:31:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:40,100 INFO L471 AbstractCegarLoop]: Abstraction has 120433 states and 146937 transitions. [2025-02-05 16:31:40,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 120433 states and 146937 transitions. [2025-02-05 16:31:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 16:31:40,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:40,110 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:40,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:31:40,110 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:40,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:40,110 INFO L85 PathProgramCache]: Analyzing trace with hash -569023959, now seen corresponding path program 1 times [2025-02-05 16:31:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:40,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79292429] [2025-02-05 16:31:40,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:40,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:40,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:31:40,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:31:40,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:40,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:40,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79292429] [2025-02-05 16:31:40,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79292429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:40,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553726765] [2025-02-05 16:31:40,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:40,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:40,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:40,173 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:31:40,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:31:40,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:31:40,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:31:40,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:40,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:40,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:31:40,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:41,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:31:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:41,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553726765] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:31:41,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:31:41,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-02-05 16:31:41,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122398551] [2025-02-05 16:31:41,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:31:41,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:31:41,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:41,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:31:41,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:31:41,217 INFO L87 Difference]: Start difference. First operand 120433 states and 146937 transitions. Second operand has 14 states, 14 states have (on average 20.857142857142858) internal successors, (292), 14 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:42,165 INFO L93 Difference]: Finished difference Result 285548 states and 349331 transitions. [2025-02-05 16:31:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:31:42,166 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.857142857142858) internal successors, (292), 14 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-02-05 16:31:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:42,406 INFO L225 Difference]: With dead ends: 285548 [2025-02-05 16:31:42,407 INFO L226 Difference]: Without dead ends: 165933 [2025-02-05 16:31:42,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:31:42,498 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1925 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:42,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 856 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165933 states. [2025-02-05 16:31:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165933 to 138787. [2025-02-05 16:31:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138787 states, 138786 states have (on average 1.2051864020866658) internal successors, (167263), 138786 states have internal predecessors, (167263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138787 states to 138787 states and 167263 transitions. [2025-02-05 16:31:44,312 INFO L78 Accepts]: Start accepts. Automaton has 138787 states and 167263 transitions. Word has length 106 [2025-02-05 16:31:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:44,312 INFO L471 AbstractCegarLoop]: Abstraction has 138787 states and 167263 transitions. [2025-02-05 16:31:44,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.857142857142858) internal successors, (292), 14 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:44,312 INFO L276 IsEmpty]: Start isEmpty. Operand 138787 states and 167263 transitions. [2025-02-05 16:31:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 16:31:44,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:44,322 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:44,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:31:44,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-02-05 16:31:44,840 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:44,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash -264835777, now seen corresponding path program 1 times [2025-02-05 16:31:44,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:44,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753311036] [2025-02-05 16:31:44,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:44,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:44,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:31:44,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:31:44,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:44,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:45,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:45,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753311036] [2025-02-05 16:31:45,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753311036] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:45,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869582197] [2025-02-05 16:31:45,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:45,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:45,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:45,091 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:31:45,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:31:45,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:31:45,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:31:45,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:45,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:45,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 16:31:45,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:46,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:31:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:47,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869582197] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:31:47,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:31:47,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 13] total 31 [2025-02-05 16:31:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668432722] [2025-02-05 16:31:47,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:31:47,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 16:31:47,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:47,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 16:31:47,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:31:47,263 INFO L87 Difference]: Start difference. First operand 138787 states and 167263 transitions. Second operand has 32 states, 32 states have (on average 8.625) internal successors, (276), 31 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:49,709 INFO L93 Difference]: Finished difference Result 457611 states and 547909 transitions. [2025-02-05 16:31:49,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 16:31:49,710 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 31 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-02-05 16:31:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:50,476 INFO L225 Difference]: With dead ends: 457611 [2025-02-05 16:31:50,476 INFO L226 Difference]: Without dead ends: 319303 [2025-02-05 16:31:50,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=750, Invalid=2556, Unknown=0, NotChecked=0, Total=3306 [2025-02-05 16:31:50,540 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 3290 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 1842 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3290 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:50,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3290 Valid, 2082 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1842 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:31:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319303 states. [2025-02-05 16:31:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319303 to 186541. [2025-02-05 16:31:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186541 states, 186540 states have (on average 1.1951163289374933) internal successors, (222937), 186540 states have internal predecessors, (222937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186541 states to 186541 states and 222937 transitions. [2025-02-05 16:31:53,266 INFO L78 Accepts]: Start accepts. Automaton has 186541 states and 222937 transitions. Word has length 106 [2025-02-05 16:31:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:53,268 INFO L471 AbstractCegarLoop]: Abstraction has 186541 states and 222937 transitions. [2025-02-05 16:31:53,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 31 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 186541 states and 222937 transitions. [2025-02-05 16:31:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 16:31:53,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:53,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:53,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 16:31:53,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-02-05 16:31:53,493 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:53,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:53,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1253671246, now seen corresponding path program 1 times [2025-02-05 16:31:53,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:53,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111160099] [2025-02-05 16:31:53,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:53,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:53,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 16:31:53,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 16:31:53,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:53,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:31:53,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:53,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111160099] [2025-02-05 16:31:53,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111160099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:53,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:53,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:31:53,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803754813] [2025-02-05 16:31:53,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:53,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:31:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:53,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:31:53,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:31:53,660 INFO L87 Difference]: Start difference. First operand 186541 states and 222937 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 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-02-05 16:31:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:54,798 INFO L93 Difference]: Finished difference Result 310004 states and 370220 transitions. [2025-02-05 16:31:54,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:31:54,798 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 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 107 [2025-02-05 16:31:54,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:55,051 INFO L225 Difference]: With dead ends: 310004 [2025-02-05 16:31:55,051 INFO L226 Difference]: Without dead ends: 186611 [2025-02-05 16:31:55,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:31:55,143 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 592 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:55,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 673 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:31:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186611 states. [2025-02-05 16:31:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186611 to 186453. [2025-02-05 16:31:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186453 states, 186452 states have (on average 1.1951279685924527) internal successors, (222834), 186452 states have internal predecessors, (222834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186453 states to 186453 states and 222834 transitions. [2025-02-05 16:31:57,445 INFO L78 Accepts]: Start accepts. Automaton has 186453 states and 222834 transitions. Word has length 107 [2025-02-05 16:31:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:57,445 INFO L471 AbstractCegarLoop]: Abstraction has 186453 states and 222834 transitions. [2025-02-05 16:31:57,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 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-02-05 16:31:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 186453 states and 222834 transitions. [2025-02-05 16:31:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 16:31:57,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:57,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:57,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:31:57,456 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:57,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1225742584, now seen corresponding path program 1 times [2025-02-05 16:31:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:57,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373656428] [2025-02-05 16:31:57,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:57,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:57,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:31:57,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:31:57,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:57,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:58,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:58,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373656428] [2025-02-05 16:31:58,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373656428] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:58,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637241506] [2025-02-05 16:31:58,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:58,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:58,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:58,110 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:31:58,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:31:58,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:31:58,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:31:58,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:58,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:58,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 16:31:58,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:59,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:31:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637241506] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:31:59,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:31:59,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 10] total 34 [2025-02-05 16:31:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784710726] [2025-02-05 16:31:59,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:31:59,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 16:31:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:59,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 16:31:59,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1018, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:31:59,749 INFO L87 Difference]: Start difference. First operand 186453 states and 222834 transitions. Second operand has 34 states, 34 states have (on average 8.558823529411764) internal successors, (291), 34 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:03,640 INFO L93 Difference]: Finished difference Result 264343 states and 314979 transitions. [2025-02-05 16:32:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-02-05 16:32:03,640 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.558823529411764) internal successors, (291), 34 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-02-05 16:32:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:03,874 INFO L225 Difference]: With dead ends: 264343 [2025-02-05 16:32:03,874 INFO L226 Difference]: Without dead ends: 224741 [2025-02-05 16:32:03,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1116, Invalid=6366, Unknown=0, NotChecked=0, Total=7482 [2025-02-05 16:32:03,951 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 2406 mSDsluCounter, 6807 mSDsCounter, 0 mSdLazyCounter, 3274 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 7209 SdHoareTripleChecker+Invalid, 3314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:03,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 7209 Invalid, 3314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3274 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:32:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224741 states. [2025-02-05 16:32:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224741 to 186716. [2025-02-05 16:32:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186716 states, 186715 states have (on average 1.1933695739496024) internal successors, (222820), 186715 states have internal predecessors, (222820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186716 states to 186716 states and 222820 transitions. [2025-02-05 16:32:06,097 INFO L78 Accepts]: Start accepts. Automaton has 186716 states and 222820 transitions. Word has length 108 [2025-02-05 16:32:06,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:06,097 INFO L471 AbstractCegarLoop]: Abstraction has 186716 states and 222820 transitions. [2025-02-05 16:32:06,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.558823529411764) internal successors, (291), 34 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 186716 states and 222820 transitions. [2025-02-05 16:32:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 16:32:06,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:06,105 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:06,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 16:32:06,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-02-05 16:32:06,306 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:06,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1939791745, now seen corresponding path program 1 times [2025-02-05 16:32:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:06,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832480489] [2025-02-05 16:32:06,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:06,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:06,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:32:06,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:32:06,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:06,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:06,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:06,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832480489] [2025-02-05 16:32:06,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832480489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:32:06,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240843615] [2025-02-05 16:32:06,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:06,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:32:06,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:32:06,878 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:32:06,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 16:32:07,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:32:07,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:32:07,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:07,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:07,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 16:32:07,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:32:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:08,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:32:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:08,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240843615] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:32:08,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:32:08,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 37 [2025-02-05 16:32:08,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789731157] [2025-02-05 16:32:08,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:32:08,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-05 16:32:08,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:08,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-05 16:32:08,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1222, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 16:32:08,870 INFO L87 Difference]: Start difference. First operand 186716 states and 222820 transitions. Second operand has 37 states, 37 states have (on average 8.162162162162161) internal successors, (302), 37 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:17,520 INFO L93 Difference]: Finished difference Result 347240 states and 412466 transitions. [2025-02-05 16:32:17,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2025-02-05 16:32:17,521 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 8.162162162162161) internal successors, (302), 37 states have internal predecessors, (302), 0 states have call successors, (0), 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 109 [2025-02-05 16:32:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:17,921 INFO L225 Difference]: With dead ends: 347240 [2025-02-05 16:32:17,921 INFO L226 Difference]: Without dead ends: 310242 [2025-02-05 16:32:18,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7940 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4110, Invalid=21330, Unknown=0, NotChecked=0, Total=25440 [2025-02-05 16:32:18,018 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 4525 mSDsluCounter, 5428 mSDsCounter, 0 mSdLazyCounter, 5298 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4525 SdHoareTripleChecker+Valid, 5691 SdHoareTripleChecker+Invalid, 5408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 5298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:18,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 5691 Invalid, 5408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 5298 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 16:32:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310242 states. [2025-02-05 16:32:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310242 to 197792. [2025-02-05 16:32:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197792 states, 197791 states have (on average 1.1930421505528563) internal successors, (235973), 197791 states have internal predecessors, (235973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197792 states to 197792 states and 235973 transitions. [2025-02-05 16:32:20,816 INFO L78 Accepts]: Start accepts. Automaton has 197792 states and 235973 transitions. Word has length 109 [2025-02-05 16:32:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:20,816 INFO L471 AbstractCegarLoop]: Abstraction has 197792 states and 235973 transitions. [2025-02-05 16:32:20,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 8.162162162162161) internal successors, (302), 37 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 197792 states and 235973 transitions. [2025-02-05 16:32:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 16:32:20,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:20,824 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:20,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 16:32:21,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:32:21,025 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:21,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash 702308238, now seen corresponding path program 1 times [2025-02-05 16:32:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:21,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005530874] [2025-02-05 16:32:21,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:21,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:21,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:32:21,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:32:21,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:21,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:21,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005530874] [2025-02-05 16:32:21,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005530874] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:32:21,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383593920] [2025-02-05 16:32:21,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:21,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:32:21,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:32:21,323 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:32:21,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 16:32:21,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:32:21,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:32:21,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:21,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:21,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 16:32:21,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:32:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:21,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:32:21,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383593920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:21,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:32:21,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2025-02-05 16:32:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354779829] [2025-02-05 16:32:21,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:21,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:32:21,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:21,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:32:21,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:32:21,906 INFO L87 Difference]: Start difference. First operand 197792 states and 235973 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:22,810 INFO L93 Difference]: Finished difference Result 281456 states and 335978 transitions. [2025-02-05 16:32:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:32:22,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-02-05 16:32:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:23,024 INFO L225 Difference]: With dead ends: 281456 [2025-02-05 16:32:23,024 INFO L226 Difference]: Without dead ends: 212826 [2025-02-05 16:32:23,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:32:23,104 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 342 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 2530 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:23,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 2530 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:32:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212826 states.