./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.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_opt-floodmax.3.4.ufo.UNBOUNDED.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 ef92e2cd363e9cbada9057da9935ca7963cc6741d3474fe25a5d63d0a08b0a5f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:48:04,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:48:04,991 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:48:05,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:48:05,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:48:05,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:48:05,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:48:05,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:48:05,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:48:05,047 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:48:05,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:48:05,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:48:05,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:48:05,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:48:05,048 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:48:05,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:48:05,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:48:05,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:48:05,049 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 -> ef92e2cd363e9cbada9057da9935ca7963cc6741d3474fe25a5d63d0a08b0a5f [2025-02-05 16:48:05,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:48:05,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:48:05,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:48:05,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:48:05,491 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:48:05,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:48:06,757 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b05fb929/fc96a5fb5023423181d980c380fa83d9/FLAG70c89c0f0 [2025-02-05 16:48:07,053 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:48:07,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:48:07,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b05fb929/fc96a5fb5023423181d980c380fa83d9/FLAG70c89c0f0 [2025-02-05 16:48:07,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b05fb929/fc96a5fb5023423181d980c380fa83d9 [2025-02-05 16:48:07,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:48:07,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:48:07,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:48:07,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:48:07,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:48:07,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:48:07" (1/1) ... [2025-02-05 16:48:07,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137ce0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:07, skipping insertion in model container [2025-02-05 16:48:07,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:48:07" (1/1) ... [2025-02-05 16:48:07,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:48:07,655 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15169,15182] [2025-02-05 16:48:07,666 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15816,15829] [2025-02-05 16:48:07,680 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17200,17213] [2025-02-05 16:48:07,688 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18176,18189] [2025-02-05 16:48:07,736 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27541,27554] [2025-02-05 16:48:07,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:48:07,809 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:48:07,890 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15169,15182] [2025-02-05 16:48:07,894 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15816,15829] [2025-02-05 16:48:07,901 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17200,17213] [2025-02-05 16:48:07,908 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18176,18189] [2025-02-05 16:48:07,946 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27541,27554] [2025-02-05 16:48:07,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:48:08,006 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:48:08,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:08 WrapperNode [2025-02-05 16:48:08,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:48:08,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:48:08,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:48:08,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:48:08,020 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:48:08" (1/1) ... [2025-02-05 16:48:08,042 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:48:08" (1/1) ... [2025-02-05 16:48:08,106 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1763 [2025-02-05 16:48:08,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:48:08,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:48:08,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:48:08,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:48:08,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:08" (1/1) ... [2025-02-05 16:48:08,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:08" (1/1) ... [2025-02-05 16:48:08,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:08" (1/1) ... [2025-02-05 16:48:08,147 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:48:08,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:08" (1/1) ... [2025-02-05 16:48:08,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:08" (1/1) ... [2025-02-05 16:48:08,173 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:08" (1/1) ... [2025-02-05 16:48:08,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:08" (1/1) ... [2025-02-05 16:48:08,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:08" (1/1) ... [2025-02-05 16:48:08,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:08" (1/1) ... [2025-02-05 16:48:08,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:48:08,190 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:48:08,191 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:48:08,191 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:48:08,192 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:08" (1/1) ... [2025-02-05 16:48:08,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:48:08,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:48:08,223 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:48:08,227 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:48:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:48:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:48:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:48:08,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:48:08,339 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:48:08,340 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:48:09,419 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654: havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1886: havoc main_~node3__newmax~6#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1160: havoc main_~node2__newmax~4#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L931: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1197: havoc main_~node3__newmax~5#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2157: havoc main_~check__tmp~10#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1534: havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2264: havoc main_~check__tmp~11#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1046: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1246: havoc main_~check__tmp~7#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L752: havoc main_~node1__newmax~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__newmax~2#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__newmax~2#1;havoc main_~node1__newmax~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__newmax~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__newmax~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1414: havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2108: havoc main_~node3__newmax~7#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L886: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L986: havoc main_~node3__newmax~4#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L789: havoc main_~node2__newmax~3#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1946: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~8#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1980: havoc main_~check__tmp~9#1; [2025-02-05 16:48:09,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1849: havoc main_~node2__newmax~5#1; [2025-02-05 16:48:09,421 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1123: havoc main_~node1__newmax~4#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:48:09,421 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L826: havoc main_~node3__newmax~3#1; [2025-02-05 16:48:09,478 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-02-05 16:48:09,478 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:48:09,494 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:48:09,494 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:48:09,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:48:09 BoogieIcfgContainer [2025-02-05 16:48:09,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:48:09,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:48:09,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:48:09,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:48:09,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:48:07" (1/3) ... [2025-02-05 16:48:09,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6c3f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:48:09, skipping insertion in model container [2025-02-05 16:48:09,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:08" (2/3) ... [2025-02-05 16:48:09,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6c3f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:48:09, skipping insertion in model container [2025-02-05 16:48:09,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:48:09" (3/3) ... [2025-02-05 16:48:09,501 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:48:09,512 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:48:09,514 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 411 locations, 1 initial locations, 0 loop locations, and 5 error locations. [2025-02-05 16:48:09,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:48:09,569 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;@67d043b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:48:09,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-05 16:48:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 411 states, 405 states have (on average 1.8098765432098765) internal successors, (733), 410 states have internal predecessors, (733), 0 states have call successors, (0), 0 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:48:09,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 16:48:09,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:09,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:09,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:09,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash -149956072, now seen corresponding path program 1 times [2025-02-05 16:48:09,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:09,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949133305] [2025-02-05 16:48:09,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:09,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 16:48:09,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 16:48:09,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:09,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:10,105 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:48:10,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:10,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949133305] [2025-02-05 16:48:10,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949133305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:10,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:10,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:10,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971738214] [2025-02-05 16:48:10,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:10,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:10,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:10,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:10,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:10,135 INFO L87 Difference]: Start difference. First operand has 411 states, 405 states have (on average 1.8098765432098765) internal successors, (733), 410 states have internal predecessors, (733), 0 states have call successors, (0), 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 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:48:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:10,318 INFO L93 Difference]: Finished difference Result 752 states and 1324 transitions. [2025-02-05 16:48:10,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:10,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-02-05 16:48:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:10,339 INFO L225 Difference]: With dead ends: 752 [2025-02-05 16:48:10,339 INFO L226 Difference]: Without dead ends: 586 [2025-02-05 16:48:10,344 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:48:10,346 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 428 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:10,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1335 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:10,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-02-05 16:48:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2025-02-05 16:48:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.4732297063903281) internal successors, (853), 583 states have internal predecessors, (853), 0 states have call successors, (0), 0 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:48:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 853 transitions. [2025-02-05 16:48:10,398 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 853 transitions. Word has length 147 [2025-02-05 16:48:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:10,399 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 853 transitions. [2025-02-05 16:48:10,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:48:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 853 transitions. [2025-02-05 16:48:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 16:48:10,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:10,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:10,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:48:10,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:10,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -510089299, now seen corresponding path program 1 times [2025-02-05 16:48:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:10,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648093260] [2025-02-05 16:48:10,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:10,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 16:48:10,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 16:48:10,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:10,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:10,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:10,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648093260] [2025-02-05 16:48:10,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648093260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:10,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760562262] [2025-02-05 16:48:10,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:10,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:10,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:10,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:10,610 INFO L87 Difference]: Start difference. First operand 584 states and 853 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:48:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:10,725 INFO L93 Difference]: Finished difference Result 1181 states and 1782 transitions. [2025-02-05 16:48:10,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:10,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-02-05 16:48:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:10,729 INFO L225 Difference]: With dead ends: 1181 [2025-02-05 16:48:10,729 INFO L226 Difference]: Without dead ends: 940 [2025-02-05 16:48:10,730 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:48:10,731 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 336 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:10,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1085 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-02-05 16:48:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 938. [2025-02-05 16:48:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 933 states have (on average 1.4930332261521972) internal successors, (1393), 937 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:48:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1393 transitions. [2025-02-05 16:48:10,773 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1393 transitions. Word has length 147 [2025-02-05 16:48:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:10,774 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1393 transitions. [2025-02-05 16:48:10,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:48:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1393 transitions. [2025-02-05 16:48:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 16:48:10,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:10,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:48:10,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:10,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:10,777 INFO L85 PathProgramCache]: Analyzing trace with hash 155962132, now seen corresponding path program 1 times [2025-02-05 16:48:10,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:10,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285062906] [2025-02-05 16:48:10,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:10,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 16:48:10,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 16:48:10,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:10,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:11,006 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:48:11,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:11,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285062906] [2025-02-05 16:48:11,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285062906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:11,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:11,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:11,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505515506] [2025-02-05 16:48:11,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:11,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:11,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:11,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:11,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:11,008 INFO L87 Difference]: Start difference. First operand 938 states and 1393 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:48:11,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:11,143 INFO L93 Difference]: Finished difference Result 2061 states and 3153 transitions. [2025-02-05 16:48:11,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:11,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-02-05 16:48:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:11,152 INFO L225 Difference]: With dead ends: 2061 [2025-02-05 16:48:11,152 INFO L226 Difference]: Without dead ends: 1652 [2025-02-05 16:48:11,155 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:48:11,156 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 351 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:11,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1080 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2025-02-05 16:48:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1650. [2025-02-05 16:48:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1645 states have (on average 1.5057750759878419) internal successors, (2477), 1649 states have internal predecessors, (2477), 0 states have call successors, (0), 0 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:48:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2477 transitions. [2025-02-05 16:48:11,205 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2477 transitions. Word has length 147 [2025-02-05 16:48:11,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:11,206 INFO L471 AbstractCegarLoop]: Abstraction has 1650 states and 2477 transitions. [2025-02-05 16:48:11,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:48:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2477 transitions. [2025-02-05 16:48:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 16:48:11,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:11,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:11,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:48:11,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:11,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash 155561940, now seen corresponding path program 1 times [2025-02-05 16:48:11,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:11,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805719184] [2025-02-05 16:48:11,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:11,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:11,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 16:48:11,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 16:48:11,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:11,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:11,624 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:48:11,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:11,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805719184] [2025-02-05 16:48:11,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805719184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:11,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:11,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:11,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529012446] [2025-02-05 16:48:11,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:11,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:11,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:11,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:11,625 INFO L87 Difference]: Start difference. First operand 1650 states and 2477 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:48:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:11,781 INFO L93 Difference]: Finished difference Result 8083 states and 12098 transitions. [2025-02-05 16:48:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:48:11,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-02-05 16:48:11,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:11,802 INFO L225 Difference]: With dead ends: 8083 [2025-02-05 16:48:11,802 INFO L226 Difference]: Without dead ends: 6442 [2025-02-05 16:48:11,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:48:11,810 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 1675 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 2663 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:11,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 2663 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6442 states. [2025-02-05 16:48:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6442 to 3179. [2025-02-05 16:48:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3179 states, 3174 states have (on average 1.4955891619407689) internal successors, (4747), 3178 states have internal predecessors, (4747), 0 states have call successors, (0), 0 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:48:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 4747 transitions. [2025-02-05 16:48:11,901 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 4747 transitions. Word has length 147 [2025-02-05 16:48:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:11,901 INFO L471 AbstractCegarLoop]: Abstraction has 3179 states and 4747 transitions. [2025-02-05 16:48:11,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 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:48:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 4747 transitions. [2025-02-05 16:48:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:48:11,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:11,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:11,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:48:11,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:11,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:11,906 INFO L85 PathProgramCache]: Analyzing trace with hash 915247683, now seen corresponding path program 1 times [2025-02-05 16:48:11,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:11,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463447505] [2025-02-05 16:48:11,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:11,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:11,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:48:11,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:48:11,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:11,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:12,014 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:48:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:12,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463447505] [2025-02-05 16:48:12,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463447505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:12,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:12,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858990234] [2025-02-05 16:48:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:12,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:12,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:12,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:12,017 INFO L87 Difference]: Start difference. First operand 3179 states and 4747 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:48:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:12,054 INFO L93 Difference]: Finished difference Result 6332 states and 9451 transitions. [2025-02-05 16:48:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:12,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-02-05 16:48:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:12,066 INFO L225 Difference]: With dead ends: 6332 [2025-02-05 16:48:12,066 INFO L226 Difference]: Without dead ends: 3181 [2025-02-05 16:48:12,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:12,071 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:12,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2025-02-05 16:48:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3181. [2025-02-05 16:48:12,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3181 states, 3176 states have (on average 1.4952770780856424) internal successors, (4749), 3180 states have internal predecessors, (4749), 0 states have call successors, (0), 0 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:48:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4749 transitions. [2025-02-05 16:48:12,135 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4749 transitions. Word has length 148 [2025-02-05 16:48:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:12,136 INFO L471 AbstractCegarLoop]: Abstraction has 3181 states and 4749 transitions. [2025-02-05 16:48:12,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:48:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4749 transitions. [2025-02-05 16:48:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 16:48:12,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:12,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:12,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:48:12,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:12,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1540490660, now seen corresponding path program 1 times [2025-02-05 16:48:12,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:12,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431396465] [2025-02-05 16:48:12,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:12,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:12,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 16:48:12,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 16:48:12,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:12,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:12,515 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:48:12,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:12,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431396465] [2025-02-05 16:48:12,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431396465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:12,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:12,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:12,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324152183] [2025-02-05 16:48:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:12,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:12,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:12,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:12,518 INFO L87 Difference]: Start difference. First operand 3181 states and 4749 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:48:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:12,569 INFO L93 Difference]: Finished difference Result 6348 states and 9477 transitions. [2025-02-05 16:48:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:12,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 16:48:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:12,615 INFO L225 Difference]: With dead ends: 6348 [2025-02-05 16:48:12,616 INFO L226 Difference]: Without dead ends: 3181 [2025-02-05 16:48:12,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:12,619 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 20 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:12,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1817 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2025-02-05 16:48:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3180. [2025-02-05 16:48:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3180 states, 3175 states have (on average 1.4948031496062992) internal successors, (4746), 3179 states have internal predecessors, (4746), 0 states have call successors, (0), 0 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:48:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 4746 transitions. [2025-02-05 16:48:12,675 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 4746 transitions. Word has length 149 [2025-02-05 16:48:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:12,675 INFO L471 AbstractCegarLoop]: Abstraction has 3180 states and 4746 transitions. [2025-02-05 16:48:12,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:48:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4746 transitions. [2025-02-05 16:48:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 16:48:12,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:12,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:12,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:48:12,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:12,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:12,680 INFO L85 PathProgramCache]: Analyzing trace with hash -467130665, now seen corresponding path program 1 times [2025-02-05 16:48:12,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:12,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334763406] [2025-02-05 16:48:12,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:12,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:12,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 16:48:12,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 16:48:12,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:12,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:12,775 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:48:12,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:12,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334763406] [2025-02-05 16:48:12,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334763406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:12,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:12,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:12,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643344984] [2025-02-05 16:48:12,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:12,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:12,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:12,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:12,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:12,777 INFO L87 Difference]: Start difference. First operand 3180 states and 4746 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:48:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:12,853 INFO L93 Difference]: Finished difference Result 8455 states and 12597 transitions. [2025-02-05 16:48:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:12,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 16:48:12,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:12,872 INFO L225 Difference]: With dead ends: 8455 [2025-02-05 16:48:12,873 INFO L226 Difference]: Without dead ends: 5467 [2025-02-05 16:48:12,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:48:12,879 INFO L435 NwaCegarLoop]: 1095 mSDtfsCounter, 506 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:12,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1627 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2025-02-05 16:48:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 5419. [2025-02-05 16:48:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5419 states, 5414 states have (on average 1.4759881787957148) internal successors, (7991), 5418 states have internal predecessors, (7991), 0 states have call successors, (0), 0 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:48:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 7991 transitions. [2025-02-05 16:48:12,980 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 7991 transitions. Word has length 149 [2025-02-05 16:48:12,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:12,980 INFO L471 AbstractCegarLoop]: Abstraction has 5419 states and 7991 transitions. [2025-02-05 16:48:12,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:48:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 7991 transitions. [2025-02-05 16:48:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 16:48:12,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:12,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:12,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:48:12,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:12,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1429848793, now seen corresponding path program 1 times [2025-02-05 16:48:12,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:12,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982849399] [2025-02-05 16:48:12,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:12,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:13,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 16:48:13,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 16:48:13,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:13,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:13,388 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:48:13,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:13,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982849399] [2025-02-05 16:48:13,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982849399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:13,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:13,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:13,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76761358] [2025-02-05 16:48:13,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:13,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:13,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:13,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:13,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:13,390 INFO L87 Difference]: Start difference. First operand 5419 states and 7991 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:48:13,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:13,454 INFO L93 Difference]: Finished difference Result 9907 states and 14627 transitions. [2025-02-05 16:48:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 16:48:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:13,469 INFO L225 Difference]: With dead ends: 9907 [2025-02-05 16:48:13,469 INFO L226 Difference]: Without dead ends: 4668 [2025-02-05 16:48:13,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:13,478 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 23 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:13,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1821 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:13,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2025-02-05 16:48:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4668. [2025-02-05 16:48:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4668 states, 4663 states have (on average 1.475016084066052) internal successors, (6878), 4667 states have internal predecessors, (6878), 0 states have call successors, (0), 0 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:48:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4668 states to 4668 states and 6878 transitions. [2025-02-05 16:48:13,587 INFO L78 Accepts]: Start accepts. Automaton has 4668 states and 6878 transitions. Word has length 149 [2025-02-05 16:48:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:13,588 INFO L471 AbstractCegarLoop]: Abstraction has 4668 states and 6878 transitions. [2025-02-05 16:48:13,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:48:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4668 states and 6878 transitions. [2025-02-05 16:48:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 16:48:13,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:13,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:13,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:48:13,594 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:13,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1028135238, now seen corresponding path program 1 times [2025-02-05 16:48:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:13,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548567481] [2025-02-05 16:48:13,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:13,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 16:48:13,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 16:48:13,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:13,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:13,672 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:48:13,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548567481] [2025-02-05 16:48:13,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548567481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:13,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:13,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:13,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312112783] [2025-02-05 16:48:13,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:13,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:13,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:13,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:13,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:13,675 INFO L87 Difference]: Start difference. First operand 4668 states and 6878 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:48:13,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:13,741 INFO L93 Difference]: Finished difference Result 11060 states and 16687 transitions. [2025-02-05 16:48:13,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:13,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-02-05 16:48:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:13,766 INFO L225 Difference]: With dead ends: 11060 [2025-02-05 16:48:13,766 INFO L226 Difference]: Without dead ends: 6574 [2025-02-05 16:48:13,773 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:48:13,774 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 233 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:13,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1178 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6574 states. [2025-02-05 16:48:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6574 to 6404. [2025-02-05 16:48:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6404 states, 6399 states have (on average 1.516643225503985) internal successors, (9705), 6403 states have internal predecessors, (9705), 0 states have call successors, (0), 0 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:48:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6404 states to 6404 states and 9705 transitions. [2025-02-05 16:48:13,880 INFO L78 Accepts]: Start accepts. Automaton has 6404 states and 9705 transitions. Word has length 150 [2025-02-05 16:48:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:13,881 INFO L471 AbstractCegarLoop]: Abstraction has 6404 states and 9705 transitions. [2025-02-05 16:48:13,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:48:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 6404 states and 9705 transitions. [2025-02-05 16:48:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 16:48:13,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:13,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:13,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:48:13,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:13,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1221941468, now seen corresponding path program 1 times [2025-02-05 16:48:13,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:13,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557965484] [2025-02-05 16:48:13,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:13,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:13,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 16:48:13,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 16:48:13,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:13,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:13,964 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:48:13,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557965484] [2025-02-05 16:48:13,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557965484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:13,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:13,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:13,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607342204] [2025-02-05 16:48:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:13,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:13,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:13,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:13,966 INFO L87 Difference]: Start difference. First operand 6404 states and 9705 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:48:14,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:14,060 INFO L93 Difference]: Finished difference Result 16820 states and 25842 transitions. [2025-02-05 16:48:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:14,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-02-05 16:48:14,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:14,078 INFO L225 Difference]: With dead ends: 16820 [2025-02-05 16:48:14,078 INFO L226 Difference]: Without dead ends: 10682 [2025-02-05 16:48:14,087 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:48:14,087 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 352 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:14,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1235 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10682 states. [2025-02-05 16:48:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10682 to 9516. [2025-02-05 16:48:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9516 states, 9511 states have (on average 1.549363894438019) internal successors, (14736), 9515 states have internal predecessors, (14736), 0 states have call successors, (0), 0 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:48:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9516 states to 9516 states and 14736 transitions. [2025-02-05 16:48:14,302 INFO L78 Accepts]: Start accepts. Automaton has 9516 states and 14736 transitions. Word has length 153 [2025-02-05 16:48:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:14,303 INFO L471 AbstractCegarLoop]: Abstraction has 9516 states and 14736 transitions. [2025-02-05 16:48:14,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:48:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 9516 states and 14736 transitions. [2025-02-05 16:48:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 16:48:14,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:14,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:14,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:48:14,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:14,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash -981408650, now seen corresponding path program 1 times [2025-02-05 16:48:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:14,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971816722] [2025-02-05 16:48:14,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:14,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:14,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 16:48:14,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 16:48:14,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:14,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:14,828 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:48:14,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:14,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971816722] [2025-02-05 16:48:14,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971816722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:14,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:14,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:48:14,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913116284] [2025-02-05 16:48:14,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:14,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:48:14,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:14,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:48:14,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:48:14,831 INFO L87 Difference]: Start difference. First operand 9516 states and 14736 transitions. Second operand has 9 states, 9 states have (on average 17.0) internal successors, (153), 8 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:48:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:15,666 INFO L93 Difference]: Finished difference Result 44188 states and 69705 transitions. [2025-02-05 16:48:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:48:15,667 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 8 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-02-05 16:48:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:15,735 INFO L225 Difference]: With dead ends: 44188 [2025-02-05 16:48:15,736 INFO L226 Difference]: Without dead ends: 34887 [2025-02-05 16:48:15,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:48:15,757 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 6388 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6388 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:15,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6388 Valid, 2547 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:48:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34887 states. [2025-02-05 16:48:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34887 to 19958. [2025-02-05 16:48:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19958 states, 19953 states have (on average 1.5566581466446148) internal successors, (31060), 19957 states have internal predecessors, (31060), 0 states have call successors, (0), 0 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:48:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19958 states to 19958 states and 31060 transitions. [2025-02-05 16:48:16,204 INFO L78 Accepts]: Start accepts. Automaton has 19958 states and 31060 transitions. Word has length 153 [2025-02-05 16:48:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:16,204 INFO L471 AbstractCegarLoop]: Abstraction has 19958 states and 31060 transitions. [2025-02-05 16:48:16,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 8 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:48:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 19958 states and 31060 transitions. [2025-02-05 16:48:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 16:48:16,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:16,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:16,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:48:16,209 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:16,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2033694968, now seen corresponding path program 1 times [2025-02-05 16:48:16,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:16,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743795447] [2025-02-05 16:48:16,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:16,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 16:48:16,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 16:48:16,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:16,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:16,599 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:48:16,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:16,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743795447] [2025-02-05 16:48:16,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743795447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:16,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:16,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:16,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488584390] [2025-02-05 16:48:16,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:16,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:16,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:16,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:16,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:16,600 INFO L87 Difference]: Start difference. First operand 19958 states and 31060 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:48:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:16,784 INFO L93 Difference]: Finished difference Result 52758 states and 81990 transitions. [2025-02-05 16:48:16,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:48:16,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-02-05 16:48:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:16,847 INFO L225 Difference]: With dead ends: 52758 [2025-02-05 16:48:16,847 INFO L226 Difference]: Without dead ends: 32827 [2025-02-05 16:48:16,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:48:16,880 INFO L435 NwaCegarLoop]: 965 mSDtfsCounter, 501 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2419 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:16,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2419 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32827 states. [2025-02-05 16:48:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32827 to 32793. [2025-02-05 16:48:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32793 states, 32788 states have (on average 1.5406856166890326) internal successors, (50516), 32792 states have internal predecessors, (50516), 0 states have call successors, (0), 0 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:48:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32793 states to 32793 states and 50516 transitions. [2025-02-05 16:48:17,465 INFO L78 Accepts]: Start accepts. Automaton has 32793 states and 50516 transitions. Word has length 153 [2025-02-05 16:48:17,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:17,466 INFO L471 AbstractCegarLoop]: Abstraction has 32793 states and 50516 transitions. [2025-02-05 16:48:17,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:48:17,466 INFO L276 IsEmpty]: Start isEmpty. Operand 32793 states and 50516 transitions. [2025-02-05 16:48:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 16:48:17,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:17,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:17,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:48:17,474 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:17,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:17,475 INFO L85 PathProgramCache]: Analyzing trace with hash -204680325, now seen corresponding path program 1 times [2025-02-05 16:48:17,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:17,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15473360] [2025-02-05 16:48:17,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:17,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:17,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 16:48:17,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 16:48:17,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:17,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:17,567 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:48:17,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:17,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15473360] [2025-02-05 16:48:17,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15473360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:17,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:17,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:17,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499213740] [2025-02-05 16:48:17,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:17,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:17,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:17,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:17,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:17,569 INFO L87 Difference]: Start difference. First operand 32793 states and 50516 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:48:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:17,800 INFO L93 Difference]: Finished difference Result 83789 states and 129167 transitions. [2025-02-05 16:48:17,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:17,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-02-05 16:48:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:17,891 INFO L225 Difference]: With dead ends: 83789 [2025-02-05 16:48:17,891 INFO L226 Difference]: Without dead ends: 51388 [2025-02-05 16:48:17,932 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:48:17,933 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 494 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:17,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1500 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51388 states. [2025-02-05 16:48:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51388 to 51358. [2025-02-05 16:48:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51358 states, 51353 states have (on average 1.5281872529355636) internal successors, (78477), 51357 states have internal predecessors, (78477), 0 states have call successors, (0), 0 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:48:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51358 states to 51358 states and 78477 transitions. [2025-02-05 16:48:18,901 INFO L78 Accepts]: Start accepts. Automaton has 51358 states and 78477 transitions. Word has length 155 [2025-02-05 16:48:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:18,901 INFO L471 AbstractCegarLoop]: Abstraction has 51358 states and 78477 transitions. [2025-02-05 16:48:18,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:48:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 51358 states and 78477 transitions. [2025-02-05 16:48:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 16:48:18,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:18,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:18,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:48:18,913 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:18,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:18,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1138955893, now seen corresponding path program 1 times [2025-02-05 16:48:18,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:18,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470139242] [2025-02-05 16:48:18,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:18,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 16:48:18,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 16:48:18,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:18,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:19,365 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:48:19,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:19,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470139242] [2025-02-05 16:48:19,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470139242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:19,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:19,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:48:19,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932967560] [2025-02-05 16:48:19,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:19,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:48:19,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:19,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:48:19,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:48:19,367 INFO L87 Difference]: Start difference. First operand 51358 states and 78477 transitions. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:48:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:20,805 INFO L93 Difference]: Finished difference Result 236872 states and 361866 transitions. [2025-02-05 16:48:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:48:20,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-02-05 16:48:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:21,233 INFO L225 Difference]: With dead ends: 236872 [2025-02-05 16:48:21,234 INFO L226 Difference]: Without dead ends: 185920 [2025-02-05 16:48:21,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:48:21,526 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 5674 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5674 SdHoareTripleChecker+Valid, 2621 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:21,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5674 Valid, 2621 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:48:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185920 states. [2025-02-05 16:48:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185920 to 105766. [2025-02-05 16:48:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105766 states, 105761 states have (on average 1.514386210417829) internal successors, (160163), 105765 states have internal predecessors, (160163), 0 states have call successors, (0), 0 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:48:23,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105766 states to 105766 states and 160163 transitions. [2025-02-05 16:48:23,813 INFO L78 Accepts]: Start accepts. Automaton has 105766 states and 160163 transitions. Word has length 159 [2025-02-05 16:48:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:23,814 INFO L471 AbstractCegarLoop]: Abstraction has 105766 states and 160163 transitions. [2025-02-05 16:48:23,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:48:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 105766 states and 160163 transitions. [2025-02-05 16:48:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 16:48:23,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:23,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:23,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:48:23,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:23,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:23,841 INFO L85 PathProgramCache]: Analyzing trace with hash 329609267, now seen corresponding path program 1 times [2025-02-05 16:48:23,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:23,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7656835] [2025-02-05 16:48:23,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:23,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:23,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 16:48:23,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 16:48:23,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:23,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:24,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:24,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7656835] [2025-02-05 16:48:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7656835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:24,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:24,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:24,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530603693] [2025-02-05 16:48:24,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:24,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:24,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:24,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:24,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:24,612 INFO L87 Difference]: Start difference. First operand 105766 states and 160163 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:48:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:25,389 INFO L93 Difference]: Finished difference Result 144280 states and 219308 transitions. [2025-02-05 16:48:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:25,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-02-05 16:48:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:25,461 INFO L225 Difference]: With dead ends: 144280 [2025-02-05 16:48:25,461 INFO L226 Difference]: Without dead ends: 64100 [2025-02-05 16:48:25,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:25,498 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 936 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:25,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1031 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64100 states. [2025-02-05 16:48:26,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64100 to 64098. [2025-02-05 16:48:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64098 states, 64093 states have (on average 1.4975738380166321) internal successors, (95984), 64097 states have internal predecessors, (95984), 0 states have call successors, (0), 0 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:48:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64098 states to 64098 states and 95984 transitions. [2025-02-05 16:48:26,404 INFO L78 Accepts]: Start accepts. Automaton has 64098 states and 95984 transitions. Word has length 159 [2025-02-05 16:48:26,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:26,404 INFO L471 AbstractCegarLoop]: Abstraction has 64098 states and 95984 transitions. [2025-02-05 16:48:26,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:48:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 64098 states and 95984 transitions. [2025-02-05 16:48:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 16:48:26,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:26,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:48:26,414 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash -752524685, now seen corresponding path program 1 times [2025-02-05 16:48:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125580047] [2025-02-05 16:48:26,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:26,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 16:48:26,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 16:48:26,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:26,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:26,677 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:48:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:26,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125580047] [2025-02-05 16:48:26,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125580047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:26,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:26,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:26,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645182345] [2025-02-05 16:48:26,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:26,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:26,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:26,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:26,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:26,680 INFO L87 Difference]: Start difference. First operand 64098 states and 95984 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:48:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:26,962 INFO L93 Difference]: Finished difference Result 83589 states and 125936 transitions. [2025-02-05 16:48:26,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:26,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-02-05 16:48:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:27,009 INFO L225 Difference]: With dead ends: 83589 [2025-02-05 16:48:27,009 INFO L226 Difference]: Without dead ends: 40128 [2025-02-05 16:48:27,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:27,042 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 650 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:27,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1034 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40128 states. [2025-02-05 16:48:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40128 to 40126. [2025-02-05 16:48:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40126 states, 40121 states have (on average 1.4710999227337305) internal successors, (59022), 40125 states have internal predecessors, (59022), 0 states have call successors, (0), 0 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:48:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40126 states to 40126 states and 59022 transitions. [2025-02-05 16:48:27,686 INFO L78 Accepts]: Start accepts. Automaton has 40126 states and 59022 transitions. Word has length 159 [2025-02-05 16:48:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:27,686 INFO L471 AbstractCegarLoop]: Abstraction has 40126 states and 59022 transitions. [2025-02-05 16:48:27,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:48:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 40126 states and 59022 transitions. [2025-02-05 16:48:27,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 16:48:27,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:27,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:27,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:48:27,695 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:27,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash 275216369, now seen corresponding path program 1 times [2025-02-05 16:48:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:27,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280421084] [2025-02-05 16:48:27,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:27,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 16:48:27,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 16:48:27,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:27,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:28,060 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:48:28,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:28,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280421084] [2025-02-05 16:48:28,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280421084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:28,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:28,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764252212] [2025-02-05 16:48:28,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:28,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:28,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:28,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:28,063 INFO L87 Difference]: Start difference. First operand 40126 states and 59022 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:48:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:28,366 INFO L93 Difference]: Finished difference Result 154376 states and 227130 transitions. [2025-02-05 16:48:28,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:28,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-02-05 16:48:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:28,518 INFO L225 Difference]: With dead ends: 154376 [2025-02-05 16:48:28,519 INFO L226 Difference]: Without dead ends: 114301 [2025-02-05 16:48:28,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:28,582 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 1057 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:28,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 1992 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114301 states. [2025-02-05 16:48:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114301 to 77142. [2025-02-05 16:48:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77142 states, 77137 states have (on average 1.4609720367657544) internal successors, (112695), 77141 states have internal predecessors, (112695), 0 states have call successors, (0), 0 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:48:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77142 states to 77142 states and 112695 transitions. [2025-02-05 16:48:29,919 INFO L78 Accepts]: Start accepts. Automaton has 77142 states and 112695 transitions. Word has length 159 [2025-02-05 16:48:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:29,919 INFO L471 AbstractCegarLoop]: Abstraction has 77142 states and 112695 transitions. [2025-02-05 16:48:29,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:48:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 77142 states and 112695 transitions. [2025-02-05 16:48:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 16:48:29,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:29,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:29,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:48:29,938 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:29,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash 700495664, now seen corresponding path program 1 times [2025-02-05 16:48:29,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:29,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249400833] [2025-02-05 16:48:29,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:29,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:29,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 16:48:29,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 16:48:29,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:29,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:30,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:30,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249400833] [2025-02-05 16:48:30,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249400833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:30,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:30,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:30,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86399320] [2025-02-05 16:48:30,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:30,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:30,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:30,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:30,010 INFO L87 Difference]: Start difference. First operand 77142 states and 112695 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:48:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:30,416 INFO L93 Difference]: Finished difference Result 154185 states and 225258 transitions. [2025-02-05 16:48:30,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:30,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-02-05 16:48:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:30,524 INFO L225 Difference]: With dead ends: 154185 [2025-02-05 16:48:30,524 INFO L226 Difference]: Without dead ends: 77148 [2025-02-05 16:48:30,591 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:48:30,592 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 0 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:30,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77148 states. [2025-02-05 16:48:31,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77148 to 77148. [2025-02-05 16:48:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77148 states, 77143 states have (on average 1.4609361834515122) internal successors, (112701), 77147 states have internal predecessors, (112701), 0 states have call successors, (0), 0 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:48:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77148 states to 77148 states and 112701 transitions. [2025-02-05 16:48:31,860 INFO L78 Accepts]: Start accepts. Automaton has 77148 states and 112701 transitions. Word has length 160 [2025-02-05 16:48:31,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:31,860 INFO L471 AbstractCegarLoop]: Abstraction has 77148 states and 112701 transitions. [2025-02-05 16:48:31,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:48:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 77148 states and 112701 transitions. [2025-02-05 16:48:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 16:48:31,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:31,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:31,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:48:31,878 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:31,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:31,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1129827207, now seen corresponding path program 1 times [2025-02-05 16:48:31,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:31,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598146296] [2025-02-05 16:48:31,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:31,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:31,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 16:48:31,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 16:48:31,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:31,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:32,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598146296] [2025-02-05 16:48:32,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598146296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:32,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:32,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:32,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903955716] [2025-02-05 16:48:32,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:32,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:32,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:32,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:32,100 INFO L87 Difference]: Start difference. First operand 77148 states and 112701 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:48:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:32,824 INFO L93 Difference]: Finished difference Result 154258 states and 225347 transitions. [2025-02-05 16:48:32,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:32,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-02-05 16:48:32,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:32,926 INFO L225 Difference]: With dead ends: 154258 [2025-02-05 16:48:32,926 INFO L226 Difference]: Without dead ends: 77142 [2025-02-05 16:48:32,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:32,969 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 14 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:32,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1745 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77142 states. [2025-02-05 16:48:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77142 to 77142. [2025-02-05 16:48:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77142 states, 77137 states have (on average 1.4608942530821785) internal successors, (112689), 77141 states have internal predecessors, (112689), 0 states have call successors, (0), 0 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:48:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77142 states to 77142 states and 112689 transitions. [2025-02-05 16:48:34,048 INFO L78 Accepts]: Start accepts. Automaton has 77142 states and 112689 transitions. Word has length 161 [2025-02-05 16:48:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:34,048 INFO L471 AbstractCegarLoop]: Abstraction has 77142 states and 112689 transitions. [2025-02-05 16:48:34,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:48:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 77142 states and 112689 transitions. [2025-02-05 16:48:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 16:48:34,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:34,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:34,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:48:34,065 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:34,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:34,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1654109684, now seen corresponding path program 1 times [2025-02-05 16:48:34,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:34,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606148406] [2025-02-05 16:48:34,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:34,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:34,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 16:48:34,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 16:48:34,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:34,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:34,148 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:48:34,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:34,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606148406] [2025-02-05 16:48:34,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606148406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727335342] [2025-02-05 16:48:34,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:34,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:34,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:34,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:34,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:34,150 INFO L87 Difference]: Start difference. First operand 77142 states and 112689 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:48:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:34,679 INFO L93 Difference]: Finished difference Result 186835 states and 272379 transitions. [2025-02-05 16:48:34,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:34,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-02-05 16:48:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:34,848 INFO L225 Difference]: With dead ends: 186835 [2025-02-05 16:48:34,849 INFO L226 Difference]: Without dead ends: 110433 [2025-02-05 16:48:34,917 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:48:34,918 INFO L435 NwaCegarLoop]: 1063 mSDtfsCounter, 476 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:34,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1577 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110433 states. [2025-02-05 16:48:36,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110433 to 110357. [2025-02-05 16:48:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110357 states, 110352 states have (on average 1.4411247643903147) internal successors, (159031), 110356 states have internal predecessors, (159031), 0 states have call successors, (0), 0 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:48:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110357 states to 110357 states and 159031 transitions. [2025-02-05 16:48:36,550 INFO L78 Accepts]: Start accepts. Automaton has 110357 states and 159031 transitions. Word has length 161 [2025-02-05 16:48:36,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:36,550 INFO L471 AbstractCegarLoop]: Abstraction has 110357 states and 159031 transitions. [2025-02-05 16:48:36,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:48:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 110357 states and 159031 transitions. [2025-02-05 16:48:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 16:48:36,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:36,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:48:36,566 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:36,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash -66940048, now seen corresponding path program 1 times [2025-02-05 16:48:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032166670] [2025-02-05 16:48:36,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:36,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 16:48:36,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 16:48:36,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:36,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:36,616 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:48:36,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:36,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032166670] [2025-02-05 16:48:36,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032166670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:36,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:36,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:36,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824721532] [2025-02-05 16:48:36,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:36,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:36,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:36,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:36,618 INFO L87 Difference]: Start difference. First operand 110357 states and 159031 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:48:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:37,616 INFO L93 Difference]: Finished difference Result 269793 states and 391982 transitions. [2025-02-05 16:48:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:37,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-05 16:48:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:37,870 INFO L225 Difference]: With dead ends: 269793 [2025-02-05 16:48:37,870 INFO L226 Difference]: Without dead ends: 174301 [2025-02-05 16:48:37,922 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:48:37,922 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 299 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:37,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1195 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174301 states. [2025-02-05 16:48:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174301 to 158335. [2025-02-05 16:48:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158335 states, 158330 states have (on average 1.4637276574243667) internal successors, (231752), 158334 states have internal predecessors, (231752), 0 states have call successors, (0), 0 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:48:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158335 states to 158335 states and 231752 transitions. [2025-02-05 16:48:40,643 INFO L78 Accepts]: Start accepts. Automaton has 158335 states and 231752 transitions. Word has length 163 [2025-02-05 16:48:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:40,643 INFO L471 AbstractCegarLoop]: Abstraction has 158335 states and 231752 transitions. [2025-02-05 16:48:40,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:48:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 158335 states and 231752 transitions. [2025-02-05 16:48:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 16:48:40,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:40,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:40,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:48:40,677 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:40,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:40,677 INFO L85 PathProgramCache]: Analyzing trace with hash 406007786, now seen corresponding path program 1 times [2025-02-05 16:48:40,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:40,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321952625] [2025-02-05 16:48:40,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:40,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:40,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 16:48:40,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 16:48:40,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:40,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:40,855 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:48:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321952625] [2025-02-05 16:48:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321952625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:40,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:40,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891994088] [2025-02-05 16:48:40,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:40,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:40,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:40,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:40,857 INFO L87 Difference]: Start difference. First operand 158335 states and 231752 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:48:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:41,919 INFO L93 Difference]: Finished difference Result 255414 states and 377027 transitions. [2025-02-05 16:48:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:41,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-02-05 16:48:41,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:42,095 INFO L225 Difference]: With dead ends: 255414 [2025-02-05 16:48:42,095 INFO L226 Difference]: Without dead ends: 117125 [2025-02-05 16:48:42,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:42,186 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 638 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:42,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1020 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117125 states. [2025-02-05 16:48:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117125 to 117123. [2025-02-05 16:48:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117123 states, 117118 states have (on average 1.4411362898956608) internal successors, (168783), 117122 states have internal predecessors, (168783), 0 states have call successors, (0), 0 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:48:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117123 states to 117123 states and 168783 transitions. [2025-02-05 16:48:44,277 INFO L78 Accepts]: Start accepts. Automaton has 117123 states and 168783 transitions. Word has length 166 [2025-02-05 16:48:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:44,277 INFO L471 AbstractCegarLoop]: Abstraction has 117123 states and 168783 transitions. [2025-02-05 16:48:44,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:48:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 117123 states and 168783 transitions. [2025-02-05 16:48:44,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 16:48:44,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:44,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:44,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:48:44,295 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:44,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:44,295 INFO L85 PathProgramCache]: Analyzing trace with hash -951949652, now seen corresponding path program 1 times [2025-02-05 16:48:44,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:44,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215348396] [2025-02-05 16:48:44,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:44,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 16:48:44,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 16:48:44,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:44,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:44,554 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:48:44,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:44,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215348396] [2025-02-05 16:48:44,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215348396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:44,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:44,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:44,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095094968] [2025-02-05 16:48:44,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:44,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:44,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:44,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:44,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:44,557 INFO L87 Difference]: Start difference. First operand 117123 states and 168783 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:48:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:45,152 INFO L93 Difference]: Finished difference Result 196400 states and 283098 transitions. [2025-02-05 16:48:45,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:45,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-02-05 16:48:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:45,324 INFO L225 Difference]: With dead ends: 196400 [2025-02-05 16:48:45,325 INFO L226 Difference]: Without dead ends: 106904 [2025-02-05 16:48:45,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:45,402 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 952 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:45,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 1450 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:45,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106904 states. [2025-02-05 16:48:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106904 to 106736. [2025-02-05 16:48:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106736 states, 106731 states have (on average 1.4410808481134816) internal successors, (153808), 106735 states have internal predecessors, (153808), 0 states have call successors, (0), 0 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:48:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106736 states to 106736 states and 153808 transitions. [2025-02-05 16:48:47,221 INFO L78 Accepts]: Start accepts. Automaton has 106736 states and 153808 transitions. Word has length 166 [2025-02-05 16:48:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:47,221 INFO L471 AbstractCegarLoop]: Abstraction has 106736 states and 153808 transitions. [2025-02-05 16:48:47,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:48:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 106736 states and 153808 transitions. [2025-02-05 16:48:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 16:48:47,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:47,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:47,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:48:47,235 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:47,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1528066277, now seen corresponding path program 1 times [2025-02-05 16:48:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:47,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966422792] [2025-02-05 16:48:47,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:47,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:47,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 16:48:47,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 16:48:47,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:47,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:47,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:47,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966422792] [2025-02-05 16:48:47,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966422792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:47,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:47,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:47,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494161630] [2025-02-05 16:48:47,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:47,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:47,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:47,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:47,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:47,285 INFO L87 Difference]: Start difference. First operand 106736 states and 153808 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:48:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:47,802 INFO L93 Difference]: Finished difference Result 237068 states and 340962 transitions. [2025-02-05 16:48:47,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:47,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 16:48:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:48,041 INFO L225 Difference]: With dead ends: 237068 [2025-02-05 16:48:48,041 INFO L226 Difference]: Without dead ends: 156596 [2025-02-05 16:48:48,127 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:48:48,128 INFO L435 NwaCegarLoop]: 995 mSDtfsCounter, 522 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:48,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1550 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156596 states. [2025-02-05 16:48:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156596 to 106736. [2025-02-05 16:48:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106736 states, 106731 states have (on average 1.4410527400661477) internal successors, (153805), 106735 states have internal predecessors, (153805), 0 states have call successors, (0), 0 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:48:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106736 states to 106736 states and 153805 transitions. [2025-02-05 16:48:50,448 INFO L78 Accepts]: Start accepts. Automaton has 106736 states and 153805 transitions. Word has length 167 [2025-02-05 16:48:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:50,449 INFO L471 AbstractCegarLoop]: Abstraction has 106736 states and 153805 transitions. [2025-02-05 16:48:50,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:48:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 106736 states and 153805 transitions. [2025-02-05 16:48:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 16:48:50,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:50,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:50,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:48:50,468 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-05 16:48:50,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:50,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1006286217, now seen corresponding path program 1 times [2025-02-05 16:48:50,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:50,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178963388] [2025-02-05 16:48:50,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:50,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:50,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 16:48:50,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 16:48:50,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:50,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:50,717 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:48:50,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:50,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178963388] [2025-02-05 16:48:50,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178963388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:50,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:50,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:50,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92572143] [2025-02-05 16:48:50,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:50,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:50,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:50,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:50,719 INFO L87 Difference]: Start difference. First operand 106736 states and 153805 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)