./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-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.5.1.ufo.BOUNDED-10.pals.c.v+nlh-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 76e1fb283eaa9b9489ec46678de9c71238e259f3b18cc82b368e6453537b0902 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:50:37,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:50:37,796 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:50:37,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:50:37,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:50:37,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:50:37,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:50:37,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:50:37,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:50:37,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:50:37,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:50:37,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:50:37,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:50:37,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:50:37,822 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:50:37,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:50:37,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:50:37,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:50:37,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:50:37,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:50:37,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:50:37,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:50:37,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:50:37,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:50:37,823 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:50:37,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:50:37,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:50:37,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:50:37,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:50:37,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:50:37,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:50:37,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:50:37,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:50:37,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:50:37,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:50:37,825 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:50:37,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:50:37,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:50:37,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:50:37,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:50:37,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:50:37,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:50:37,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:50:37,825 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 -> 76e1fb283eaa9b9489ec46678de9c71238e259f3b18cc82b368e6453537b0902 [2025-02-05 16:50:38,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:50:38,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:50:38,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:50:38,100 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:50:38,100 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:50:38,101 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.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:50:39,276 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac225b6cf/5eb4bf285f054990a672e03c6c63bfdf/FLAGf1ef27898 [2025-02-05 16:50:39,694 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:50:39,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:50:39,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac225b6cf/5eb4bf285f054990a672e03c6c63bfdf/FLAGf1ef27898 [2025-02-05 16:50:39,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac225b6cf/5eb4bf285f054990a672e03c6c63bfdf [2025-02-05 16:50:39,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:50:39,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:50:39,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:50:39,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:50:39,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:50:39,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:50:39" (1/1) ... [2025-02-05 16:50:39,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55619b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:39, skipping insertion in model container [2025-02-05 16:50:39,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:50:39" (1/1) ... [2025-02-05 16:50:39,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:50:40,216 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.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[39479,39492] [2025-02-05 16:50:40,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:50:40,430 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:50:40,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[39479,39492] [2025-02-05 16:50:40,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:50:40,821 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:50:40,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:40 WrapperNode [2025-02-05 16:50:40,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:50:40,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:50:40,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:50:40,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:50:40,828 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:50:40" (1/1) ... [2025-02-05 16:50:40,862 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:50:40" (1/1) ... [2025-02-05 16:50:40,956 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 5455 [2025-02-05 16:50:40,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:50:40,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:50:40,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:50:40,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:50:40,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:40" (1/1) ... [2025-02-05 16:50:40,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:40" (1/1) ... [2025-02-05 16:50:40,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:40" (1/1) ... [2025-02-05 16:50:41,033 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:50:41,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:40" (1/1) ... [2025-02-05 16:50:41,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:40" (1/1) ... [2025-02-05 16:50:41,076 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:40" (1/1) ... [2025-02-05 16:50:41,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:40" (1/1) ... [2025-02-05 16:50:41,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:40" (1/1) ... [2025-02-05 16:50:41,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:40" (1/1) ... [2025-02-05 16:50:41,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:50:41,133 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:50:41,133 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:50:41,133 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:50:41,134 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:40" (1/1) ... [2025-02-05 16:50:41,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:50:41,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:50:41,159 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:50:41,161 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:50:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:50:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:50:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:50:41,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:50:41,427 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:50:41,429 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:50:43,991 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7371: havoc main_~node1____CPAchecker_TMP_3~4#1;havoc main_~node1____CPAchecker_TMP_2~4#1;havoc main_~node1____CPAchecker_TMP_1~4#1;havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-02-05 16:50:43,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2220: havoc main_~node1__newmax~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:50:43,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1031: havoc main_~node5__newmax~0#1; [2025-02-05 16:50:43,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6981: havoc main_~node3____CPAchecker_TMP_3~4#1;havoc main_~node3____CPAchecker_TMP_2~4#1;havoc main_~node3____CPAchecker_TMP_1~4#1;havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:50:43,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6591: havoc main_~node5____CPAchecker_TMP_3~3#1;havoc main_~node5____CPAchecker_TMP_2~3#1;havoc main_~node5____CPAchecker_TMP_1~3#1;havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-02-05 16:50:43,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1174: havoc main_~node1__newmax~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:50:43,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1572: havoc main_~node2__newmax~2#1; [2025-02-05 16:50:43,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1970: havoc main_~node3__newmax~3#1; [2025-02-05 16:50:43,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6336: havoc main_~node1____CPAchecker_TMP_3~3#1;havoc main_~node1____CPAchecker_TMP_2~3#1;havoc main_~node1____CPAchecker_TMP_1~3#1;havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-02-05 16:50:43,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5946: havoc main_~node3____CPAchecker_TMP_3~3#1;havoc main_~node3____CPAchecker_TMP_2~3#1;havoc main_~node3____CPAchecker_TMP_1~3#1;havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-02-05 16:50:43,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L929: havoc main_~node3__newmax~0#1; [2025-02-05 16:50:43,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1327: havoc main_~node4__newmax~1#1; [2025-02-05 16:50:43,993 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3442: havoc main_~node5____CPAchecker_TMP_3~0#1;havoc main_~node5____CPAchecker_TMP_2~0#1;havoc main_~node5____CPAchecker_TMP_1~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-02-05 16:50:43,993 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5556: havoc main_~node5____CPAchecker_TMP_3~2#1;havoc main_~node5____CPAchecker_TMP_2~2#1;havoc main_~node5____CPAchecker_TMP_1~2#1;havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-02-05 16:50:43,993 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1725: havoc main_~node5__newmax~2#1; [2025-02-05 16:50:43,993 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2524: havoc main_~node4____CPAchecker_TMP_3~0#1;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__newmax~4#1; [2025-02-05 16:50:43,993 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5301: havoc main_~node1____CPAchecker_TMP_3~2#1;havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-02-05 16:50:43,993 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868: havoc main_~node1__newmax~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:50:43,994 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4911: havoc main_~node3____CPAchecker_TMP_3~2#1;havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:50:43,994 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3854: havoc main_~node3____CPAchecker_TMP_3~1#1;havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:50:43,994 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2271: havoc main_~node2__newmax~4#1; [2025-02-05 16:50:43,994 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: havoc main_~node2____CPAchecker_TMP_3~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:50:43,995 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4521: havoc main_~node5____CPAchecker_TMP_3~1#1;havoc main_~node5____CPAchecker_TMP_2~1#1;havoc main_~node5____CPAchecker_TMP_1~1#1;havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-02-05 16:50:43,995 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L827: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r151~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r251~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r351~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r451~0#1, main_~init__r511~0#1, main_~init__r521~0#1, main_~init__r531~0#1, main_~init__r541~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__r142~0#1, main_~init__tmp___1~0#1, main_~init__r152~0#1, main_~init__tmp___2~0#1, main_~init__r212~0#1, main_~init__tmp___3~0#1, main_~init__r232~0#1, main_~init__tmp___4~0#1, main_~init__r242~0#1, main_~init__tmp___5~0#1, main_~init__r252~0#1, main_~init__tmp___6~0#1, main_~init__r312~0#1, main_~init__tmp___7~0#1, main_~init__r322~0#1, main_~init__tmp___8~0#1, main_~init__r342~0#1, main_~init__tmp___9~0#1, main_~init__r352~0#1, main_~init__tmp___10~0#1, main_~init__r412~0#1, main_~init__tmp___11~0#1, main_~init__r422~0#1, main_~init__tmp___12~0#1, main_~init__r432~0#1, main_~init__tmp___13~0#1, main_~init__r452~0#1, main_~init__tmp___14~0#1, main_~init__r512~0#1, main_~init__tmp___15~0#1, main_~init__r522~0#1, main_~init__tmp___16~0#1, main_~init__r532~0#1, main_~init__tmp___17~0#1, main_~init__r542~0#1, main_~init__tmp___18~0#1, main_~init__r123~0#1, main_~init__tmp___19~0#1, main_~init__r133~0#1, main_~init__tmp___20~0#1, main_~init__r143~0#1, main_~init__tmp___21~0#1, main_~init__r153~0#1, main_~init__tmp___22~0#1, main_~init__r213~0#1, main_~init__tmp___23~0#1, main_~init__r233~0#1, main_~init__tmp___24~0#1, main_~init__r243~0#1, main_~init__tmp___25~0#1, main_~init__r253~0#1, main_~init__tmp___26~0#1, main_~init__r313~0#1, main_~init__tmp___27~0#1, main_~init__r323~0#1, main_~init__tmp___28~0#1, main_~init__r343~0#1, main_~init__tmp___29~0#1, main_~init__r353~0#1, main_~init__tmp___30~0#1, main_~init__r413~0#1, main_~init__tmp___31~0#1, main_~init__r423~0#1, main_~init__tmp___32~0#1, main_~init__r433~0#1, main_~init__tmp___33~0#1, main_~init__r453~0#1, main_~init__tmp___34~0#1, main_~init__r513~0#1, main_~init__tmp___35~0#1, main_~init__r523~0#1, main_~init__tmp___36~0#1, main_~init__r533~0#1, main_~init__tmp___37~0#1, main_~init__r543~0#1, main_~init__tmp___38~0#1, main_~init__r124~0#1, main_~init__tmp___39~0#1, main_~init__r134~0#1, main_~init__tmp___40~0#1, main_~init__r144~0#1, main_~init__tmp___41~0#1, main_~init__r154~0#1, main_~init__tmp___42~0#1, main_~init__r214~0#1, main_~init__tmp___43~0#1, main_~init__r234~0#1, main_~init__tmp___44~0#1, main_~init__r244~0#1, main_~init__tmp___45~0#1, main_~init__r254~0#1, main_~init__tmp___46~0#1, main_~init__r314~0#1, main_~init__tmp___47~0#1, main_~init__r324~0#1, main_~init__tmp___48~0#1, main_~init__r344~0#1, main_~init__tmp___49~0#1, main_~init__r354~0#1, main_~init__tmp___50~0#1, main_~init__r414~0#1, main_~init__tmp___51~0#1, main_~init__r424~0#1, main_~init__tmp___52~0#1, main_~init__r434~0#1, main_~init__tmp___53~0#1, main_~init__r454~0#1, main_~init__tmp___54~0#1, main_~init__r514~0#1, main_~init__tmp___55~0#1, main_~init__r524~0#1, main_~init__tmp___56~0#1, main_~init__r534~0#1, main_~init__tmp___57~0#1, main_~init__r544~0#1, main_~init__tmp___58~0#1, main_~init__tmp___59~0#1; [2025-02-05 16:50:43,995 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1225: havoc main_~node2__newmax~1#1; [2025-02-05 16:50:43,995 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1623: havoc main_~node3__newmax~2#1; [2025-02-05 16:50:43,995 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4266: havoc main_~node1____CPAchecker_TMP_3~1#1;havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:50:43,995 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2021: havoc main_~node4__newmax~3#1; [2025-02-05 16:50:43,995 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7176: havoc main_~node2____CPAchecker_TMP_3~4#1;havoc main_~node2____CPAchecker_TMP_2~4#1;havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-02-05 16:50:43,995 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6786: havoc main_~node4____CPAchecker_TMP_3~4#1;havoc main_~node4____CPAchecker_TMP_2~4#1;havoc main_~node4____CPAchecker_TMP_1~4#1;havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-02-05 16:50:43,995 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L980: havoc main_~node4__newmax~0#1; [2025-02-05 16:50:43,995 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1378: havoc main_~node5__newmax~1#1; [2025-02-05 16:50:43,995 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6141: havoc main_~node2____CPAchecker_TMP_3~3#1;havoc main_~node2____CPAchecker_TMP_2~3#1;havoc main_~node2____CPAchecker_TMP_1~3#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1521: havoc main_~node1__newmax~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1919: havoc main_~node2__newmax~3#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5751: havoc main_~node4____CPAchecker_TMP_3~3#1;havoc main_~node4____CPAchecker_TMP_2~3#1;havoc main_~node4____CPAchecker_TMP_1~3#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2322: havoc main_~node3__newmax~4#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3648: havoc main_~node4____CPAchecker_TMP_3~1#1;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5106: havoc main_~node2____CPAchecker_TMP_3~2#1;havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L878: havoc main_~node2__newmax~0#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2729: havoc main_~node3____CPAchecker_TMP_3~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1276: havoc main_~node3__newmax~1#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1674: havoc main_~node4__newmax~2#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4716: havoc main_~node4____CPAchecker_TMP_3~2#1;havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2075: havoc main_~node5__newmax~3#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4060: havoc main_~node2____CPAchecker_TMP_3~1#1;havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:50:43,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3139: havoc main_~node1____CPAchecker_TMP_3~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:50:44,572 INFO L? ?]: Removed 355 outVars from TransFormulas that were not future-live. [2025-02-05 16:50:44,572 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:50:44,611 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:50:44,611 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:50:44,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:50:44 BoogieIcfgContainer [2025-02-05 16:50:44,612 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:50:44,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:50:44,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:50:44,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:50:44,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:50:39" (1/3) ... [2025-02-05 16:50:44,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b34ce99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:50:44, skipping insertion in model container [2025-02-05 16:50:44,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:50:40" (2/3) ... [2025-02-05 16:50:44,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b34ce99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:50:44, skipping insertion in model container [2025-02-05 16:50:44,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:50:44" (3/3) ... [2025-02-05 16:50:44,623 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:50:44,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:50:44,638 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c that has 1 procedures, 1524 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:50:44,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:50:44,734 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;@49762f88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:50:44,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:50:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 1524 states, 1522 states have (on average 1.7772667542706964) internal successors, (2705), 1523 states have internal predecessors, (2705), 0 states have call successors, (0), 0 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:50:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-05 16:50:44,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:44,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:44,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:50:44,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:44,785 INFO L85 PathProgramCache]: Analyzing trace with hash 288983344, now seen corresponding path program 1 times [2025-02-05 16:50:44,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:44,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869245935] [2025-02-05 16:50:44,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:44,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:44,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-05 16:50:45,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-05 16:50:45,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:45,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:45,626 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:50:45,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:45,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869245935] [2025-02-05 16:50:45,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869245935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:45,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:45,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:45,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710722675] [2025-02-05 16:50:45,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:45,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:45,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:45,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:45,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:45,658 INFO L87 Difference]: Start difference. First operand has 1524 states, 1522 states have (on average 1.7772667542706964) internal successors, (2705), 1523 states have internal predecessors, (2705), 0 states have call successors, (0), 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 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:50:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:45,854 INFO L93 Difference]: Finished difference Result 2972 states and 5190 transitions. [2025-02-05 16:50:45,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:45,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 372 [2025-02-05 16:50:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:45,879 INFO L225 Difference]: With dead ends: 2972 [2025-02-05 16:50:45,879 INFO L226 Difference]: Without dead ends: 2074 [2025-02-05 16:50:45,884 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:50:45,887 INFO L435 NwaCegarLoop]: 3350 mSDtfsCounter, 1298 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 5653 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:45,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 5653 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:50:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-02-05 16:50:45,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2072. [2025-02-05 16:50:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 2071 states have (on average 1.6793819410912603) internal successors, (3478), 2071 states have internal predecessors, (3478), 0 states have call successors, (0), 0 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:50:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3478 transitions. [2025-02-05 16:50:45,993 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3478 transitions. Word has length 372 [2025-02-05 16:50:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:45,996 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 3478 transitions. [2025-02-05 16:50:45,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:50:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3478 transitions. [2025-02-05 16:50:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-05 16:50:46,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:46,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:46,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:50:46,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:50:46,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1680241643, now seen corresponding path program 1 times [2025-02-05 16:50:46,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:46,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968568289] [2025-02-05 16:50:46,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:46,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:46,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-05 16:50:46,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-05 16:50:46,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:46,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:46,440 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:50:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:46,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968568289] [2025-02-05 16:50:46,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968568289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:46,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:46,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754688746] [2025-02-05 16:50:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:46,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:46,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:46,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:46,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:46,445 INFO L87 Difference]: Start difference. First operand 2072 states and 3478 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:50:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:46,528 INFO L93 Difference]: Finished difference Result 4410 states and 7302 transitions. [2025-02-05 16:50:46,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:46,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 372 [2025-02-05 16:50:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:46,540 INFO L225 Difference]: With dead ends: 4410 [2025-02-05 16:50:46,540 INFO L226 Difference]: Without dead ends: 2998 [2025-02-05 16:50:46,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:46,544 INFO L435 NwaCegarLoop]: 3113 mSDtfsCounter, 1208 mSDsluCounter, 2134 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 5247 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:46,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 5247 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:50:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2025-02-05 16:50:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2996. [2025-02-05 16:50:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2996 states, 2995 states have (on average 1.6624373956594325) internal successors, (4979), 2995 states have internal predecessors, (4979), 0 states have call successors, (0), 0 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:50:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 4979 transitions. [2025-02-05 16:50:46,601 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 4979 transitions. Word has length 372 [2025-02-05 16:50:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:46,601 INFO L471 AbstractCegarLoop]: Abstraction has 2996 states and 4979 transitions. [2025-02-05 16:50:46,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:50:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 4979 transitions. [2025-02-05 16:50:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-05 16:50:46,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:46,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:46,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:50:46,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:50:46,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash 417940474, now seen corresponding path program 1 times [2025-02-05 16:50:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:46,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909151712] [2025-02-05 16:50:46,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:46,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:46,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-05 16:50:46,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-05 16:50:46,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:46,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:46,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:46,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909151712] [2025-02-05 16:50:46,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909151712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:46,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:46,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:50:46,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493861959] [2025-02-05 16:50:46,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:46,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:50:46,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:46,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:50:46,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:50:47,000 INFO L87 Difference]: Start difference. First operand 2996 states and 4979 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:50:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:47,076 INFO L93 Difference]: Finished difference Result 6940 states and 11406 transitions. [2025-02-05 16:50:47,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:50:47,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 372 [2025-02-05 16:50:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:47,092 INFO L225 Difference]: With dead ends: 6940 [2025-02-05 16:50:47,092 INFO L226 Difference]: Without dead ends: 4632 [2025-02-05 16:50:47,097 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:50:47,099 INFO L435 NwaCegarLoop]: 3092 mSDtfsCounter, 1206 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 5210 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:47,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 5210 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:50:47,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-02-05 16:50:47,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4630. [2025-02-05 16:50:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4630 states, 4629 states have (on average 1.6470079930870598) internal successors, (7624), 4629 states have internal predecessors, (7624), 0 states have call successors, (0), 0 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:50:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 7624 transitions. [2025-02-05 16:50:47,188 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 7624 transitions. Word has length 372 [2025-02-05 16:50:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:47,188 INFO L471 AbstractCegarLoop]: Abstraction has 4630 states and 7624 transitions. [2025-02-05 16:50:47,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:50:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 7624 transitions. [2025-02-05 16:50:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-05 16:50:47,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:47,196 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:47,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:50:47,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:50:47,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash 343592524, now seen corresponding path program 1 times [2025-02-05 16:50:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:47,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535274189] [2025-02-05 16:50:47,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:47,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:47,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-05 16:50:47,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-05 16:50:47,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:47,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:47,785 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:50:47,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:47,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535274189] [2025-02-05 16:50:47,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535274189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:47,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:47,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:50:47,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776272048] [2025-02-05 16:50:47,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:47,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:50:47,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:47,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:50:47,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:50:47,789 INFO L87 Difference]: Start difference. First operand 4630 states and 7624 transitions. Second operand has 7 states, 7 states have (on average 53.142857142857146) internal successors, (372), 7 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:50:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:48,327 INFO L93 Difference]: Finished difference Result 18654 states and 31380 transitions. [2025-02-05 16:50:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:50:48,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.142857142857146) internal successors, (372), 7 states have internal predecessors, (372), 0 states have call successors, (0), 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 372 [2025-02-05 16:50:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:48,386 INFO L225 Difference]: With dead ends: 18654 [2025-02-05 16:50:48,386 INFO L226 Difference]: Without dead ends: 17364 [2025-02-05 16:50:48,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:50:48,396 INFO L435 NwaCegarLoop]: 2488 mSDtfsCounter, 10489 mSDsluCounter, 11220 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10489 SdHoareTripleChecker+Valid, 13708 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:48,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10489 Valid, 13708 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:50:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17364 states. [2025-02-05 16:50:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17364 to 6590. [2025-02-05 16:50:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6590 states, 6589 states have (on average 1.654879344361815) internal successors, (10904), 6589 states have internal predecessors, (10904), 0 states have call successors, (0), 0 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:50:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 10904 transitions. [2025-02-05 16:50:48,656 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 10904 transitions. Word has length 372 [2025-02-05 16:50:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:48,657 INFO L471 AbstractCegarLoop]: Abstraction has 6590 states and 10904 transitions. [2025-02-05 16:50:48,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.142857142857146) internal successors, (372), 7 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:50:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 10904 transitions. [2025-02-05 16:50:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-05 16:50:48,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:48,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:48,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:50:48,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:50:48,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2063504411, now seen corresponding path program 1 times [2025-02-05 16:50:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093455015] [2025-02-05 16:50:48,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:48,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:48,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-05 16:50:48,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-05 16:50:48,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:48,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:49,035 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:50:49,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093455015] [2025-02-05 16:50:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093455015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:49,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:49,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:50:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549692329] [2025-02-05 16:50:49,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:49,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:50:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:49,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:50:49,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:50:49,038 INFO L87 Difference]: Start difference. First operand 6590 states and 10904 transitions. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 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:50:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:49,197 INFO L93 Difference]: Finished difference Result 15692 states and 26243 transitions. [2025-02-05 16:50:49,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:50:49,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 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 373 [2025-02-05 16:50:49,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:49,223 INFO L225 Difference]: With dead ends: 15692 [2025-02-05 16:50:49,223 INFO L226 Difference]: Without dead ends: 13114 [2025-02-05 16:50:49,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:50:49,233 INFO L435 NwaCegarLoop]: 2499 mSDtfsCounter, 3527 mSDsluCounter, 3548 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3527 SdHoareTripleChecker+Valid, 6047 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:49,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3527 Valid, 6047 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:50:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13114 states. [2025-02-05 16:50:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13114 to 10166. [2025-02-05 16:50:49,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10166 states, 10165 states have (on average 1.6613871126414166) internal successors, (16888), 10165 states have internal predecessors, (16888), 0 states have call successors, (0), 0 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:50:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10166 states to 10166 states and 16888 transitions. [2025-02-05 16:50:49,427 INFO L78 Accepts]: Start accepts. Automaton has 10166 states and 16888 transitions. Word has length 373 [2025-02-05 16:50:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:49,428 INFO L471 AbstractCegarLoop]: Abstraction has 10166 states and 16888 transitions. [2025-02-05 16:50:49,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 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:50:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 10166 states and 16888 transitions. [2025-02-05 16:50:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-05 16:50:49,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:49,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:49,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:50:49,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:50:49,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash -453891313, now seen corresponding path program 1 times [2025-02-05 16:50:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:49,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784250911] [2025-02-05 16:50:49,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:49,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:49,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-05 16:50:49,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-05 16:50:49,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:49,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:49,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:49,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784250911] [2025-02-05 16:50:49,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784250911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:49,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:50:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805597629] [2025-02-05 16:50:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:49,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:50:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:49,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:50:49,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:50:49,783 INFO L87 Difference]: Start difference. First operand 10166 states and 16888 transitions. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:50:49,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:49,958 INFO L93 Difference]: Finished difference Result 27156 states and 45503 transitions. [2025-02-05 16:50:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:50:49,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 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 374 [2025-02-05 16:50:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:50,004 INFO L225 Difference]: With dead ends: 27156 [2025-02-05 16:50:50,004 INFO L226 Difference]: Without dead ends: 22018 [2025-02-05 16:50:50,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:50:50,023 INFO L435 NwaCegarLoop]: 2778 mSDtfsCounter, 3458 mSDsluCounter, 3349 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3458 SdHoareTripleChecker+Valid, 6127 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:50,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3458 Valid, 6127 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:50:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22018 states. [2025-02-05 16:50:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22018 to 16398. [2025-02-05 16:50:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16398 states, 16397 states have (on average 1.665548575959017) internal successors, (27310), 16397 states have internal predecessors, (27310), 0 states have call successors, (0), 0 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:50:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16398 states to 16398 states and 27310 transitions. [2025-02-05 16:50:50,394 INFO L78 Accepts]: Start accepts. Automaton has 16398 states and 27310 transitions. Word has length 374 [2025-02-05 16:50:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:50,395 INFO L471 AbstractCegarLoop]: Abstraction has 16398 states and 27310 transitions. [2025-02-05 16:50:50,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:50:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 16398 states and 27310 transitions. [2025-02-05 16:50:50,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-05 16:50:50,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:50,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:50,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:50:50,410 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:50:50,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2008895500, now seen corresponding path program 1 times [2025-02-05 16:50:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:50,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280549916] [2025-02-05 16:50:50,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:50,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:50,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-05 16:50:50,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-05 16:50:50,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:50,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:50,974 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:50:50,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:50,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280549916] [2025-02-05 16:50:50,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280549916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:50,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:50,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:50:50,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802983472] [2025-02-05 16:50:50,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:50,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:50:50,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:50,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:50:50,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:50:50,978 INFO L87 Difference]: Start difference. First operand 16398 states and 27310 transitions. Second operand has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 7 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:50:51,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:51,442 INFO L93 Difference]: Finished difference Result 58074 states and 97582 transitions. [2025-02-05 16:50:51,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:50:51,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 7 states have internal predecessors, (374), 0 states have call successors, (0), 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 374 [2025-02-05 16:50:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:51,564 INFO L225 Difference]: With dead ends: 58074 [2025-02-05 16:50:51,564 INFO L226 Difference]: Without dead ends: 52936 [2025-02-05 16:50:51,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:50:51,602 INFO L435 NwaCegarLoop]: 3540 mSDtfsCounter, 7662 mSDsluCounter, 9149 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7662 SdHoareTripleChecker+Valid, 12689 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:51,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7662 Valid, 12689 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:50:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52936 states. [2025-02-05 16:50:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52936 to 24534. [2025-02-05 16:50:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24534 states, 24533 states have (on average 1.6704031304773164) internal successors, (40980), 24533 states have internal predecessors, (40980), 0 states have call successors, (0), 0 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:50:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24534 states to 24534 states and 40980 transitions. [2025-02-05 16:50:52,240 INFO L78 Accepts]: Start accepts. Automaton has 24534 states and 40980 transitions. Word has length 374 [2025-02-05 16:50:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:52,242 INFO L471 AbstractCegarLoop]: Abstraction has 24534 states and 40980 transitions. [2025-02-05 16:50:52,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 7 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:50:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 24534 states and 40980 transitions. [2025-02-05 16:50:52,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-05 16:50:52,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:52,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:52,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:50:52,259 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:50:52,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:52,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1465550868, now seen corresponding path program 1 times [2025-02-05 16:50:52,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:52,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761697774] [2025-02-05 16:50:52,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:52,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:52,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-05 16:50:52,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-05 16:50:52,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:52,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:52,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:52,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761697774] [2025-02-05 16:50:52,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761697774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:52,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:52,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:50:52,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198044410] [2025-02-05 16:50:52,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:52,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:50:52,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:52,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:50:52,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:50:52,745 INFO L87 Difference]: Start difference. First operand 24534 states and 40980 transitions. Second operand has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 7 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:50:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:53,171 INFO L93 Difference]: Finished difference Result 63658 states and 106972 transitions. [2025-02-05 16:50:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:50:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 7 states have internal predecessors, (374), 0 states have call successors, (0), 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 374 [2025-02-05 16:50:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:53,249 INFO L225 Difference]: With dead ends: 63658 [2025-02-05 16:50:53,250 INFO L226 Difference]: Without dead ends: 58520 [2025-02-05 16:50:53,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:50:53,272 INFO L435 NwaCegarLoop]: 3330 mSDtfsCounter, 7728 mSDsluCounter, 8080 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7728 SdHoareTripleChecker+Valid, 11410 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:53,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7728 Valid, 11410 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:50:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58520 states. [2025-02-05 16:50:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58520 to 32686. [2025-02-05 16:50:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32686 states, 32685 states have (on average 1.673489368211718) internal successors, (54698), 32685 states have internal predecessors, (54698), 0 states have call successors, (0), 0 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:50:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32686 states to 32686 states and 54698 transitions. [2025-02-05 16:50:53,762 INFO L78 Accepts]: Start accepts. Automaton has 32686 states and 54698 transitions. Word has length 374 [2025-02-05 16:50:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:53,763 INFO L471 AbstractCegarLoop]: Abstraction has 32686 states and 54698 transitions. [2025-02-05 16:50:53,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 7 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:50:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 32686 states and 54698 transitions. [2025-02-05 16:50:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-05 16:50:53,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:53,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:53,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:50:53,845 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:50:53,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:53,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1438463691, now seen corresponding path program 1 times [2025-02-05 16:50:53,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:53,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696979292] [2025-02-05 16:50:53,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:53,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:53,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-05 16:50:53,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-05 16:50:53,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:53,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:50:54,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:54,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696979292] [2025-02-05 16:50:54,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696979292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:54,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:54,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:50:54,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317695497] [2025-02-05 16:50:54,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:54,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:50:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:54,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:50:54,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:50:54,244 INFO L87 Difference]: Start difference. First operand 32686 states and 54698 transitions. Second operand has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 7 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:50:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:54,626 INFO L93 Difference]: Finished difference Result 74090 states and 124536 transitions. [2025-02-05 16:50:54,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:50:54,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 7 states have internal predecessors, (374), 0 states have call successors, (0), 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 374 [2025-02-05 16:50:54,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:54,831 INFO L225 Difference]: With dead ends: 74090 [2025-02-05 16:50:54,831 INFO L226 Difference]: Without dead ends: 63848 [2025-02-05 16:50:54,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:50:54,849 INFO L435 NwaCegarLoop]: 3107 mSDtfsCounter, 7587 mSDsluCounter, 8490 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7587 SdHoareTripleChecker+Valid, 11597 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:54,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7587 Valid, 11597 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:50:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63848 states. [2025-02-05 16:50:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63848 to 42954. [2025-02-05 16:50:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42954 states, 42953 states have (on average 1.6756454729588155) internal successors, (71974), 42953 states have internal predecessors, (71974), 0 states have call successors, (0), 0 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:50:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42954 states to 42954 states and 71974 transitions. [2025-02-05 16:50:55,561 INFO L78 Accepts]: Start accepts. Automaton has 42954 states and 71974 transitions. Word has length 374 [2025-02-05 16:50:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:55,563 INFO L471 AbstractCegarLoop]: Abstraction has 42954 states and 71974 transitions. [2025-02-05 16:50:55,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 7 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:50:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 42954 states and 71974 transitions. [2025-02-05 16:50:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-05 16:50:55,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:55,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:55,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:50:55,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:50:55,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1481525355, now seen corresponding path program 1 times [2025-02-05 16:50:55,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:55,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754899541] [2025-02-05 16:50:55,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:55,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:55,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-05 16:50:55,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-05 16:50:55,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:55,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:56,086 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:50:56,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:56,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754899541] [2025-02-05 16:50:56,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754899541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:56,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:56,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:50:56,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14270273] [2025-02-05 16:50:56,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:56,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:50:56,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:56,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:50:56,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:50:56,088 INFO L87 Difference]: Start difference. First operand 42954 states and 71974 transitions. Second operand has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 7 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:50:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:56,629 INFO L93 Difference]: Finished difference Result 84346 states and 141800 transitions. [2025-02-05 16:50:56,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:50:56,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 7 states have internal predecessors, (374), 0 states have call successors, (0), 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 374 [2025-02-05 16:50:56,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:56,730 INFO L225 Difference]: With dead ends: 84346 [2025-02-05 16:50:56,730 INFO L226 Difference]: Without dead ends: 74104 [2025-02-05 16:50:56,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:50:56,744 INFO L435 NwaCegarLoop]: 2921 mSDtfsCounter, 7835 mSDsluCounter, 9365 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7835 SdHoareTripleChecker+Valid, 12286 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:56,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7835 Valid, 12286 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:50:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74104 states. [2025-02-05 16:50:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74104 to 53474. [2025-02-05 16:50:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53474 states, 53473 states have (on average 1.6768088568062387) internal successors, (89664), 53473 states have internal predecessors, (89664), 0 states have call successors, (0), 0 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:50:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53474 states to 53474 states and 89664 transitions. [2025-02-05 16:50:57,635 INFO L78 Accepts]: Start accepts. Automaton has 53474 states and 89664 transitions. Word has length 374 [2025-02-05 16:50:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:57,635 INFO L471 AbstractCegarLoop]: Abstraction has 53474 states and 89664 transitions. [2025-02-05 16:50:57,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.42857142857143) internal successors, (374), 7 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:50:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 53474 states and 89664 transitions. [2025-02-05 16:50:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-05 16:50:57,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:57,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:57,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:50:57,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:50:57,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1183836802, now seen corresponding path program 1 times [2025-02-05 16:50:57,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:57,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152917631] [2025-02-05 16:50:57,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:57,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:57,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-05 16:50:57,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 16:50:57,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:57,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:50:57,916 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:50:57,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:50:57,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152917631] [2025-02-05 16:50:57,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152917631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:50:57,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:50:57,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:50:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021867734] [2025-02-05 16:50:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:50:57,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:50:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:50:57,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:50:57,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:50:57,918 INFO L87 Difference]: Start difference. First operand 53474 states and 89664 transitions. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 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:50:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:50:58,424 INFO L93 Difference]: Finished difference Result 146620 states and 246611 transitions. [2025-02-05 16:50:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:50:58,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 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 375 [2025-02-05 16:50:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:50:58,561 INFO L225 Difference]: With dead ends: 146620 [2025-02-05 16:50:58,561 INFO L226 Difference]: Without dead ends: 100506 [2025-02-05 16:50:58,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:50:58,601 INFO L435 NwaCegarLoop]: 2499 mSDtfsCounter, 3389 mSDsluCounter, 3150 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3389 SdHoareTripleChecker+Valid, 5649 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:50:58,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3389 Valid, 5649 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:50:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100506 states. [2025-02-05 16:50:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100506 to 90050. [2025-02-05 16:50:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90050 states, 90049 states have (on average 1.6768426079134693) internal successors, (150998), 90049 states have internal predecessors, (150998), 0 states have call successors, (0), 0 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:50:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90050 states to 90050 states and 150998 transitions. [2025-02-05 16:50:59,740 INFO L78 Accepts]: Start accepts. Automaton has 90050 states and 150998 transitions. Word has length 375 [2025-02-05 16:50:59,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:50:59,740 INFO L471 AbstractCegarLoop]: Abstraction has 90050 states and 150998 transitions. [2025-02-05 16:50:59,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 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:50:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 90050 states and 150998 transitions. [2025-02-05 16:50:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-05 16:50:59,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:50:59,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:59,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:50:59,755 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:50:59,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:50:59,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1814634107, now seen corresponding path program 1 times [2025-02-05 16:50:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:50:59,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575512765] [2025-02-05 16:50:59,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:50:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:50:59,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-05 16:50:59,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 16:50:59,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:50:59,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:00,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:51:00,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:00,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575512765] [2025-02-05 16:51:00,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575512765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:00,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:00,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:51:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343709401] [2025-02-05 16:51:00,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:00,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:51:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:00,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:51:00,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:51:00,287 INFO L87 Difference]: Start difference. First operand 90050 states and 150998 transitions. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 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:51:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:00,683 INFO L93 Difference]: Finished difference Result 131408 states and 220791 transitions. [2025-02-05 16:51:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:51:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 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 375 [2025-02-05 16:51:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:00,989 INFO L225 Difference]: With dead ends: 131408 [2025-02-05 16:51:00,990 INFO L226 Difference]: Without dead ends: 110894 [2025-02-05 16:51:01,010 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:51:01,012 INFO L435 NwaCegarLoop]: 3350 mSDtfsCounter, 1939 mSDsluCounter, 4264 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1939 SdHoareTripleChecker+Valid, 7614 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:01,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1939 Valid, 7614 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:51:01,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110894 states. [2025-02-05 16:51:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110894 to 100530. [2025-02-05 16:51:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100530 states, 100529 states have (on average 1.6777447303763093) internal successors, (168662), 100529 states have internal predecessors, (168662), 0 states have call successors, (0), 0 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:51:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100530 states to 100530 states and 168662 transitions. [2025-02-05 16:51:02,154 INFO L78 Accepts]: Start accepts. Automaton has 100530 states and 168662 transitions. Word has length 375 [2025-02-05 16:51:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:02,155 INFO L471 AbstractCegarLoop]: Abstraction has 100530 states and 168662 transitions. [2025-02-05 16:51:02,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 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:51:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 100530 states and 168662 transitions. [2025-02-05 16:51:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-05 16:51:02,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:02,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:02,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:51:02,170 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:02,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1820801667, now seen corresponding path program 1 times [2025-02-05 16:51:02,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:02,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99543091] [2025-02-05 16:51:02,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:02,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:02,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-05 16:51:02,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 16:51:02,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:02,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:02,666 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:51:02,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:02,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99543091] [2025-02-05 16:51:02,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99543091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:02,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:02,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:51:02,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837581673] [2025-02-05 16:51:02,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:02,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:51:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:02,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:51:02,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:51:02,669 INFO L87 Difference]: Start difference. First operand 100530 states and 168662 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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:51:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:03,492 INFO L93 Difference]: Finished difference Result 219388 states and 368266 transitions. [2025-02-05 16:51:03,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:51:03,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 375 [2025-02-05 16:51:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:03,708 INFO L225 Difference]: With dead ends: 219388 [2025-02-05 16:51:03,708 INFO L226 Difference]: Without dead ends: 171266 [2025-02-05 16:51:03,787 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:51:03,788 INFO L435 NwaCegarLoop]: 2696 mSDtfsCounter, 1380 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 5045 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:03,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 5045 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:51:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171266 states. [2025-02-05 16:51:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171266 to 170976. [2025-02-05 16:51:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170976 states, 170975 states have (on average 1.6760579032022225) internal successors, (286564), 170975 states have internal predecessors, (286564), 0 states have call successors, (0), 0 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:51:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170976 states to 170976 states and 286564 transitions. [2025-02-05 16:51:06,243 INFO L78 Accepts]: Start accepts. Automaton has 170976 states and 286564 transitions. Word has length 375 [2025-02-05 16:51:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:06,244 INFO L471 AbstractCegarLoop]: Abstraction has 170976 states and 286564 transitions. [2025-02-05 16:51:06,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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:51:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 170976 states and 286564 transitions. [2025-02-05 16:51:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-05 16:51:06,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:06,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:06,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:51:06,266 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:06,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:06,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2060320129, now seen corresponding path program 1 times [2025-02-05 16:51:06,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:06,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395811484] [2025-02-05 16:51:06,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:06,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:06,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-05 16:51:06,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-05 16:51:06,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:06,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:06,747 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:51:06,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:06,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395811484] [2025-02-05 16:51:06,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395811484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:06,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:06,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:51:06,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112951958] [2025-02-05 16:51:06,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:06,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:51:06,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:06,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:51:06,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:51:06,749 INFO L87 Difference]: Start difference. First operand 170976 states and 286564 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:51:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:08,190 INFO L93 Difference]: Finished difference Result 506505 states and 848958 transitions. [2025-02-05 16:51:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:51:08,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 376 [2025-02-05 16:51:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:08,714 INFO L225 Difference]: With dead ends: 506505 [2025-02-05 16:51:08,715 INFO L226 Difference]: Without dead ends: 335634 [2025-02-05 16:51:09,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:51:09,128 INFO L435 NwaCegarLoop]: 3384 mSDtfsCounter, 2271 mSDsluCounter, 2481 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 5865 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:09,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2271 Valid, 5865 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:51:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335634 states. [2025-02-05 16:51:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335634 to 335632. [2025-02-05 16:51:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335632 states, 335631 states have (on average 1.6700185620517771) internal successors, (560510), 335631 states have internal predecessors, (560510), 0 states have call successors, (0), 0 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:51:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335632 states to 335632 states and 560510 transitions. [2025-02-05 16:51:13,841 INFO L78 Accepts]: Start accepts. Automaton has 335632 states and 560510 transitions. Word has length 376 [2025-02-05 16:51:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:51:13,841 INFO L471 AbstractCegarLoop]: Abstraction has 335632 states and 560510 transitions. [2025-02-05 16:51:13,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:51:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 335632 states and 560510 transitions. [2025-02-05 16:51:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-05 16:51:13,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:51:13,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:13,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:51:13,883 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:51:13,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:51:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1945217633, now seen corresponding path program 1 times [2025-02-05 16:51:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:51:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30374630] [2025-02-05 16:51:13,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:51:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:51:13,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-05 16:51:14,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-05 16:51:14,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:51:14,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:51:14,152 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:51:14,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:51:14,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30374630] [2025-02-05 16:51:14,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30374630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:51:14,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:51:14,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:51:14,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658169448] [2025-02-05 16:51:14,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:51:14,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:51:14,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:51:14,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:51:14,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:51:14,155 INFO L87 Difference]: Start difference. First operand 335632 states and 560510 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:51:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:51:17,663 INFO L93 Difference]: Finished difference Result 999101 states and 1668189 transitions. [2025-02-05 16:51:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:51:17,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 376 [2025-02-05 16:51:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:51:18,788 INFO L225 Difference]: With dead ends: 999101 [2025-02-05 16:51:18,788 INFO L226 Difference]: Without dead ends: 663610 [2025-02-05 16:51:18,956 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:51:18,957 INFO L435 NwaCegarLoop]: 3492 mSDtfsCounter, 2338 mSDsluCounter, 2481 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2338 SdHoareTripleChecker+Valid, 5973 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:51:18,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2338 Valid, 5973 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:51:19,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663610 states.