./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b4e579e156345915e1fde26fcd53bce80a36e2067cd5c9341971cdf8691491e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:02:03,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:02:03,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:02:03,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:02:03,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:02:03,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:02:03,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:02:03,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:02:03,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:02:03,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:02:03,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:02:03,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:02:03,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:02:03,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:02:03,707 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:02:03,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:02:03,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:02:03,707 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:02:03,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:02:03,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:02:03,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:02:03,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:02:03,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:02:03,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:02:03,708 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:02:03,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:02:03,708 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:02:03,708 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:02:03,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:02:03,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:02:03,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:02:03,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:02:03,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:02:03,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:02:03,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:02:03,709 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:02:03,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:02:03,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:02:03,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:02:03,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:02:03,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:02:03,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:02:03,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:02:03,710 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b4e579e156345915e1fde26fcd53bce80a36e2067cd5c9341971cdf8691491e [2025-03-03 15:02:03,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:02:03,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:02:03,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:02:03,957 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:02:03,958 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:02:03,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-03 15:02:05,218 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42debcdfd/3d813668b0fa462eb150674e138f5943/FLAG6293ccab7 [2025-03-03 15:02:05,517 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:02:05,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-03 15:02:05,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42debcdfd/3d813668b0fa462eb150674e138f5943/FLAG6293ccab7 [2025-03-03 15:02:05,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42debcdfd/3d813668b0fa462eb150674e138f5943 [2025-03-03 15:02:05,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:02:05,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:02:05,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:02:05,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:02:05,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:02:05,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:05,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38784a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05, skipping insertion in model container [2025-03-03 15:02:05,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:05,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:02:05,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[12498,12511] [2025-03-03 15:02:05,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:02:05,836 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:02:05,886 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[12498,12511] [2025-03-03 15:02:05,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:02:05,922 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:02:05,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05 WrapperNode [2025-03-03 15:02:05,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:02:05,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:02:05,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:02:05,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:02:05,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:05,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:05,979 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1327 [2025-03-03 15:02:05,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:02:05,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:02:05,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:02:05,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:02:05,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:05,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:05,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:06,017 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:02:06,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:06,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:06,041 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:06,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:06,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:06,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:06,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:02:06,053 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:02:06,053 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:02:06,054 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:02:06,054 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (1/1) ... [2025-03-03 15:02:06,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:02:06,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:02:06,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:02:06,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:02:06,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:02:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:02:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:02:06,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:02:06,200 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:02:06,202 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:02:07,042 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1096: 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-03-03 15:02:07,043 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: 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-03-03 15:02:07,043 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L818: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:02:07,043 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~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__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-03-03 15:02:07,043 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L659: 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-03-03 15:02:07,043 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L957: 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-03-03 15:02:07,127 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-03-03 15:02:07,128 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:02:07,138 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:02:07,138 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:02:07,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:02:07 BoogieIcfgContainer [2025-03-03 15:02:07,139 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:02:07,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:02:07,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:02:07,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:02:07,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:02:05" (1/3) ... [2025-03-03 15:02:07,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d724648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:02:07, skipping insertion in model container [2025-03-03 15:02:07,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:05" (2/3) ... [2025-03-03 15:02:07,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d724648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:02:07, skipping insertion in model container [2025-03-03 15:02:07,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:02:07" (3/3) ... [2025-03-03 15:02:07,145 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-03 15:02:07,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:02:07,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c that has 1 procedures, 307 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:02:07,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:02:07,221 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;@16f57d17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:02:07,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:02:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 307 states, 305 states have (on average 1.79672131147541) internal successors, (548), 306 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:02:07,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:07,236 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] [2025-03-03 15:02:07,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:07,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:07,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1444359743, now seen corresponding path program 1 times [2025-03-03 15:02:07,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:07,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988725282] [2025-03-03 15:02:07,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:07,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:07,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:02:07,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:02:07,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:07,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:07,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:07,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988725282] [2025-03-03 15:02:07,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988725282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:07,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:07,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:07,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704130559] [2025-03-03 15:02:07,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:07,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:07,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:07,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:07,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:07,817 INFO L87 Difference]: Start difference. First operand has 307 states, 305 states have (on average 1.79672131147541) internal successors, (548), 306 states have internal predecessors, (548), 0 states have call successors, (0), 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 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:07,915 INFO L93 Difference]: Finished difference Result 556 states and 967 transitions. [2025-03-03 15:02:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:02:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:07,927 INFO L225 Difference]: With dead ends: 556 [2025-03-03 15:02:07,927 INFO L226 Difference]: Without dead ends: 420 [2025-03-03 15:02:07,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:07,934 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 210 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:07,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1194 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-03 15:02:07,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 418. [2025-03-03 15:02:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.683453237410072) internal successors, (702), 417 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 702 transitions. [2025-03-03 15:02:07,982 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 702 transitions. Word has length 99 [2025-03-03 15:02:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:07,983 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 702 transitions. [2025-03-03 15:02:07,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 702 transitions. [2025-03-03 15:02:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:02:07,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:07,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:02:07,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:02:07,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:07,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:07,987 INFO L85 PathProgramCache]: Analyzing trace with hash 723029275, now seen corresponding path program 1 times [2025-03-03 15:02:07,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:07,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055450218] [2025-03-03 15:02:07,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:07,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:08,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:02:08,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:02:08,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:08,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:08,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:08,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055450218] [2025-03-03 15:02:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055450218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163467597] [2025-03-03 15:02:08,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:08,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:08,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:08,186 INFO L87 Difference]: Start difference. First operand 418 states and 702 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:08,219 INFO L93 Difference]: Finished difference Result 648 states and 1093 transitions. [2025-03-03 15:02:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:08,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-03 15:02:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:08,226 INFO L225 Difference]: With dead ends: 648 [2025-03-03 15:02:08,227 INFO L226 Difference]: Without dead ends: 521 [2025-03-03 15:02:08,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:08,229 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 196 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:08,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1149 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-03 15:02:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 519. [2025-03-03 15:02:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.6872586872586872) internal successors, (874), 518 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 874 transitions. [2025-03-03 15:02:08,258 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 874 transitions. Word has length 102 [2025-03-03 15:02:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:08,259 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 874 transitions. [2025-03-03 15:02:08,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 874 transitions. [2025-03-03 15:02:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:02:08,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:08,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:02:08,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:02:08,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:08,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:08,261 INFO L85 PathProgramCache]: Analyzing trace with hash -416502833, now seen corresponding path program 1 times [2025-03-03 15:02:08,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:08,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881062156] [2025-03-03 15:02:08,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:08,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:08,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:02:08,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:02:08,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:08,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:08,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:08,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881062156] [2025-03-03 15:02:08,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881062156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:08,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:08,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:08,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497229255] [2025-03-03 15:02:08,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:08,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:08,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:08,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:08,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:08,450 INFO L87 Difference]: Start difference. First operand 519 states and 874 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:08,482 INFO L93 Difference]: Finished difference Result 1172 states and 1973 transitions. [2025-03-03 15:02:08,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:08,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-03 15:02:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:08,485 INFO L225 Difference]: With dead ends: 1172 [2025-03-03 15:02:08,485 INFO L226 Difference]: Without dead ends: 832 [2025-03-03 15:02:08,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:08,489 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 189 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:08,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1006 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:08,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-03 15:02:08,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 830. [2025-03-03 15:02:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 1.6815440289505428) internal successors, (1394), 829 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1394 transitions. [2025-03-03 15:02:08,510 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1394 transitions. Word has length 102 [2025-03-03 15:02:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:08,511 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1394 transitions. [2025-03-03 15:02:08,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1394 transitions. [2025-03-03 15:02:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:02:08,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:08,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:02:08,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:02:08,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:08,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash 288306379, now seen corresponding path program 1 times [2025-03-03 15:02:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023762987] [2025-03-03 15:02:08,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:08,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:02:08,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:02:08,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:08,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:08,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:08,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023762987] [2025-03-03 15:02:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023762987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:08,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:08,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:08,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858908161] [2025-03-03 15:02:08,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:08,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:08,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:08,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:08,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:08,670 INFO L87 Difference]: Start difference. First operand 830 states and 1394 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:08,701 INFO L93 Difference]: Finished difference Result 2078 states and 3482 transitions. [2025-03-03 15:02:08,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:08,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 15:02:08,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:08,707 INFO L225 Difference]: With dead ends: 2078 [2025-03-03 15:02:08,707 INFO L226 Difference]: Without dead ends: 1427 [2025-03-03 15:02:08,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:08,709 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 183 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:08,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1007 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-03-03 15:02:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1425. [2025-03-03 15:02:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1424 states have (on average 1.6713483146067416) internal successors, (2380), 1424 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 2380 transitions. [2025-03-03 15:02:08,736 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 2380 transitions. Word has length 105 [2025-03-03 15:02:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:08,736 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 2380 transitions. [2025-03-03 15:02:08,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:08,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 2380 transitions. [2025-03-03 15:02:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:02:08,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:08,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:02:08,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:02:08,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:08,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:08,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1541196477, now seen corresponding path program 1 times [2025-03-03 15:02:08,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:08,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116357561] [2025-03-03 15:02:08,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:08,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:02:08,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:02:08,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:08,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:08,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:08,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116357561] [2025-03-03 15:02:08,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116357561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:08,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:08,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:08,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061020082] [2025-03-03 15:02:08,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:08,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:08,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:08,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:08,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:08,872 INFO L87 Difference]: Start difference. First operand 1425 states and 2380 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:08,908 INFO L93 Difference]: Finished difference Result 3809 states and 6338 transitions. [2025-03-03 15:02:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:08,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-03 15:02:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:08,918 INFO L225 Difference]: With dead ends: 3809 [2025-03-03 15:02:08,918 INFO L226 Difference]: Without dead ends: 2563 [2025-03-03 15:02:08,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:08,921 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 177 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:08,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1008 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2025-03-03 15:02:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2561. [2025-03-03 15:02:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2560 states have (on average 1.6578125) internal successors, (4244), 2560 states have internal predecessors, (4244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 4244 transitions. [2025-03-03 15:02:08,966 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 4244 transitions. Word has length 108 [2025-03-03 15:02:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:08,966 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 4244 transitions. [2025-03-03 15:02:08,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 4244 transitions. [2025-03-03 15:02:08,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:02:08,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:08,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:02:08,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:02:08,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:08,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash -510932137, now seen corresponding path program 1 times [2025-03-03 15:02:08,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:08,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752220094] [2025-03-03 15:02:08,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:08,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:08,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:02:09,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:02:09,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:09,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:09,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:09,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752220094] [2025-03-03 15:02:09,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752220094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:09,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:09,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:02:09,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690804964] [2025-03-03 15:02:09,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:09,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:02:09,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:09,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:02:09,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:02:09,179 INFO L87 Difference]: Start difference. First operand 2561 states and 4244 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:09,452 INFO L93 Difference]: Finished difference Result 14281 states and 23832 transitions. [2025-03-03 15:02:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:02:09,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-03 15:02:09,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:09,489 INFO L225 Difference]: With dead ends: 14281 [2025-03-03 15:02:09,490 INFO L226 Difference]: Without dead ends: 11899 [2025-03-03 15:02:09,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:02:09,497 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2342 mSDsluCounter, 2804 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:09,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2342 Valid, 3330 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11899 states. [2025-03-03 15:02:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11899 to 4826. [2025-03-03 15:02:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4825 states have (on average 1.6534715025906737) internal successors, (7978), 4825 states have internal predecessors, (7978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 7978 transitions. [2025-03-03 15:02:09,632 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 7978 transitions. Word has length 111 [2025-03-03 15:02:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:09,632 INFO L471 AbstractCegarLoop]: Abstraction has 4826 states and 7978 transitions. [2025-03-03 15:02:09,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 7978 transitions. [2025-03-03 15:02:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:02:09,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:09,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:02:09,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:02:09,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:09,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:09,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1342941195, now seen corresponding path program 1 times [2025-03-03 15:02:09,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:09,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736479544] [2025-03-03 15:02:09,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:09,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:09,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:02:09,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:02:09,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:09,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:09,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:09,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736479544] [2025-03-03 15:02:09,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736479544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:09,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:09,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:09,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541177419] [2025-03-03 15:02:09,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:09,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:09,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:09,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:09,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:09,794 INFO L87 Difference]: Start difference. First operand 4826 states and 7978 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:09,936 INFO L93 Difference]: Finished difference Result 15441 states and 25633 transitions. [2025-03-03 15:02:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:09,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:02:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:09,972 INFO L225 Difference]: With dead ends: 15441 [2025-03-03 15:02:09,972 INFO L226 Difference]: Without dead ends: 10794 [2025-03-03 15:02:09,983 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-03-03 15:02:09,983 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 624 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:09,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1680 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10794 states. [2025-03-03 15:02:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10794 to 7793. [2025-03-03 15:02:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7793 states, 7792 states have (on average 1.6542607802874743) internal successors, (12890), 7792 states have internal predecessors, (12890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7793 states to 7793 states and 12890 transitions. [2025-03-03 15:02:10,197 INFO L78 Accepts]: Start accepts. Automaton has 7793 states and 12890 transitions. Word has length 112 [2025-03-03 15:02:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:10,197 INFO L471 AbstractCegarLoop]: Abstraction has 7793 states and 12890 transitions. [2025-03-03 15:02:10,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 7793 states and 12890 transitions. [2025-03-03 15:02:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:02:10,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:10,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:02:10,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:02:10,199 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:10,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash -893712265, now seen corresponding path program 1 times [2025-03-03 15:02:10,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:10,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082703969] [2025-03-03 15:02:10,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:10,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:10,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:02:10,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:02:10,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:10,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:10,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:10,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082703969] [2025-03-03 15:02:10,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082703969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:10,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:10,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:10,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298647131] [2025-03-03 15:02:10,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:10,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:10,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:10,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:10,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:10,296 INFO L87 Difference]: Start difference. First operand 7793 states and 12890 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:10,352 INFO L93 Difference]: Finished difference Result 15115 states and 25066 transitions. [2025-03-03 15:02:10,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:10,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:02:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:10,372 INFO L225 Difference]: With dead ends: 15115 [2025-03-03 15:02:10,373 INFO L226 Difference]: Without dead ends: 11001 [2025-03-03 15:02:10,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:10,382 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 178 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:10,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1043 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11001 states. [2025-03-03 15:02:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11001 to 10999. [2025-03-03 15:02:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10999 states, 10998 states have (on average 1.6513002364066194) internal successors, (18161), 10998 states have internal predecessors, (18161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10999 states to 10999 states and 18161 transitions. [2025-03-03 15:02:10,606 INFO L78 Accepts]: Start accepts. Automaton has 10999 states and 18161 transitions. Word has length 112 [2025-03-03 15:02:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:10,607 INFO L471 AbstractCegarLoop]: Abstraction has 10999 states and 18161 transitions. [2025-03-03 15:02:10,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 10999 states and 18161 transitions. [2025-03-03 15:02:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:02:10,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:10,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:02:10,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:02:10,608 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:10,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:10,609 INFO L85 PathProgramCache]: Analyzing trace with hash -885639165, now seen corresponding path program 1 times [2025-03-03 15:02:10,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:10,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329298411] [2025-03-03 15:02:10,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:10,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:10,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:02:10,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:02:10,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:10,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:10,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329298411] [2025-03-03 15:02:10,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329298411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:10,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:10,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140344029] [2025-03-03 15:02:10,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:10,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:10,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:10,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:10,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:10,693 INFO L87 Difference]: Start difference. First operand 10999 states and 18161 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:10,826 INFO L93 Difference]: Finished difference Result 20919 states and 34651 transitions. [2025-03-03 15:02:10,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:10,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:02:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:10,854 INFO L225 Difference]: With dead ends: 20919 [2025-03-03 15:02:10,854 INFO L226 Difference]: Without dead ends: 15147 [2025-03-03 15:02:10,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:10,864 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 184 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:10,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1087 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15147 states. [2025-03-03 15:02:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15147 to 15145. [2025-03-03 15:02:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15145 states, 15144 states have (on average 1.6485736925515055) internal successors, (24966), 15144 states have internal predecessors, (24966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15145 states to 15145 states and 24966 transitions. [2025-03-03 15:02:11,100 INFO L78 Accepts]: Start accepts. Automaton has 15145 states and 24966 transitions. Word has length 112 [2025-03-03 15:02:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:11,100 INFO L471 AbstractCegarLoop]: Abstraction has 15145 states and 24966 transitions. [2025-03-03 15:02:11,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:11,101 INFO L276 IsEmpty]: Start isEmpty. Operand 15145 states and 24966 transitions. [2025-03-03 15:02:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:02:11,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:11,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:02:11,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:02:11,102 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:11,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1983549071, now seen corresponding path program 1 times [2025-03-03 15:02:11,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:11,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497654270] [2025-03-03 15:02:11,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:11,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:11,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:02:11,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:02:11,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:11,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:11,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:11,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497654270] [2025-03-03 15:02:11,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497654270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:11,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:11,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815731648] [2025-03-03 15:02:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:11,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:11,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:11,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:11,212 INFO L87 Difference]: Start difference. First operand 15145 states and 24966 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:11,299 INFO L93 Difference]: Finished difference Result 28733 states and 47540 transitions. [2025-03-03 15:02:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:11,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:02:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:11,339 INFO L225 Difference]: With dead ends: 28733 [2025-03-03 15:02:11,339 INFO L226 Difference]: Without dead ends: 20721 [2025-03-03 15:02:11,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:11,357 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 190 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:11,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1131 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:11,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2025-03-03 15:02:11,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 20719. [2025-03-03 15:02:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20719 states, 20718 states have (on average 1.6462496379959455) internal successors, (34107), 20718 states have internal predecessors, (34107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20719 states to 20719 states and 34107 transitions. [2025-03-03 15:02:11,744 INFO L78 Accepts]: Start accepts. Automaton has 20719 states and 34107 transitions. Word has length 112 [2025-03-03 15:02:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:11,744 INFO L471 AbstractCegarLoop]: Abstraction has 20719 states and 34107 transitions. [2025-03-03 15:02:11,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 20719 states and 34107 transitions. [2025-03-03 15:02:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 15:02:11,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:11,746 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] [2025-03-03 15:02:11,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:02:11,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:11,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1316617030, now seen corresponding path program 1 times [2025-03-03 15:02:11,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:11,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050454232] [2025-03-03 15:02:11,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:11,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 15:02:11,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 15:02:11,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:11,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:11,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:11,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050454232] [2025-03-03 15:02:11,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050454232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:11,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:11,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:11,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393970931] [2025-03-03 15:02:11,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:11,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:11,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:11,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:11,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:11,867 INFO L87 Difference]: Start difference. First operand 20719 states and 34107 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:12,061 INFO L93 Difference]: Finished difference Result 67417 states and 111246 transitions. [2025-03-03 15:02:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:12,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-03 15:02:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:12,258 INFO L225 Difference]: With dead ends: 67417 [2025-03-03 15:02:12,259 INFO L226 Difference]: Without dead ends: 46931 [2025-03-03 15:02:12,276 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-03-03 15:02:12,277 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 622 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:12,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1682 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46931 states. [2025-03-03 15:02:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46931 to 33736. [2025-03-03 15:02:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33736 states, 33735 states have (on average 1.6415295686971987) internal successors, (55377), 33735 states have internal predecessors, (55377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33736 states to 33736 states and 55377 transitions. [2025-03-03 15:02:12,692 INFO L78 Accepts]: Start accepts. Automaton has 33736 states and 55377 transitions. Word has length 113 [2025-03-03 15:02:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:12,693 INFO L471 AbstractCegarLoop]: Abstraction has 33736 states and 55377 transitions. [2025-03-03 15:02:12,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 33736 states and 55377 transitions. [2025-03-03 15:02:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:02:12,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:12,694 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] [2025-03-03 15:02:12,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:02:12,694 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:12,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2136334542, now seen corresponding path program 1 times [2025-03-03 15:02:12,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:12,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385594942] [2025-03-03 15:02:12,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:12,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:12,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:02:12,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:02:12,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:12,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:12,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:12,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385594942] [2025-03-03 15:02:12,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385594942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:12,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:12,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:12,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456245062] [2025-03-03 15:02:12,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:12,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:12,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:12,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:12,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:12,904 INFO L87 Difference]: Start difference. First operand 33736 states and 55377 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:13,382 INFO L93 Difference]: Finished difference Result 109311 states and 179862 transitions. [2025-03-03 15:02:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:13,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2025-03-03 15:02:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:13,561 INFO L225 Difference]: With dead ends: 109311 [2025-03-03 15:02:13,561 INFO L226 Difference]: Without dead ends: 75808 [2025-03-03 15:02:13,611 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-03-03 15:02:13,612 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 620 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:13,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1684 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:13,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75808 states. [2025-03-03 15:02:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75808 to 54629. [2025-03-03 15:02:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54629 states, 54628 states have (on average 1.6367979790583584) internal successors, (89415), 54628 states have internal predecessors, (89415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54629 states to 54629 states and 89415 transitions. [2025-03-03 15:02:14,540 INFO L78 Accepts]: Start accepts. Automaton has 54629 states and 89415 transitions. Word has length 114 [2025-03-03 15:02:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:14,540 INFO L471 AbstractCegarLoop]: Abstraction has 54629 states and 89415 transitions. [2025-03-03 15:02:14,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 54629 states and 89415 transitions. [2025-03-03 15:02:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 15:02:14,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:14,542 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] [2025-03-03 15:02:14,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:02:14,542 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:14,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:14,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1803561501, now seen corresponding path program 1 times [2025-03-03 15:02:14,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:14,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428990264] [2025-03-03 15:02:14,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:14,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:14,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 15:02:14,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 15:02:14,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:14,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:14,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428990264] [2025-03-03 15:02:14,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428990264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:14,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:14,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689585270] [2025-03-03 15:02:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:14,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:14,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:14,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:14,649 INFO L87 Difference]: Start difference. First operand 54629 states and 89415 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:15,274 INFO L93 Difference]: Finished difference Result 175037 states and 287174 transitions. [2025-03-03 15:02:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:15,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-03 15:02:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:15,494 INFO L225 Difference]: With dead ends: 175037 [2025-03-03 15:02:15,495 INFO L226 Difference]: Without dead ends: 120641 [2025-03-03 15:02:15,561 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-03-03 15:02:15,562 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 618 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:15,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1686 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120641 states. [2025-03-03 15:02:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120641 to 87410. [2025-03-03 15:02:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87410 states, 87409 states have (on average 1.6321088217460444) internal successors, (142661), 87409 states have internal predecessors, (142661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87410 states to 87410 states and 142661 transitions. [2025-03-03 15:02:17,047 INFO L78 Accepts]: Start accepts. Automaton has 87410 states and 142661 transitions. Word has length 115 [2025-03-03 15:02:17,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:17,048 INFO L471 AbstractCegarLoop]: Abstraction has 87410 states and 142661 transitions. [2025-03-03 15:02:17,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 87410 states and 142661 transitions. [2025-03-03 15:02:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 15:02:17,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:17,049 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] [2025-03-03 15:02:17,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:02:17,049 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:17,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1892700193, now seen corresponding path program 1 times [2025-03-03 15:02:17,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:17,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179393468] [2025-03-03 15:02:17,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:17,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 15:02:17,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 15:02:17,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:17,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:17,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:17,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179393468] [2025-03-03 15:02:17,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179393468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:17,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:17,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:02:17,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653084805] [2025-03-03 15:02:17,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:17,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:02:17,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:17,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:02:17,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:02:17,335 INFO L87 Difference]: Start difference. First operand 87410 states and 142661 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:18,025 INFO L93 Difference]: Finished difference Result 174589 states and 284943 transitions. [2025-03-03 15:02:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:02:18,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-03-03 15:02:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:18,156 INFO L225 Difference]: With dead ends: 174589 [2025-03-03 15:02:18,157 INFO L226 Difference]: Without dead ends: 87412 [2025-03-03 15:02:18,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:02:18,223 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 534 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:18,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1947 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87412 states. [2025-03-03 15:02:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87412 to 87410. [2025-03-03 15:02:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87410 states, 87409 states have (on average 1.6249585282980012) internal successors, (142036), 87409 states have internal predecessors, (142036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87410 states to 87410 states and 142036 transitions. [2025-03-03 15:02:19,206 INFO L78 Accepts]: Start accepts. Automaton has 87410 states and 142036 transitions. Word has length 117 [2025-03-03 15:02:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:19,206 INFO L471 AbstractCegarLoop]: Abstraction has 87410 states and 142036 transitions. [2025-03-03 15:02:19,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 87410 states and 142036 transitions. [2025-03-03 15:02:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 15:02:19,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:19,207 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] [2025-03-03 15:02:19,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:02:19,207 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:19,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash 286799480, now seen corresponding path program 1 times [2025-03-03 15:02:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:19,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116290453] [2025-03-03 15:02:19,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:19,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:19,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 15:02:19,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 15:02:19,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:19,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:19,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:19,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116290453] [2025-03-03 15:02:19,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116290453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:19,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:19,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:02:19,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435808307] [2025-03-03 15:02:19,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:19,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:02:19,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:19,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:02:19,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:02:19,738 INFO L87 Difference]: Start difference. First operand 87410 states and 142036 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:20,835 INFO L93 Difference]: Finished difference Result 255483 states and 415611 transitions. [2025-03-03 15:02:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:02:20,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-03-03 15:02:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:21,110 INFO L225 Difference]: With dead ends: 255483 [2025-03-03 15:02:21,110 INFO L226 Difference]: Without dead ends: 168306 [2025-03-03 15:02:21,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:02:21,150 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 353 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:21,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1958 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168306 states. [2025-03-03 15:02:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168306 to 168304. [2025-03-03 15:02:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168304 states, 168303 states have (on average 1.6157584832118264) internal successors, (271937), 168303 states have internal predecessors, (271937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168304 states to 168304 states and 271937 transitions. [2025-03-03 15:02:23,190 INFO L78 Accepts]: Start accepts. Automaton has 168304 states and 271937 transitions. Word has length 120 [2025-03-03 15:02:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:23,191 INFO L471 AbstractCegarLoop]: Abstraction has 168304 states and 271937 transitions. [2025-03-03 15:02:23,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 168304 states and 271937 transitions. [2025-03-03 15:02:23,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 15:02:23,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:23,192 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] [2025-03-03 15:02:23,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:02:23,192 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:23,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:23,193 INFO L85 PathProgramCache]: Analyzing trace with hash 301804652, now seen corresponding path program 1 times [2025-03-03 15:02:23,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:23,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477785839] [2025-03-03 15:02:23,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:23,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:23,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 15:02:23,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 15:02:23,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:23,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:23,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:23,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477785839] [2025-03-03 15:02:23,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477785839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:23,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:23,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:02:23,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504913022] [2025-03-03 15:02:23,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:23,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:02:23,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:23,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:02:23,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:02:23,844 INFO L87 Difference]: Start difference. First operand 168304 states and 271937 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:24,542 INFO L93 Difference]: Finished difference Result 172178 states and 277746 transitions. [2025-03-03 15:02:24,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:02:24,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-03 15:02:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:24,813 INFO L225 Difference]: With dead ends: 172178 [2025-03-03 15:02:24,814 INFO L226 Difference]: Without dead ends: 172176 [2025-03-03 15:02:24,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:02:24,840 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 0 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:24,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2022 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172176 states. [2025-03-03 15:02:26,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172176 to 172176. [2025-03-03 15:02:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172176 states, 172175 states have (on average 1.601754029330623) internal successors, (275782), 172175 states have internal predecessors, (275782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172176 states to 172176 states and 275782 transitions. [2025-03-03 15:02:26,949 INFO L78 Accepts]: Start accepts. Automaton has 172176 states and 275782 transitions. Word has length 121 [2025-03-03 15:02:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:26,950 INFO L471 AbstractCegarLoop]: Abstraction has 172176 states and 275782 transitions. [2025-03-03 15:02:26,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 172176 states and 275782 transitions. [2025-03-03 15:02:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 15:02:26,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:26,954 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:02:26,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:02:26,955 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:26,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1531341786, now seen corresponding path program 1 times [2025-03-03 15:02:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:26,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340266348] [2025-03-03 15:02:26,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:26,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:26,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 15:02:26,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 15:02:26,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:26,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 15:02:27,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:27,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340266348] [2025-03-03 15:02:27,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340266348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:27,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:27,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:02:27,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213944695] [2025-03-03 15:02:27,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:27,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:02:27,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:27,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:02:27,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:02:27,123 INFO L87 Difference]: Start difference. First operand 172176 states and 275782 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:28,515 INFO L93 Difference]: Finished difference Result 470352 states and 756235 transitions. [2025-03-03 15:02:28,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:02:28,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-03-03 15:02:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:29,609 INFO L225 Difference]: With dead ends: 470352 [2025-03-03 15:02:29,610 INFO L226 Difference]: Without dead ends: 393550 [2025-03-03 15:02:29,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:02:29,712 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 1395 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:29,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 2521 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393550 states. [2025-03-03 15:02:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393550 to 276994. [2025-03-03 15:02:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276994 states, 276993 states have (on average 1.600083756629229) internal successors, (443212), 276993 states have internal predecessors, (443212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276994 states to 276994 states and 443212 transitions. [2025-03-03 15:02:33,783 INFO L78 Accepts]: Start accepts. Automaton has 276994 states and 443212 transitions. Word has length 151 [2025-03-03 15:02:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:33,783 INFO L471 AbstractCegarLoop]: Abstraction has 276994 states and 443212 transitions. [2025-03-03 15:02:33,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 276994 states and 443212 transitions. [2025-03-03 15:02:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 15:02:33,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:33,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:02:33,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:02:33,789 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:33,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:33,790 INFO L85 PathProgramCache]: Analyzing trace with hash -518104446, now seen corresponding path program 1 times [2025-03-03 15:02:33,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:33,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382661230] [2025-03-03 15:02:33,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:33,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:33,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 15:02:33,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 15:02:33,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:33,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:02:34,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:34,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382661230] [2025-03-03 15:02:34,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382661230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:34,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:34,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:02:34,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9605335] [2025-03-03 15:02:34,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:34,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:02:34,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:34,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:02:34,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:02:34,427 INFO L87 Difference]: Start difference. First operand 276994 states and 443212 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:36,302 INFO L93 Difference]: Finished difference Result 529154 states and 850951 transitions. [2025-03-03 15:02:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:02:36,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 151 [2025-03-03 15:02:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:37,184 INFO L225 Difference]: With dead ends: 529154 [2025-03-03 15:02:37,184 INFO L226 Difference]: Without dead ends: 453502 [2025-03-03 15:02:37,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:02:37,305 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 1402 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 2730 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:37,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 2730 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453502 states. [2025-03-03 15:02:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453502 to 374610. [2025-03-03 15:02:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374610 states, 374609 states have (on average 1.6018568694291915) internal successors, (600070), 374609 states have internal predecessors, (600070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374610 states to 374610 states and 600070 transitions. [2025-03-03 15:02:42,721 INFO L78 Accepts]: Start accepts. Automaton has 374610 states and 600070 transitions. Word has length 151 [2025-03-03 15:02:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:42,722 INFO L471 AbstractCegarLoop]: Abstraction has 374610 states and 600070 transitions. [2025-03-03 15:02:42,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 374610 states and 600070 transitions. [2025-03-03 15:02:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 15:02:42,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:42,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:02:42,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:02:42,728 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:42,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:42,729 INFO L85 PathProgramCache]: Analyzing trace with hash -510031346, now seen corresponding path program 1 times [2025-03-03 15:02:42,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:42,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621290772] [2025-03-03 15:02:42,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:42,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:42,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 15:02:42,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 15:02:42,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:42,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:02:43,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:43,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621290772] [2025-03-03 15:02:43,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621290772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:43,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:43,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:02:43,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046345100] [2025-03-03 15:02:43,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:43,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:02:43,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:43,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:02:43,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:02:43,467 INFO L87 Difference]: Start difference. First operand 374610 states and 600070 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:45,334 INFO L93 Difference]: Finished difference Result 559174 states and 899291 transitions. [2025-03-03 15:02:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:02:45,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 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 151 [2025-03-03 15:02:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:46,065 INFO L225 Difference]: With dead ends: 559174 [2025-03-03 15:02:46,065 INFO L226 Difference]: Without dead ends: 483522 [2025-03-03 15:02:46,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:02:46,118 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 1275 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:46,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 2849 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483522 states.