./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5997605399232d6623d2d70739affa04a63a65f78c1dd829a070c5dea4fb22a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:26:26,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:26:26,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:26:26,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:26:26,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:26:26,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:26:26,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:26:26,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:26:26,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:26:26,909 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:26:26,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:26:26,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:26:26,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:26:26,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:26:26,910 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:26:26,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:26:26,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:26:26,911 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:26:26,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:26:26,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:26:26,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:26:26,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:26:26,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:26:26,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:26:26,912 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:26:26,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:26:26,912 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:26:26,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:26:26,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:26:26,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:26:26,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:26:26,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:26:26,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:26:26,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:26:26,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:26:26,913 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:26:26,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:26:26,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:26:26,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:26:26,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:26:26,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:26:26,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:26:26,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:26:26,914 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5997605399232d6623d2d70739affa04a63a65f78c1dd829a070c5dea4fb22a3 [2025-02-06 03:26:27,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:26:27,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:26:27,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:26:27,195 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:26:27,195 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:26:27,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i [2025-02-06 03:26:28,532 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6961e1ed4/4bcb06ab532445ddbaf6d9840de10112/FLAGb6cd83ce2 [2025-02-06 03:26:28,807 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:26:28,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i [2025-02-06 03:26:28,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6961e1ed4/4bcb06ab532445ddbaf6d9840de10112/FLAGb6cd83ce2 [2025-02-06 03:26:28,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6961e1ed4/4bcb06ab532445ddbaf6d9840de10112 [2025-02-06 03:26:28,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:26:28,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:26:28,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:26:28,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:26:28,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:26:28,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:26:28" (1/1) ... [2025-02-06 03:26:28,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d076140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:28, skipping insertion in model container [2025-02-06 03:26:28,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:26:28" (1/1) ... [2025-02-06 03:26:28,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:26:28,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i[917,930] [2025-02-06 03:26:29,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:26:29,044 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:26:29,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-32.i[917,930] [2025-02-06 03:26:29,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:26:29,109 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:26:29,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29 WrapperNode [2025-02-06 03:26:29,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:26:29,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:26:29,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:26:29,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:26:29,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (1/1) ... [2025-02-06 03:26:29,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (1/1) ... [2025-02-06 03:26:29,184 INFO L138 Inliner]: procedures = 26, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449 [2025-02-06 03:26:29,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:26:29,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:26:29,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:26:29,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:26:29,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (1/1) ... [2025-02-06 03:26:29,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (1/1) ... [2025-02-06 03:26:29,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (1/1) ... [2025-02-06 03:26:29,238 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 14, 23, 8, 24, 53]. 43 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 3, 1, 2, 4]. The 15 writes are split as follows [0, 2, 5, 2, 2, 4]. [2025-02-06 03:26:29,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (1/1) ... [2025-02-06 03:26:29,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (1/1) ... [2025-02-06 03:26:29,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (1/1) ... [2025-02-06 03:26:29,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (1/1) ... [2025-02-06 03:26:29,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (1/1) ... [2025-02-06 03:26:29,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (1/1) ... [2025-02-06 03:26:29,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:26:29,283 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:26:29,286 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:26:29,287 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:26:29,288 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (1/1) ... [2025-02-06 03:26:29,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:26:29,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:26:29,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:26:29,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:26:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:26:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:26:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:26:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:26:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:26:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:26:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:26:29,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:26:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:26:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:26:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:26:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:26:29,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:26:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:26:29,358 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:26:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:26:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:26:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:26:29,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:26:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:26:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:26:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:26:29,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:26:29,481 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:26:29,483 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:26:29,952 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc property_#t~ite85#1;havoc property_#t~mem84#1;havoc property_#t~mem75#1;havoc property_#t~mem71#1;havoc property_#t~ite74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem77#1;havoc property_#t~ite80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem89#1;havoc property_#t~ite96#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem93#1;havoc property_#t~short98#1;havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite123#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~ite120#1;havoc property_#t~mem105#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1; [2025-02-06 03:26:29,990 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-02-06 03:26:29,990 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:26:29,999 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:26:29,999 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:26:30,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:26:29 BoogieIcfgContainer [2025-02-06 03:26:30,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:26:30,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:26:30,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:26:30,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:26:30,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:26:28" (1/3) ... [2025-02-06 03:26:30,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a5f5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:26:30, skipping insertion in model container [2025-02-06 03:26:30,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:26:29" (2/3) ... [2025-02-06 03:26:30,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a5f5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:26:30, skipping insertion in model container [2025-02-06 03:26:30,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:26:29" (3/3) ... [2025-02-06 03:26:30,009 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-32.i [2025-02-06 03:26:30,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:26:30,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-32.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:26:30,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:26:30,087 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;@20ae79a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:26:30,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:26:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:26:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:26:30,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:26:30,105 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:26:30,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:26:30,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:26:30,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2105035164, now seen corresponding path program 1 times [2025-02-06 03:26:30,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:26:30,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394223177] [2025-02-06 03:26:30,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:26:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:26:30,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:26:30,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:26:30,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:26:30,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:26:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:26:30,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:26:30,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394223177] [2025-02-06 03:26:30,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394223177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:26:30,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147957095] [2025-02-06 03:26:30,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:26:30,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:26:30,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:26:30,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:26:30,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:26:30,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:26:30,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:26:30,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:26:30,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:26:30,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:26:30,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:26:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:26:30,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:26:30,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147957095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:26:30,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:26:30,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:26:30,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659921317] [2025-02-06 03:26:30,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:26:30,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:26:30,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:26:30,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:26:30,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:26:30,716 INFO L87 Difference]: Start difference. First operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:26:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:26:30,737 INFO L93 Difference]: Finished difference Result 190 states and 295 transitions. [2025-02-06 03:26:30,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:26:30,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2025-02-06 03:26:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:26:30,744 INFO L225 Difference]: With dead ends: 190 [2025-02-06 03:26:30,744 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 03:26:30,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:26:30,750 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:26:30,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:26:30,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 03:26:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-06 03:26:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:26:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-02-06 03:26:30,792 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 129 [2025-02-06 03:26:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:26:30,792 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-02-06 03:26:30,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:26:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-02-06 03:26:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:26:30,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:26:30,795 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:26:30,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:26:30,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:26:30,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:26:30,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:26:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1664571346, now seen corresponding path program 1 times [2025-02-06 03:26:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:26:30,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435601881] [2025-02-06 03:26:30,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:26:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:26:31,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:26:31,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:26:31,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:26:31,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:26:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:26:31,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:26:31,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435601881] [2025-02-06 03:26:31,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435601881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:26:31,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:26:31,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:26:31,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971198603] [2025-02-06 03:26:31,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:26:31,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:26:31,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:26:31,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:26:31,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:26:31,410 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:26:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:26:31,608 INFO L93 Difference]: Finished difference Result 318 states and 444 transitions. [2025-02-06 03:26:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:26:31,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-02-06 03:26:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:26:31,612 INFO L225 Difference]: With dead ends: 318 [2025-02-06 03:26:31,614 INFO L226 Difference]: Without dead ends: 226 [2025-02-06 03:26:31,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:26:31,617 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 213 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:26:31,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 368 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:26:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-06 03:26:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 193. [2025-02-06 03:26:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.2857142857142858) internal successors, (198), 154 states have internal predecessors, (198), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:26:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 270 transitions. [2025-02-06 03:26:31,660 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 270 transitions. Word has length 129 [2025-02-06 03:26:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:26:31,661 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 270 transitions. [2025-02-06 03:26:31,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:26:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 270 transitions. [2025-02-06 03:26:31,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:26:31,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:26:31,663 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:26:31,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:26:31,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:26:31,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:26:31,664 INFO L85 PathProgramCache]: Analyzing trace with hash -172875070, now seen corresponding path program 1 times [2025-02-06 03:26:31,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:26:31,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941021770] [2025-02-06 03:26:31,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:26:31,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:26:31,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:26:31,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:26:31,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:26:31,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:26:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:26:33,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:26:33,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941021770] [2025-02-06 03:26:33,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941021770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:26:33,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:26:33,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:26:33,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366851148] [2025-02-06 03:26:33,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:26:33,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:26:33,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:26:33,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:26:33,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:26:33,121 INFO L87 Difference]: Start difference. First operand 193 states and 270 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:26:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:26:34,093 INFO L93 Difference]: Finished difference Result 543 states and 762 transitions. [2025-02-06 03:26:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:26:34,094 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2025-02-06 03:26:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:26:34,098 INFO L225 Difference]: With dead ends: 543 [2025-02-06 03:26:34,100 INFO L226 Difference]: Without dead ends: 353 [2025-02-06 03:26:34,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:26:34,102 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 215 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:26:34,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 900 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:26:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-06 03:26:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 349. [2025-02-06 03:26:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 284 states have (on average 1.2992957746478873) internal successors, (369), 286 states have internal predecessors, (369), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:26:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 489 transitions. [2025-02-06 03:26:34,167 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 489 transitions. Word has length 137 [2025-02-06 03:26:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:26:34,168 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 489 transitions. [2025-02-06 03:26:34,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:26:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 489 transitions. [2025-02-06 03:26:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:26:34,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:26:34,174 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:26:34,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:26:34,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:26:34,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:26:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash -133359771, now seen corresponding path program 1 times [2025-02-06 03:26:34,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:26:34,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520782606] [2025-02-06 03:26:34,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:26:34,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:26:34,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:26:34,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:26:34,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:26:34,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:26:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:26:36,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:26:36,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520782606] [2025-02-06 03:26:36,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520782606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:26:36,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:26:36,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 03:26:36,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301433329] [2025-02-06 03:26:36,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:26:36,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:26:36,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:26:36,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:26:36,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:26:36,646 INFO L87 Difference]: Start difference. First operand 349 states and 489 transitions. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:26:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:26:39,141 INFO L93 Difference]: Finished difference Result 796 states and 1105 transitions. [2025-02-06 03:26:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:26:39,142 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2025-02-06 03:26:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:26:39,164 INFO L225 Difference]: With dead ends: 796 [2025-02-06 03:26:39,164 INFO L226 Difference]: Without dead ends: 450 [2025-02-06 03:26:39,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:26:39,166 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 391 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:26:39,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1135 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 03:26:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-02-06 03:26:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 299. [2025-02-06 03:26:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 246 states have (on average 1.3008130081300813) internal successors, (320), 247 states have internal predecessors, (320), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:26:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 416 transitions. [2025-02-06 03:26:39,216 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 416 transitions. Word has length 139 [2025-02-06 03:26:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:26:39,217 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 416 transitions. [2025-02-06 03:26:39,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:26:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 416 transitions. [2025-02-06 03:26:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:26:39,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:26:39,219 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:26:39,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:26:39,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:26:39,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:26:39,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1917836731, now seen corresponding path program 1 times [2025-02-06 03:26:39,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:26:39,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135347447] [2025-02-06 03:26:39,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:26:39,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:26:39,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:26:39,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:26:39,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:26:39,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:26:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:26:41,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:26:41,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135347447] [2025-02-06 03:26:41,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135347447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:26:41,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:26:41,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 03:26:41,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315600873] [2025-02-06 03:26:41,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:26:41,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:26:41,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:26:41,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:26:41,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:26:41,256 INFO L87 Difference]: Start difference. First operand 299 states and 416 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:26:45,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:26:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:26:48,047 INFO L93 Difference]: Finished difference Result 714 states and 987 transitions. [2025-02-06 03:26:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:26:48,048 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2025-02-06 03:26:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:26:48,054 INFO L225 Difference]: With dead ends: 714 [2025-02-06 03:26:48,055 INFO L226 Difference]: Without dead ends: 418 [2025-02-06 03:26:48,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:26:48,057 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 579 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:26:48,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1237 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1173 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2025-02-06 03:26:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-06 03:26:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 304. [2025-02-06 03:26:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 251 states have (on average 1.294820717131474) internal successors, (325), 252 states have internal predecessors, (325), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:26:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 421 transitions. [2025-02-06 03:26:48,093 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 421 transitions. Word has length 139 [2025-02-06 03:26:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:26:48,093 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 421 transitions. [2025-02-06 03:26:48,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:26:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 421 transitions. [2025-02-06 03:26:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:26:48,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:26:48,095 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:26:48,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:26:48,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:26:48,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:26:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash -391010055, now seen corresponding path program 1 times [2025-02-06 03:26:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:26:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241222763] [2025-02-06 03:26:48,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:26:48,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:26:48,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:26:48,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:26:48,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:26:48,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:26:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:26:48,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:26:48,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241222763] [2025-02-06 03:26:48,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241222763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:26:48,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866691524] [2025-02-06 03:26:48,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:26:48,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:26:48,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:26:48,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:26:48,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:26:48,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:26:48,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:26:48,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:26:48,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:26:48,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:26:48,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:26:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:26:48,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:26:48,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866691524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:26:48,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:26:48,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:26:48,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164805248] [2025-02-06 03:26:48,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:26:48,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:26:48,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:26:48,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:26:48,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:26:48,455 INFO L87 Difference]: Start difference. First operand 304 states and 421 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:26:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:26:48,518 INFO L93 Difference]: Finished difference Result 614 states and 851 transitions. [2025-02-06 03:26:48,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:26:48,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2025-02-06 03:26:48,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:26:48,522 INFO L225 Difference]: With dead ends: 614 [2025-02-06 03:26:48,522 INFO L226 Difference]: Without dead ends: 313 [2025-02-06 03:26:48,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:26:48,526 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:26:48,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:26:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-06 03:26:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-02-06 03:26:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 260 states have (on average 1.2846153846153847) internal successors, (334), 261 states have internal predecessors, (334), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:26:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 430 transitions. [2025-02-06 03:26:48,563 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 430 transitions. Word has length 139 [2025-02-06 03:26:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:26:48,564 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 430 transitions. [2025-02-06 03:26:48,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:26:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 430 transitions. [2025-02-06 03:26:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:26:48,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:26:48,565 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:26:48,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:26:48,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:26:48,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:26:48,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:26:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash 7464510, now seen corresponding path program 1 times [2025-02-06 03:26:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:26:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949879270] [2025-02-06 03:26:48,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:26:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:26:48,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:26:48,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:26:48,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:26:48,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:26:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:26:51,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:26:51,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949879270] [2025-02-06 03:26:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949879270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:26:51,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:26:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-06 03:26:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413371132] [2025-02-06 03:26:51,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:26:51,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 03:26:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:26:51,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 03:26:51,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:26:51,116 INFO L87 Difference]: Start difference. First operand 313 states and 430 transitions. Second operand has 22 states, 20 states have (on average 2.65) internal successors, (53), 22 states have internal predecessors, (53), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-02-06 03:26:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:26:55,753 INFO L93 Difference]: Finished difference Result 793 states and 1086 transitions. [2025-02-06 03:26:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 03:26:55,754 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.65) internal successors, (53), 22 states have internal predecessors, (53), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 140 [2025-02-06 03:26:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:26:55,758 INFO L225 Difference]: With dead ends: 793 [2025-02-06 03:26:55,758 INFO L226 Difference]: Without dead ends: 620 [2025-02-06 03:26:55,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=395, Invalid=1497, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 03:26:55,760 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 702 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:26:55,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1594 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-06 03:26:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-02-06 03:26:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 328. [2025-02-06 03:26:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 275 states have (on average 1.298181818181818) internal successors, (357), 276 states have internal predecessors, (357), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:26:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 453 transitions. [2025-02-06 03:26:55,829 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 453 transitions. Word has length 140 [2025-02-06 03:26:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:26:55,830 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 453 transitions. [2025-02-06 03:26:55,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.65) internal successors, (53), 22 states have internal predecessors, (53), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2025-02-06 03:26:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 453 transitions. [2025-02-06 03:26:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 03:26:55,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:26:55,831 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:26:55,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:26:55,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:26:55,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:26:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash -789425596, now seen corresponding path program 1 times [2025-02-06 03:26:55,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:26:55,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972219552] [2025-02-06 03:26:55,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:26:55,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:26:55,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 03:26:55,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 03:26:55,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:26:55,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:26:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:26:57,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:26:57,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972219552] [2025-02-06 03:26:57,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972219552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:26:57,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:26:57,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:26:57,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540944028] [2025-02-06 03:26:57,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:26:57,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:26:57,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:26:57,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:26:57,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:26:57,707 INFO L87 Difference]: Start difference. First operand 328 states and 453 transitions. Second operand has 18 states, 16 states have (on average 3.3125) internal successors, (53), 18 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:27:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:00,934 INFO L93 Difference]: Finished difference Result 775 states and 1063 transitions. [2025-02-06 03:27:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:27:00,935 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.3125) internal successors, (53), 18 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 140 [2025-02-06 03:27:00,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:00,940 INFO L225 Difference]: With dead ends: 775 [2025-02-06 03:27:00,940 INFO L226 Difference]: Without dead ends: 587 [2025-02-06 03:27:00,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:27:00,942 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 598 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:00,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1641 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 03:27:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-02-06 03:27:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 337. [2025-02-06 03:27:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 284 states have (on average 1.295774647887324) internal successors, (368), 285 states have internal predecessors, (368), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:27:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 464 transitions. [2025-02-06 03:27:01,006 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 464 transitions. Word has length 140 [2025-02-06 03:27:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:01,008 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 464 transitions. [2025-02-06 03:27:01,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.3125) internal successors, (53), 18 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:27:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 464 transitions. [2025-02-06 03:27:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:27:01,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:01,010 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:01,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:27:01,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:01,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:01,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1696627240, now seen corresponding path program 1 times [2025-02-06 03:27:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823849360] [2025-02-06 03:27:01,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:01,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:27:01,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:27:01,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:01,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:02,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:02,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823849360] [2025-02-06 03:27:02,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823849360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:02,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:02,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-06 03:27:02,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641520401] [2025-02-06 03:27:02,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:02,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 03:27:02,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:02,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 03:27:02,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:27:02,516 INFO L87 Difference]: Start difference. First operand 337 states and 464 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:27:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:05,201 INFO L93 Difference]: Finished difference Result 935 states and 1280 transitions. [2025-02-06 03:27:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 03:27:05,201 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 141 [2025-02-06 03:27:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:05,206 INFO L225 Difference]: With dead ends: 935 [2025-02-06 03:27:05,206 INFO L226 Difference]: Without dead ends: 601 [2025-02-06 03:27:05,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 03:27:05,209 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 318 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 2472 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:05,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 2472 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 03:27:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-02-06 03:27:05,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 363. [2025-02-06 03:27:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 310 states have (on average 1.3) internal successors, (403), 311 states have internal predecessors, (403), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:27:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 499 transitions. [2025-02-06 03:27:05,273 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 499 transitions. Word has length 141 [2025-02-06 03:27:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:05,273 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 499 transitions. [2025-02-06 03:27:05,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:27:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 499 transitions. [2025-02-06 03:27:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:27:05,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:05,277 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:05,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:27:05,277 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:05,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:05,279 INFO L85 PathProgramCache]: Analyzing trace with hash 189013819, now seen corresponding path program 1 times [2025-02-06 03:27:05,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:05,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742851204] [2025-02-06 03:27:05,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:05,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:05,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:27:05,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:27:05,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:05,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:05,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:05,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742851204] [2025-02-06 03:27:05,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742851204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:05,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:05,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:27:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653647306] [2025-02-06 03:27:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:05,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:27:05,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:05,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:27:05,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:27:05,697 INFO L87 Difference]: Start difference. First operand 363 states and 499 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:06,256 INFO L93 Difference]: Finished difference Result 972 states and 1325 transitions. [2025-02-06 03:27:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:27:06,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-02-06 03:27:06,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:06,260 INFO L225 Difference]: With dead ends: 972 [2025-02-06 03:27:06,260 INFO L226 Difference]: Without dead ends: 612 [2025-02-06 03:27:06,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:27:06,262 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 217 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:06,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 512 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:27:06,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-02-06 03:27:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 484. [2025-02-06 03:27:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 413 states have (on average 1.2857142857142858) internal successors, (531), 416 states have internal predecessors, (531), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 03:27:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 659 transitions. [2025-02-06 03:27:06,336 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 659 transitions. Word has length 141 [2025-02-06 03:27:06,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:06,337 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 659 transitions. [2025-02-06 03:27:06,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 659 transitions. [2025-02-06 03:27:06,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:27:06,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:06,339 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:06,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:27:06,339 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:06,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:06,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1656351597, now seen corresponding path program 1 times [2025-02-06 03:27:06,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:06,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322233595] [2025-02-06 03:27:06,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:06,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:06,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:27:06,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:27:06,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:06,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:27:07,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:07,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322233595] [2025-02-06 03:27:07,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322233595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:27:07,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556969848] [2025-02-06 03:27:07,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:07,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:27:07,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:27:07,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:27:07,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:27:07,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:27:07,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:27:07,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:07,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:07,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:27:07,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:27:07,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:27:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:07,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:27:07,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556969848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:07,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:27:07,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 23 [2025-02-06 03:27:07,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329943932] [2025-02-06 03:27:07,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:07,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:27:07,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:07,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:27:07,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:27:07,773 INFO L87 Difference]: Start difference. First operand 484 states and 659 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:08,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:08,160 INFO L93 Difference]: Finished difference Result 756 states and 999 transitions. [2025-02-06 03:27:08,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:27:08,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-02-06 03:27:08,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:08,167 INFO L225 Difference]: With dead ends: 756 [2025-02-06 03:27:08,168 INFO L226 Difference]: Without dead ends: 754 [2025-02-06 03:27:08,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:27:08,170 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 53 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:08,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1030 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:27:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-02-06 03:27:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 747. [2025-02-06 03:27:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 651 states have (on average 1.2580645161290323) internal successors, (819), 659 states have internal predecessors, (819), 84 states have call successors, (84), 11 states have call predecessors, (84), 11 states have return successors, (84), 76 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 03:27:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 987 transitions. [2025-02-06 03:27:08,279 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 987 transitions. Word has length 141 [2025-02-06 03:27:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:08,279 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 987 transitions. [2025-02-06 03:27:08,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 987 transitions. [2025-02-06 03:27:08,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:27:08,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:08,281 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:08,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:27:08,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:27:08,482 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:08,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1270623358, now seen corresponding path program 1 times [2025-02-06 03:27:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:08,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164537419] [2025-02-06 03:27:08,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:08,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:27:08,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:27:08,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:08,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:11,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:11,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164537419] [2025-02-06 03:27:11,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164537419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:11,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:11,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-06 03:27:11,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573413048] [2025-02-06 03:27:11,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:11,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 03:27:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:11,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 03:27:11,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:27:11,087 INFO L87 Difference]: Start difference. First operand 747 states and 987 transitions. Second operand has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:27:15,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:15,130 INFO L93 Difference]: Finished difference Result 1628 states and 2146 transitions. [2025-02-06 03:27:15,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:27:15,131 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 141 [2025-02-06 03:27:15,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:15,135 INFO L225 Difference]: With dead ends: 1628 [2025-02-06 03:27:15,136 INFO L226 Difference]: Without dead ends: 884 [2025-02-06 03:27:15,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:27:15,139 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 403 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:15,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1511 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-06 03:27:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-02-06 03:27:15,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 773. [2025-02-06 03:27:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 663 states have (on average 1.248868778280543) internal successors, (828), 672 states have internal predecessors, (828), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 87 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:27:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1020 transitions. [2025-02-06 03:27:15,315 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1020 transitions. Word has length 141 [2025-02-06 03:27:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:15,315 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1020 transitions. [2025-02-06 03:27:15,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:27:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1020 transitions. [2025-02-06 03:27:15,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:27:15,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:15,317 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:15,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:27:15,317 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:15,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:15,318 INFO L85 PathProgramCache]: Analyzing trace with hash -410192191, now seen corresponding path program 1 times [2025-02-06 03:27:15,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:15,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372017192] [2025-02-06 03:27:15,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:15,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:15,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:27:15,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:27:15,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:15,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:16,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372017192] [2025-02-06 03:27:16,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372017192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:16,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:16,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-06 03:27:16,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452070219] [2025-02-06 03:27:16,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:16,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:27:16,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:16,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:27:16,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:27:16,762 INFO L87 Difference]: Start difference. First operand 773 states and 1020 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:27:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:18,728 INFO L93 Difference]: Finished difference Result 1745 states and 2298 transitions. [2025-02-06 03:27:18,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 03:27:18,728 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2025-02-06 03:27:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:18,732 INFO L225 Difference]: With dead ends: 1745 [2025-02-06 03:27:18,733 INFO L226 Difference]: Without dead ends: 996 [2025-02-06 03:27:18,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 03:27:18,735 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 319 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:18,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1823 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:27:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-02-06 03:27:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 736. [2025-02-06 03:27:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 626 states have (on average 1.2460063897763578) internal successors, (780), 635 states have internal predecessors, (780), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 87 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 03:27:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 972 transitions. [2025-02-06 03:27:18,902 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 972 transitions. Word has length 142 [2025-02-06 03:27:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:18,902 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 972 transitions. [2025-02-06 03:27:18,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:27:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 972 transitions. [2025-02-06 03:27:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:27:18,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:18,905 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:18,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:27:18,905 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:18,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2034611334, now seen corresponding path program 1 times [2025-02-06 03:27:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:18,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634860464] [2025-02-06 03:27:18,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:18,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:18,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:27:18,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:27:18,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:18,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:19,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:19,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634860464] [2025-02-06 03:27:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634860464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:19,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:19,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:27:19,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498864733] [2025-02-06 03:27:19,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:19,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:27:19,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:19,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:27:19,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:27:19,212 INFO L87 Difference]: Start difference. First operand 736 states and 972 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:19,495 INFO L93 Difference]: Finished difference Result 1436 states and 1903 transitions. [2025-02-06 03:27:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:27:19,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-02-06 03:27:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:19,500 INFO L225 Difference]: With dead ends: 1436 [2025-02-06 03:27:19,500 INFO L226 Difference]: Without dead ends: 1021 [2025-02-06 03:27:19,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:27:19,502 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 74 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:19,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 990 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:27:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-02-06 03:27:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 933. [2025-02-06 03:27:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 809 states have (on average 1.2595797280593326) internal successors, (1019), 820 states have internal predecessors, (1019), 108 states have call successors, (108), 15 states have call predecessors, (108), 15 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-06 03:27:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1235 transitions. [2025-02-06 03:27:19,675 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1235 transitions. Word has length 142 [2025-02-06 03:27:19,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:19,676 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1235 transitions. [2025-02-06 03:27:19,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:19,677 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1235 transitions. [2025-02-06 03:27:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:27:19,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:19,679 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:19,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:27:19,680 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:19,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash 800718785, now seen corresponding path program 1 times [2025-02-06 03:27:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:19,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822403777] [2025-02-06 03:27:19,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:19,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:27:19,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:27:19,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:19,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:21,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:21,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822403777] [2025-02-06 03:27:21,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822403777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:21,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:21,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:27:21,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929288638] [2025-02-06 03:27:21,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:21,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:27:21,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:21,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:27:21,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:27:21,057 INFO L87 Difference]: Start difference. First operand 933 states and 1235 transitions. Second operand has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:27:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:22,620 INFO L93 Difference]: Finished difference Result 2104 states and 2786 transitions. [2025-02-06 03:27:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:27:22,621 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 142 [2025-02-06 03:27:22,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:22,627 INFO L225 Difference]: With dead ends: 2104 [2025-02-06 03:27:22,628 INFO L226 Difference]: Without dead ends: 1195 [2025-02-06 03:27:22,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:27:22,630 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 290 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:22,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 787 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:27:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2025-02-06 03:27:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 896. [2025-02-06 03:27:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 772 states have (on average 1.2538860103626943) internal successors, (968), 783 states have internal predecessors, (968), 108 states have call successors, (108), 15 states have call predecessors, (108), 15 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-06 03:27:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1184 transitions. [2025-02-06 03:27:22,845 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1184 transitions. Word has length 142 [2025-02-06 03:27:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:22,845 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1184 transitions. [2025-02-06 03:27:22,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:27:22,846 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1184 transitions. [2025-02-06 03:27:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:27:22,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:22,848 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:22,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:27:22,848 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:22,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1598453992, now seen corresponding path program 1 times [2025-02-06 03:27:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:22,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488393784] [2025-02-06 03:27:22,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:22,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:22,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:27:22,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:27:22,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:22,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:22,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:22,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488393784] [2025-02-06 03:27:22,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488393784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:22,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:22,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:27:22,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201566360] [2025-02-06 03:27:22,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:22,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:27:22,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:22,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:27:22,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:27:22,990 INFO L87 Difference]: Start difference. First operand 896 states and 1184 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:23,251 INFO L93 Difference]: Finished difference Result 2014 states and 2656 transitions. [2025-02-06 03:27:23,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:27:23,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-02-06 03:27:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:23,256 INFO L225 Difference]: With dead ends: 2014 [2025-02-06 03:27:23,257 INFO L226 Difference]: Without dead ends: 1142 [2025-02-06 03:27:23,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:27:23,259 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 46 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:23,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 626 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:27:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-02-06 03:27:23,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 990. [2025-02-06 03:27:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 866 states have (on average 1.25635103926097) internal successors, (1088), 877 states have internal predecessors, (1088), 108 states have call successors, (108), 15 states have call predecessors, (108), 15 states have return successors, (108), 97 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-06 03:27:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1304 transitions. [2025-02-06 03:27:23,414 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1304 transitions. Word has length 143 [2025-02-06 03:27:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:23,414 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1304 transitions. [2025-02-06 03:27:23,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1304 transitions. [2025-02-06 03:27:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:27:23,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:23,416 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:23,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:27:23,416 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:23,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:23,417 INFO L85 PathProgramCache]: Analyzing trace with hash 858145130, now seen corresponding path program 1 times [2025-02-06 03:27:23,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:23,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858446232] [2025-02-06 03:27:23,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:23,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:23,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:27:23,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:27:23,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:23,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:24,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:24,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858446232] [2025-02-06 03:27:24,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858446232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:24,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:24,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:27:24,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277506718] [2025-02-06 03:27:24,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:24,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:27:24,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:24,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:27:24,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:27:24,581 INFO L87 Difference]: Start difference. First operand 990 states and 1304 transitions. Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:27:26,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:26,441 INFO L93 Difference]: Finished difference Result 2192 states and 2877 transitions. [2025-02-06 03:27:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:27:26,441 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 143 [2025-02-06 03:27:26,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:26,446 INFO L225 Difference]: With dead ends: 2192 [2025-02-06 03:27:26,446 INFO L226 Difference]: Without dead ends: 1226 [2025-02-06 03:27:26,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:27:26,448 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 253 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:26,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1556 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 03:27:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-02-06 03:27:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1002. [2025-02-06 03:27:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 887 states have (on average 1.2536640360766629) internal successors, (1112), 897 states have internal predecessors, (1112), 100 states have call successors, (100), 14 states have call predecessors, (100), 14 states have return successors, (100), 90 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 03:27:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1312 transitions. [2025-02-06 03:27:26,625 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1312 transitions. Word has length 143 [2025-02-06 03:27:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:26,625 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1312 transitions. [2025-02-06 03:27:26,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:27:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1312 transitions. [2025-02-06 03:27:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:27:26,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:26,627 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:26,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:27:26,627 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:26,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash 44770301, now seen corresponding path program 1 times [2025-02-06 03:27:26,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:26,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940758528] [2025-02-06 03:27:26,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:26,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:27:26,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:27:26,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:26,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:26,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:26,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940758528] [2025-02-06 03:27:26,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940758528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:26,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:26,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:27:26,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319470680] [2025-02-06 03:27:26,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:26,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:27:26,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:26,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:27:26,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:27:26,773 INFO L87 Difference]: Start difference. First operand 1002 states and 1312 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:26,949 INFO L93 Difference]: Finished difference Result 1646 states and 2165 transitions. [2025-02-06 03:27:26,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:27:26,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-02-06 03:27:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:26,952 INFO L225 Difference]: With dead ends: 1646 [2025-02-06 03:27:26,953 INFO L226 Difference]: Without dead ends: 1022 [2025-02-06 03:27:26,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:27:26,954 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 40 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:26,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 614 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:27:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-02-06 03:27:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 982. [2025-02-06 03:27:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 867 states have (on average 1.2479815455594003) internal successors, (1082), 877 states have internal predecessors, (1082), 100 states have call successors, (100), 14 states have call predecessors, (100), 14 states have return successors, (100), 90 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 03:27:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1282 transitions. [2025-02-06 03:27:27,090 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1282 transitions. Word has length 144 [2025-02-06 03:27:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:27,090 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1282 transitions. [2025-02-06 03:27:27,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1282 transitions. [2025-02-06 03:27:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:27:27,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:27,092 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:27,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:27:27,092 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:27,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:27,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1446880791, now seen corresponding path program 1 times [2025-02-06 03:27:27,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:27,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235205600] [2025-02-06 03:27:27,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:27,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:27,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:27:27,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:27:27,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:27,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:27,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:27,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235205600] [2025-02-06 03:27:27,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235205600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:27,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:27,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:27:27,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384342632] [2025-02-06 03:27:27,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:27,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:27:27,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:27,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:27:27,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:27:27,876 INFO L87 Difference]: Start difference. First operand 982 states and 1282 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:27:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:29,138 INFO L93 Difference]: Finished difference Result 2533 states and 3305 transitions. [2025-02-06 03:27:29,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:27:29,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2025-02-06 03:27:29,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:29,146 INFO L225 Difference]: With dead ends: 2533 [2025-02-06 03:27:29,146 INFO L226 Difference]: Without dead ends: 1554 [2025-02-06 03:27:29,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:27:29,149 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 230 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:29,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1033 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:27:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-02-06 03:27:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1073. [2025-02-06 03:27:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 944 states have (on average 1.2372881355932204) internal successors, (1168), 956 states have internal predecessors, (1168), 112 states have call successors, (112), 16 states have call predecessors, (112), 16 states have return successors, (112), 100 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 03:27:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1392 transitions. [2025-02-06 03:27:29,338 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1392 transitions. Word has length 144 [2025-02-06 03:27:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:29,339 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1392 transitions. [2025-02-06 03:27:29,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:27:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1392 transitions. [2025-02-06 03:27:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:27:29,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:29,340 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:29,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:27:29,341 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:29,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:29,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2050012873, now seen corresponding path program 1 times [2025-02-06 03:27:29,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:29,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611478134] [2025-02-06 03:27:29,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:29,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:29,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:27:29,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:27:29,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:29,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:30,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:30,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611478134] [2025-02-06 03:27:30,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611478134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:30,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:30,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:27:30,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85276009] [2025-02-06 03:27:30,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:30,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:27:30,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:30,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:27:30,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:27:30,152 INFO L87 Difference]: Start difference. First operand 1073 states and 1392 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:27:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:31,146 INFO L93 Difference]: Finished difference Result 2267 states and 2940 transitions. [2025-02-06 03:27:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:27:31,147 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2025-02-06 03:27:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:31,151 INFO L225 Difference]: With dead ends: 2267 [2025-02-06 03:27:31,151 INFO L226 Difference]: Without dead ends: 1197 [2025-02-06 03:27:31,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:27:31,153 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 227 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:31,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 680 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:27:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2025-02-06 03:27:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1046. [2025-02-06 03:27:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 892 states have (on average 1.2253363228699552) internal successors, (1093), 902 states have internal predecessors, (1093), 132 states have call successors, (132), 21 states have call predecessors, (132), 21 states have return successors, (132), 122 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-06 03:27:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1357 transitions. [2025-02-06 03:27:31,390 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1357 transitions. Word has length 144 [2025-02-06 03:27:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:31,390 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1357 transitions. [2025-02-06 03:27:31,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:27:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1357 transitions. [2025-02-06 03:27:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:27:31,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:31,392 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:31,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:27:31,392 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:31,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:31,392 INFO L85 PathProgramCache]: Analyzing trace with hash -481537119, now seen corresponding path program 1 times [2025-02-06 03:27:31,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:31,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220501218] [2025-02-06 03:27:31,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:31,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:31,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:27:31,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:27:31,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:31,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:31,674 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:31,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:31,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220501218] [2025-02-06 03:27:31,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220501218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:31,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:31,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:27:31,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642053526] [2025-02-06 03:27:31,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:31,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:27:31,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:31,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:27:31,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:27:31,676 INFO L87 Difference]: Start difference. First operand 1046 states and 1357 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:32,125 INFO L93 Difference]: Finished difference Result 2165 states and 2790 transitions. [2025-02-06 03:27:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:27:32,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-02-06 03:27:32,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:32,130 INFO L225 Difference]: With dead ends: 2165 [2025-02-06 03:27:32,130 INFO L226 Difference]: Without dead ends: 1122 [2025-02-06 03:27:32,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:27:32,133 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 65 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:32,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 377 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:27:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-02-06 03:27:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 701. [2025-02-06 03:27:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 624 states have (on average 1.2387820512820513) internal successors, (773), 627 states have internal predecessors, (773), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 03:27:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 901 transitions. [2025-02-06 03:27:32,283 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 901 transitions. Word has length 145 [2025-02-06 03:27:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:32,284 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 901 transitions. [2025-02-06 03:27:32,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 901 transitions. [2025-02-06 03:27:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:27:32,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:32,285 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:32,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:27:32,286 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:32,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1714819045, now seen corresponding path program 1 times [2025-02-06 03:27:32,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:32,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919286809] [2025-02-06 03:27:32,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:32,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:32,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:27:32,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:27:32,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:32,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:32,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:32,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919286809] [2025-02-06 03:27:32,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919286809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:32,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:32,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:27:32,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309103965] [2025-02-06 03:27:32,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:32,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:27:32,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:32,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:27:32,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:27:32,661 INFO L87 Difference]: Start difference. First operand 701 states and 901 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:33,081 INFO L93 Difference]: Finished difference Result 1650 states and 2117 transitions. [2025-02-06 03:27:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:27:33,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-02-06 03:27:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:33,086 INFO L225 Difference]: With dead ends: 1650 [2025-02-06 03:27:33,086 INFO L226 Difference]: Without dead ends: 952 [2025-02-06 03:27:33,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:27:33,091 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 69 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:33,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1193 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:27:33,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-02-06 03:27:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 787. [2025-02-06 03:27:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 710 states have (on average 1.2450704225352112) internal successors, (884), 713 states have internal predecessors, (884), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 03:27:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1012 transitions. [2025-02-06 03:27:33,247 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1012 transitions. Word has length 145 [2025-02-06 03:27:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:33,247 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1012 transitions. [2025-02-06 03:27:33,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1012 transitions. [2025-02-06 03:27:33,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:27:33,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:33,248 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:33,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:27:33,248 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:33,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:33,249 INFO L85 PathProgramCache]: Analyzing trace with hash -470054564, now seen corresponding path program 1 times [2025-02-06 03:27:33,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:33,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080171611] [2025-02-06 03:27:33,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:33,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:33,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:27:33,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:27:33,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:33,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:33,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:33,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080171611] [2025-02-06 03:27:33,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080171611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:33,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:33,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:27:33,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117237011] [2025-02-06 03:27:33,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:33,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:27:33,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:33,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:27:33,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:27:33,391 INFO L87 Difference]: Start difference. First operand 787 states and 1012 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:33,594 INFO L93 Difference]: Finished difference Result 1659 states and 2130 transitions. [2025-02-06 03:27:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:27:33,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-02-06 03:27:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:33,598 INFO L225 Difference]: With dead ends: 1659 [2025-02-06 03:27:33,598 INFO L226 Difference]: Without dead ends: 875 [2025-02-06 03:27:33,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:27:33,600 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 42 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:33,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 617 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:27:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-06 03:27:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 766. [2025-02-06 03:27:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 689 states have (on average 1.2409288824383164) internal successors, (855), 692 states have internal predecessors, (855), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-02-06 03:27:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 983 transitions. [2025-02-06 03:27:33,728 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 983 transitions. Word has length 145 [2025-02-06 03:27:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:33,728 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 983 transitions. [2025-02-06 03:27:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 983 transitions. [2025-02-06 03:27:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:27:33,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:33,730 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:33,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:27:33,730 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:33,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:33,730 INFO L85 PathProgramCache]: Analyzing trace with hash 773801681, now seen corresponding path program 1 times [2025-02-06 03:27:33,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:33,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415698311] [2025-02-06 03:27:33,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:33,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:33,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:27:33,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:27:33,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:33,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:33,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:33,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415698311] [2025-02-06 03:27:33,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415698311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:33,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:33,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:27:33,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936937743] [2025-02-06 03:27:33,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:33,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:27:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:33,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:27:33,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:27:33,912 INFO L87 Difference]: Start difference. First operand 766 states and 983 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:27:34,275 INFO L93 Difference]: Finished difference Result 1534 states and 1961 transitions. [2025-02-06 03:27:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:27:34,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-02-06 03:27:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:27:34,278 INFO L225 Difference]: With dead ends: 1534 [2025-02-06 03:27:34,278 INFO L226 Difference]: Without dead ends: 771 [2025-02-06 03:27:34,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:27:34,279 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 62 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:27:34,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 471 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:27:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-02-06 03:27:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 678. [2025-02-06 03:27:34,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 615 states have (on average 1.245528455284553) internal successors, (766), 617 states have internal predecessors, (766), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:27:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 870 transitions. [2025-02-06 03:27:34,378 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 870 transitions. Word has length 145 [2025-02-06 03:27:34,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:27:34,379 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 870 transitions. [2025-02-06 03:27:34,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:27:34,379 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 870 transitions. [2025-02-06 03:27:34,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:27:34,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:27:34,380 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:27:34,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:27:34,380 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:27:34,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:27:34,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1538894258, now seen corresponding path program 1 times [2025-02-06 03:27:34,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:27:34,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790617629] [2025-02-06 03:27:34,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:27:34,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:27:34,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:27:34,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:27:34,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:27:34,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:27:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:27:36,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:27:36,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790617629] [2025-02-06 03:27:36,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790617629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:27:36,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:27:36,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-06 03:27:36,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121307672] [2025-02-06 03:27:36,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:27:36,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 03:27:36,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:27:36,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 03:27:36,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:27:36,016 INFO L87 Difference]: Start difference. First operand 678 states and 870 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)