./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_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-s_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 a3ace122b1e1ec58f75c9939f157863ad20805c3ed845fddb96d7761951d3563 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:50:49,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:50:49,123 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:50:49,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:50:49,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:50:49,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:50:49,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:50:49,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:50:49,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:50:49,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:50:49,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:50:49,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:50:49,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:50:49,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:50:49,159 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:50:49,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:50:49,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:50:49,160 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:50:49,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:50:49,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:50:49,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:50:49,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:50:49,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:50:49,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:50:49,161 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:50:49,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:50:49,161 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:50:49,161 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:50:49,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:50:49,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:50:49,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:50:49,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:50:49,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:50:49,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:50:49,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:50:49,162 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:50:49,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:50:49,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:50:49,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:50:49,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:50:49,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:50:49,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:50:49,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:50:49,163 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 -> a3ace122b1e1ec58f75c9939f157863ad20805c3ed845fddb96d7761951d3563 [2025-02-06 03:50:49,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:50:49,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:50:49,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:50:49,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:50:49,405 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:50:49,406 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-s_file-32.i [2025-02-06 03:50:50,650 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/348770f79/76d2430ea7034d35b03452a47d556763/FLAG436f1eb4a [2025-02-06 03:50:50,899 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:50:50,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-32.i [2025-02-06 03:50:50,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/348770f79/76d2430ea7034d35b03452a47d556763/FLAG436f1eb4a [2025-02-06 03:50:50,919 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/348770f79/76d2430ea7034d35b03452a47d556763 [2025-02-06 03:50:50,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:50:50,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:50:50,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:50:50,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:50:50,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:50:50,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:50:50" (1/1) ... [2025-02-06 03:50:50,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:50, skipping insertion in model container [2025-02-06 03:50:50,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:50:50" (1/1) ... [2025-02-06 03:50:50,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:50:51,079 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-s_file-32.i[916,929] [2025-02-06 03:50:51,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:50:51,161 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:50:51,172 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-s_file-32.i[916,929] [2025-02-06 03:50:51,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:50:51,243 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:50:51,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:51 WrapperNode [2025-02-06 03:50:51,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:50:51,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:50:51,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:50:51,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:50:51,252 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:50:51" (1/1) ... [2025-02-06 03:50:51,266 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:50:51" (1/1) ... [2025-02-06 03:50:51,303 INFO L138 Inliner]: procedures = 27, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2025-02-06 03:50:51,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:50:51,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:50:51,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:50:51,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:50:51,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:51" (1/1) ... [2025-02-06 03:50:51,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:51" (1/1) ... [2025-02-06 03:50:51,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:51" (1/1) ... [2025-02-06 03:50:51,340 INFO L175 MemorySlicer]: Split 125 memory accesses to 2 slices as follows [2, 123]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2025-02-06 03:50:51,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:51" (1/1) ... [2025-02-06 03:50:51,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:51" (1/1) ... [2025-02-06 03:50:51,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:51" (1/1) ... [2025-02-06 03:50:51,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:51" (1/1) ... [2025-02-06 03:50:51,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:51" (1/1) ... [2025-02-06 03:50:51,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:51" (1/1) ... [2025-02-06 03:50:51,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:50:51,380 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:50:51,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:50:51,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:50:51,381 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:51" (1/1) ... [2025-02-06 03:50:51,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:50:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:50:51,409 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:50:51,415 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:50:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:50:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 03:50:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 03:50:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:50:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:50:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:50:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:50:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:50:51,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:50:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:50:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:50:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:50:51,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:50:51,548 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:50:51,550 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:50:51,940 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: 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:50:51,983 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-02-06 03:50:51,984 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:50:51,999 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:50:51,999 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:50:52,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:50:51 BoogieIcfgContainer [2025-02-06 03:50:52,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:50:52,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:50:52,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:50:52,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:50:52,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:50:50" (1/3) ... [2025-02-06 03:50:52,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661c00e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:50:52, skipping insertion in model container [2025-02-06 03:50:52,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:50:51" (2/3) ... [2025-02-06 03:50:52,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661c00e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:50:52, skipping insertion in model container [2025-02-06 03:50:52,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:50:51" (3/3) ... [2025-02-06 03:50:52,007 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-32.i [2025-02-06 03:50:52,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:50:52,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-32.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:50:52,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:50:52,080 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;@36da9d66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:50:52,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:50:52,086 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:50:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:50:52,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:52,098 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:50:52,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:52,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:52,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1311769662, now seen corresponding path program 1 times [2025-02-06 03:50:52,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:52,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560553147] [2025-02-06 03:50:52,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:52,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:52,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:50:52,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:50:52,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:52,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:52,470 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:50:52,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:52,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560553147] [2025-02-06 03:50:52,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560553147] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:50:52,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979324002] [2025-02-06 03:50:52,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:52,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:50:52,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:50:52,477 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:50:52,480 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:50:52,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:50:52,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:50:52,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:52,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:52,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:50:52,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:50:52,711 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:50:52,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:50:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979324002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:52,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:50:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:50:52,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823707902] [2025-02-06 03:50:52,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:52,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:50:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:52,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:50:52,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:50:52,740 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:50:52,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:52,769 INFO L93 Difference]: Finished difference Result 190 states and 295 transitions. [2025-02-06 03:50:52,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:50:52,770 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:50:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:52,778 INFO L225 Difference]: With dead ends: 190 [2025-02-06 03:50:52,779 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 03:50:52,782 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:50:52,787 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:50:52,787 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:50:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 03:50:52,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-06 03:50:52,816 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:50:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-02-06 03:50:52,823 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 129 [2025-02-06 03:50:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:52,823 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-02-06 03:50:52,824 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:50:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-02-06 03:50:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:50:52,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:52,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] [2025-02-06 03:50:52,837 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:50:53,032 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:50:53,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:53,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash 786408876, now seen corresponding path program 1 times [2025-02-06 03:50:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:53,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853698889] [2025-02-06 03:50:53,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:53,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:50:53,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:50:53,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:53,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:53,740 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:50:53,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:53,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853698889] [2025-02-06 03:50:53,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853698889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:53,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:53,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:50:53,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395389163] [2025-02-06 03:50:53,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:53,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:50:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:53,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:50:53,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:50:53,744 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:50:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:54,086 INFO L93 Difference]: Finished difference Result 318 states and 444 transitions. [2025-02-06 03:50:54,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:50:54,086 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:50:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:54,089 INFO L225 Difference]: With dead ends: 318 [2025-02-06 03:50:54,090 INFO L226 Difference]: Without dead ends: 226 [2025-02-06 03:50:54,091 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:50:54,092 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 200 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:54,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 271 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:50:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-06 03:50:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 193. [2025-02-06 03:50:54,123 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:50:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 270 transitions. [2025-02-06 03:50:54,126 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 270 transitions. Word has length 129 [2025-02-06 03:50:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:54,126 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 270 transitions. [2025-02-06 03:50:54,126 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:50:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 270 transitions. [2025-02-06 03:50:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:50:54,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:54,132 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:50:54,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:50:54,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:54,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:54,135 INFO L85 PathProgramCache]: Analyzing trace with hash -153570148, now seen corresponding path program 1 times [2025-02-06 03:50:54,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:54,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121169153] [2025-02-06 03:50:54,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:54,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:54,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:50:54,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:50:54,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:54,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:56,035 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:50:56,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121169153] [2025-02-06 03:50:56,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121169153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:56,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:56,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:50:56,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799095939] [2025-02-06 03:50:56,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:56,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:50:56,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:56,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:50:56,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:50:56,037 INFO L87 Difference]: Start difference. First operand 193 states and 270 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (18), 1 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:50:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:50:56,673 INFO L93 Difference]: Finished difference Result 511 states and 714 transitions. [2025-02-06 03:50:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:50:56,673 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (18), 1 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 137 [2025-02-06 03:50:56,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:50:56,676 INFO L225 Difference]: With dead ends: 511 [2025-02-06 03:50:56,676 INFO L226 Difference]: Without dead ends: 321 [2025-02-06 03:50:56,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:50:56,678 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 74 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:50:56,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 869 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:50:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-06 03:50:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2025-02-06 03:50:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 268 states have (on average 1.3171641791044777) internal successors, (353), 270 states have internal predecessors, (353), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 03:50:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 441 transitions. [2025-02-06 03:50:56,719 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 441 transitions. Word has length 137 [2025-02-06 03:50:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:50:56,720 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 441 transitions. [2025-02-06 03:50:56,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (18), 1 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:50:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 441 transitions. [2025-02-06 03:50:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:50:56,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:50:56,722 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:50:56,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:50:56,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:50:56,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:50:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1238800959, now seen corresponding path program 1 times [2025-02-06 03:50:56,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:50:56,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534479270] [2025-02-06 03:50:56,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:50:56,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:50:56,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:50:56,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:50:56,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:50:56,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:50:59,099 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:50:59,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:50:59,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534479270] [2025-02-06 03:50:59,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534479270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:50:59,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:50:59,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:50:59,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022532888] [2025-02-06 03:50:59,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:50:59,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:50:59,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:50:59,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:50:59,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:50:59,101 INFO L87 Difference]: Start difference. First operand 317 states and 441 transitions. Second operand has 12 states, 9 states have (on average 5.777777777777778) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:51:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:00,103 INFO L93 Difference]: Finished difference Result 683 states and 951 transitions. [2025-02-06 03:51:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:51:00,104 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.777777777777778) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2025-02-06 03:51:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:00,109 INFO L225 Difference]: With dead ends: 683 [2025-02-06 03:51:00,110 INFO L226 Difference]: Without dead ends: 369 [2025-02-06 03:51:00,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:51:00,112 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 64 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:00,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1085 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:51:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-02-06 03:51:00,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 332. [2025-02-06 03:51:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 283 states have (on average 1.325088339222615) internal successors, (375), 285 states have internal predecessors, (375), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 03:51:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 463 transitions. [2025-02-06 03:51:00,154 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 463 transitions. Word has length 139 [2025-02-06 03:51:00,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:00,156 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 463 transitions. [2025-02-06 03:51:00,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.777777777777778) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:51:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 463 transitions. [2025-02-06 03:51:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:51:00,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:00,158 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:51:00,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:51:00,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:00,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:00,160 INFO L85 PathProgramCache]: Analyzing trace with hash -545676001, now seen corresponding path program 1 times [2025-02-06 03:51:00,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:00,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763712231] [2025-02-06 03:51:00,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:00,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:00,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:51:00,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:51:00,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:00,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:02,617 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:51:02,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:02,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763712231] [2025-02-06 03:51:02,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763712231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:02,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:02,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:51:02,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434512331] [2025-02-06 03:51:02,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:02,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:51:02,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:02,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:51:02,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:51:02,620 INFO L87 Difference]: Start difference. First operand 332 states and 463 transitions. Second operand has 14 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:51:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:03,484 INFO L93 Difference]: Finished difference Result 655 states and 914 transitions. [2025-02-06 03:51:03,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:51:03,485 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2025-02-06 03:51:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:03,488 INFO L225 Difference]: With dead ends: 655 [2025-02-06 03:51:03,488 INFO L226 Difference]: Without dead ends: 326 [2025-02-06 03:51:03,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:51:03,490 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 57 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:03,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 857 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:51:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-06 03:51:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 322. [2025-02-06 03:51:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 273 states have (on average 1.3223443223443223) internal successors, (361), 275 states have internal predecessors, (361), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 03:51:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 449 transitions. [2025-02-06 03:51:03,510 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 449 transitions. Word has length 139 [2025-02-06 03:51:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:03,511 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 449 transitions. [2025-02-06 03:51:03,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:51:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 449 transitions. [2025-02-06 03:51:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:51:03,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:03,512 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:51:03,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:51:03,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:03,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash 981150675, now seen corresponding path program 1 times [2025-02-06 03:51:03,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:03,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076838785] [2025-02-06 03:51:03,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:03,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:03,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:51:03,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:51:03,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:03,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:03,674 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:51:03,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:03,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076838785] [2025-02-06 03:51:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076838785] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:03,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377981264] [2025-02-06 03:51:03,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:03,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:03,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:03,677 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:51:03,679 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:51:03,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:51:03,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:51:03,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:03,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:03,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:51:03,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:03,876 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:51:03,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:51:03,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377981264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:03,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:51:03,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:51:03,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120352104] [2025-02-06 03:51:03,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:03,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:51:03,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:03,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:51:03,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:51:03,880 INFO L87 Difference]: Start difference. First operand 322 states and 449 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:51:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:03,919 INFO L93 Difference]: Finished difference Result 653 states and 911 transitions. [2025-02-06 03:51:03,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:51:03,919 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:51:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:03,921 INFO L225 Difference]: With dead ends: 653 [2025-02-06 03:51:03,922 INFO L226 Difference]: Without dead ends: 334 [2025-02-06 03:51:03,922 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:51:03,925 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:51:03,926 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:51:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-06 03:51:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-02-06 03:51:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 285 states have (on average 1.3087719298245615) internal successors, (373), 287 states have internal predecessors, (373), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 03:51:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 461 transitions. [2025-02-06 03:51:03,952 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 461 transitions. Word has length 139 [2025-02-06 03:51:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:03,954 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 461 transitions. [2025-02-06 03:51:03,954 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:51:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 461 transitions. [2025-02-06 03:51:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:51:03,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:03,956 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:51:03,964 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:51:04,159 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:51:04,160 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:04,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:04,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1788128770, now seen corresponding path program 1 times [2025-02-06 03:51:04,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:04,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876639902] [2025-02-06 03:51:04,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:04,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:04,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:51:04,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:51:04,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:04,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:05,907 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:51:05,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:05,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876639902] [2025-02-06 03:51:05,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876639902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:05,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:05,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 03:51:05,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9223150] [2025-02-06 03:51:05,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:05,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:51:05,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:05,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:51:05,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:51:05,909 INFO L87 Difference]: Start difference. First operand 334 states and 461 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:51:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:07,098 INFO L93 Difference]: Finished difference Result 787 states and 1078 transitions. [2025-02-06 03:51:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:51:07,099 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 141 [2025-02-06 03:51:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:07,104 INFO L225 Difference]: With dead ends: 787 [2025-02-06 03:51:07,105 INFO L226 Difference]: Without dead ends: 456 [2025-02-06 03:51:07,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:51:07,107 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 127 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:07,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1697 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:51:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-02-06 03:51:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 364. [2025-02-06 03:51:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 315 states have (on average 1.307936507936508) internal successors, (412), 317 states have internal predecessors, (412), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 03:51:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 500 transitions. [2025-02-06 03:51:07,138 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 500 transitions. Word has length 141 [2025-02-06 03:51:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:07,138 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 500 transitions. [2025-02-06 03:51:07,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:51:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 500 transitions. [2025-02-06 03:51:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:51:07,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:07,140 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:51:07,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:51:07,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:07,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:07,145 INFO L85 PathProgramCache]: Analyzing trace with hash 280515349, now seen corresponding path program 1 times [2025-02-06 03:51:07,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:07,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374665227] [2025-02-06 03:51:07,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:07,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:07,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:51:07,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:51:07,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:07,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:08,335 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:51:08,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:08,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374665227] [2025-02-06 03:51:08,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374665227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:08,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:08,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:51:08,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392790475] [2025-02-06 03:51:08,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:08,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:51:08,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:08,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:51:08,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:51:08,339 INFO L87 Difference]: Start difference. First operand 364 states and 500 transitions. Second operand has 10 states, 8 states have (on average 6.75) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:51:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:09,122 INFO L93 Difference]: Finished difference Result 1016 states and 1385 transitions. [2025-02-06 03:51:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:51:09,123 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.75) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 141 [2025-02-06 03:51:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:09,127 INFO L225 Difference]: With dead ends: 1016 [2025-02-06 03:51:09,128 INFO L226 Difference]: Without dead ends: 655 [2025-02-06 03:51:09,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:51:09,129 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 207 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:09,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 474 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:51:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-02-06 03:51:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 632. [2025-02-06 03:51:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 529 states have (on average 1.281663516068053) internal successors, (678), 534 states have internal predecessors, (678), 92 states have call successors, (92), 10 states have call predecessors, (92), 10 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-06 03:51:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 862 transitions. [2025-02-06 03:51:09,184 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 862 transitions. Word has length 141 [2025-02-06 03:51:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:09,185 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 862 transitions. [2025-02-06 03:51:09,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.75) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:51:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 862 transitions. [2025-02-06 03:51:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 03:51:09,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:09,187 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:51:09,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:51:09,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:09,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1747853127, now seen corresponding path program 1 times [2025-02-06 03:51:09,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:09,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764734187] [2025-02-06 03:51:09,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:09,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 03:51:09,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 03:51:09,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:09,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:11,995 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:51:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764734187] [2025-02-06 03:51:11,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764734187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:11,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-06 03:51:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408657827] [2025-02-06 03:51:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:11,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 03:51:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:11,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 03:51:11,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:51:11,998 INFO L87 Difference]: Start difference. First operand 632 states and 862 transitions. Second operand has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 23 states have internal predecessors, (54), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 6 states have call successors, (18) [2025-02-06 03:51:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:14,731 INFO L93 Difference]: Finished difference Result 1228 states and 1597 transitions. [2025-02-06 03:51:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 03:51:14,732 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 23 states have internal predecessors, (54), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 6 states have call successors, (18) Word has length 141 [2025-02-06 03:51:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:14,741 INFO L225 Difference]: With dead ends: 1228 [2025-02-06 03:51:14,742 INFO L226 Difference]: Without dead ends: 1226 [2025-02-06 03:51:14,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=326, Invalid=2326, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 03:51:14,744 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 633 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:14,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 975 Invalid, 2233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 03:51:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-02-06 03:51:14,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1051. [2025-02-06 03:51:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 906 states have (on average 1.2516556291390728) internal successors, (1134), 918 states have internal predecessors, (1134), 122 states have call successors, (122), 22 states have call predecessors, (122), 22 states have return successors, (122), 110 states have call predecessors, (122), 122 states have call successors, (122) [2025-02-06 03:51:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1378 transitions. [2025-02-06 03:51:14,817 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1378 transitions. Word has length 141 [2025-02-06 03:51:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:14,818 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1378 transitions. [2025-02-06 03:51:14,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 23 states have internal predecessors, (54), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 6 states have call successors, (18) [2025-02-06 03:51:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1378 transitions. [2025-02-06 03:51:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:51:14,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:14,820 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:51:14,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:51:14,820 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:14,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:14,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1868612061, now seen corresponding path program 1 times [2025-02-06 03:51:14,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:14,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636114057] [2025-02-06 03:51:14,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:14,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:14,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:51:14,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:51:14,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:14,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:16,225 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:51:16,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:16,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636114057] [2025-02-06 03:51:16,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636114057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:16,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:16,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:51:16,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509311579] [2025-02-06 03:51:16,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:16,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:51:16,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:16,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:51:16,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:51:16,227 INFO L87 Difference]: Start difference. First operand 1051 states and 1378 transitions. Second operand has 15 states, 13 states have (on average 4.230769230769231) internal successors, (55), 15 states have internal predecessors, (55), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:51:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:17,139 INFO L93 Difference]: Finished difference Result 2176 states and 2847 transitions. [2025-02-06 03:51:17,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:51:17,140 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), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 142 [2025-02-06 03:51:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:17,147 INFO L225 Difference]: With dead ends: 2176 [2025-02-06 03:51:17,147 INFO L226 Difference]: Without dead ends: 1133 [2025-02-06 03:51:17,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:51:17,150 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 52 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:17,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1475 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:51:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-02-06 03:51:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1009. [2025-02-06 03:51:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 864 states have (on average 1.25) internal successors, (1080), 876 states have internal predecessors, (1080), 122 states have call successors, (122), 22 states have call predecessors, (122), 22 states have return successors, (122), 110 states have call predecessors, (122), 122 states have call successors, (122) [2025-02-06 03:51:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1324 transitions. [2025-02-06 03:51:17,217 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1324 transitions. Word has length 142 [2025-02-06 03:51:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:17,220 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1324 transitions. [2025-02-06 03:51:17,220 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), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:51:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1324 transitions. [2025-02-06 03:51:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 03:51:17,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:17,222 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:51:17,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:51:17,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:17,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:17,222 INFO L85 PathProgramCache]: Analyzing trace with hash 801936092, now seen corresponding path program 1 times [2025-02-06 03:51:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:17,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650376671] [2025-02-06 03:51:17,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:17,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:17,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 03:51:17,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 03:51:17,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:17,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:18,111 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:51:18,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:18,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650376671] [2025-02-06 03:51:18,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650376671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:18,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:18,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:51:18,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148354743] [2025-02-06 03:51:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:18,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:51:18,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:18,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:51:18,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:51:18,114 INFO L87 Difference]: Start difference. First operand 1009 states and 1324 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (18), 1 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:51:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:18,659 INFO L93 Difference]: Finished difference Result 2040 states and 2687 transitions. [2025-02-06 03:51:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:51:18,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (18), 1 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 142 [2025-02-06 03:51:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:18,667 INFO L225 Difference]: With dead ends: 2040 [2025-02-06 03:51:18,667 INFO L226 Difference]: Without dead ends: 1413 [2025-02-06 03:51:18,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:51:18,670 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 68 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:18,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1104 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:51:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2025-02-06 03:51:18,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1391. [2025-02-06 03:51:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1204 states have (on average 1.2574750830564785) internal successors, (1514), 1222 states have internal predecessors, (1514), 158 states have call successors, (158), 28 states have call predecessors, (158), 28 states have return successors, (158), 140 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-06 03:51:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1830 transitions. [2025-02-06 03:51:18,753 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1830 transitions. Word has length 142 [2025-02-06 03:51:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:18,753 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1830 transitions. [2025-02-06 03:51:18,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (18), 1 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:51:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1830 transitions. [2025-02-06 03:51:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:51:18,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:18,755 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:51:18,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:51:18,756 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:18,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash 646521203, now seen corresponding path program 1 times [2025-02-06 03:51:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:18,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330335331] [2025-02-06 03:51:18,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:18,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:18,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:51:18,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:51:18,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:18,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:19,176 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:51:19,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:19,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330335331] [2025-02-06 03:51:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330335331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:19,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:19,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:51:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979024722] [2025-02-06 03:51:19,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:19,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:51:19,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:19,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:51:19,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:51:19,180 INFO L87 Difference]: Start difference. First operand 1391 states and 1830 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (18), 1 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:51:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:19,528 INFO L93 Difference]: Finished difference Result 3200 states and 4193 transitions. [2025-02-06 03:51:19,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:51:19,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (18), 1 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 143 [2025-02-06 03:51:19,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:19,539 INFO L225 Difference]: With dead ends: 3200 [2025-02-06 03:51:19,539 INFO L226 Difference]: Without dead ends: 1817 [2025-02-06 03:51:19,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:51:19,544 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 71 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:19,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 491 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:51:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2025-02-06 03:51:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1783. [2025-02-06 03:51:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1528 states have (on average 1.2395287958115184) internal successors, (1894), 1552 states have internal predecessors, (1894), 214 states have call successors, (214), 40 states have call predecessors, (214), 40 states have return successors, (214), 190 states have call predecessors, (214), 214 states have call successors, (214) [2025-02-06 03:51:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2322 transitions. [2025-02-06 03:51:19,647 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2322 transitions. Word has length 143 [2025-02-06 03:51:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:19,648 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2322 transitions. [2025-02-06 03:51:19,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (18), 1 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:51:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2322 transitions. [2025-02-06 03:51:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 03:51:19,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:19,650 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:51:19,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:51:19,650 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:19,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1403197884, now seen corresponding path program 1 times [2025-02-06 03:51:19,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:19,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628845828] [2025-02-06 03:51:19,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:19,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:19,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 03:51:19,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 03:51:19,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:19,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:20,950 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:51:20,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628845828] [2025-02-06 03:51:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628845828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:20,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:51:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594473585] [2025-02-06 03:51:20,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:20,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:51:20,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:20,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:51:20,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:51:20,953 INFO L87 Difference]: Start difference. First operand 1783 states and 2322 transitions. Second operand has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:51:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:21,376 INFO L93 Difference]: Finished difference Result 4058 states and 5266 transitions. [2025-02-06 03:51:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:51:21,376 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 143 [2025-02-06 03:51:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:21,387 INFO L225 Difference]: With dead ends: 4058 [2025-02-06 03:51:21,388 INFO L226 Difference]: Without dead ends: 2291 [2025-02-06 03:51:21,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:51:21,392 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 35 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:21,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 751 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:51:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2025-02-06 03:51:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2107. [2025-02-06 03:51:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 1852 states have (on average 1.232181425485961) internal successors, (2282), 1876 states have internal predecessors, (2282), 214 states have call successors, (214), 40 states have call predecessors, (214), 40 states have return successors, (214), 190 states have call predecessors, (214), 214 states have call successors, (214) [2025-02-06 03:51:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2710 transitions. [2025-02-06 03:51:21,504 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 2710 transitions. Word has length 143 [2025-02-06 03:51:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:21,505 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 2710 transitions. [2025-02-06 03:51:21,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:51:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2710 transitions. [2025-02-06 03:51:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:51:21,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:21,508 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:51:21,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:51:21,508 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:21,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:21,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1337386401, now seen corresponding path program 1 times [2025-02-06 03:51:21,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:21,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779865693] [2025-02-06 03:51:21,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:21,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:21,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:51:21,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:51:21,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:21,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:21,985 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:51:21,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:21,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779865693] [2025-02-06 03:51:21,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779865693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:21,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:21,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:51:21,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814419220] [2025-02-06 03:51:21,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:21,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:51:21,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:21,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:51:21,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:51:21,989 INFO L87 Difference]: Start difference. First operand 2107 states and 2710 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 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:51:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:22,335 INFO L93 Difference]: Finished difference Result 3551 states and 4578 transitions. [2025-02-06 03:51:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:51:22,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 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 144 [2025-02-06 03:51:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:22,344 INFO L225 Difference]: With dead ends: 3551 [2025-02-06 03:51:22,345 INFO L226 Difference]: Without dead ends: 2085 [2025-02-06 03:51:22,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:51:22,348 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 66 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:22,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 607 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:51:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-02-06 03:51:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2081. [2025-02-06 03:51:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 1820 states have (on average 1.2247252747252748) internal successors, (2229), 1844 states have internal predecessors, (2229), 218 states have call successors, (218), 42 states have call predecessors, (218), 42 states have return successors, (218), 194 states have call predecessors, (218), 218 states have call successors, (218) [2025-02-06 03:51:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2665 transitions. [2025-02-06 03:51:22,448 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2665 transitions. Word has length 144 [2025-02-06 03:51:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:22,449 INFO L471 AbstractCegarLoop]: Abstraction has 2081 states and 2665 transitions. [2025-02-06 03:51:22,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 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:51:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2665 transitions. [2025-02-06 03:51:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 03:51:22,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:22,452 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:51:22,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:51:22,452 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:22,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash 667856171, now seen corresponding path program 1 times [2025-02-06 03:51:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:22,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848200613] [2025-02-06 03:51:22,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:22,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:22,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 03:51:22,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 03:51:22,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:22,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:25,203 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:51:25,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:25,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848200613] [2025-02-06 03:51:25,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848200613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:25,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:25,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:51:25,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504206425] [2025-02-06 03:51:25,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:25,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:51:25,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:25,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:51:25,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:51:25,205 INFO L87 Difference]: Start difference. First operand 2081 states and 2665 transitions. Second operand has 18 states, 15 states have (on average 3.8) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:51:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:27,809 INFO L93 Difference]: Finished difference Result 4168 states and 5333 transitions. [2025-02-06 03:51:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 03:51:27,810 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.8) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2025-02-06 03:51:27,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:27,819 INFO L225 Difference]: With dead ends: 4168 [2025-02-06 03:51:27,820 INFO L226 Difference]: Without dead ends: 2103 [2025-02-06 03:51:27,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 03:51:27,824 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 285 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:27,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1010 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 03:51:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2025-02-06 03:51:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 2068. [2025-02-06 03:51:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 1807 states have (on average 1.2257885998893192) internal successors, (2215), 1831 states have internal predecessors, (2215), 218 states have call successors, (218), 42 states have call predecessors, (218), 42 states have return successors, (218), 194 states have call predecessors, (218), 218 states have call successors, (218) [2025-02-06 03:51:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2651 transitions. [2025-02-06 03:51:27,927 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2651 transitions. Word has length 144 [2025-02-06 03:51:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:27,927 INFO L471 AbstractCegarLoop]: Abstraction has 2068 states and 2651 transitions. [2025-02-06 03:51:27,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.8) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:51:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2651 transitions. [2025-02-06 03:51:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:51:27,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:27,931 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:51:27,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:51:27,932 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:27,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash -378721925, now seen corresponding path program 1 times [2025-02-06 03:51:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:27,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834749170] [2025-02-06 03:51:27,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:27,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:27,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:51:27,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:51:27,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:27,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:28,886 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:51:28,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:28,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834749170] [2025-02-06 03:51:28,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834749170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:28,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:28,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:51:28,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081540458] [2025-02-06 03:51:28,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:28,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:51:28,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:28,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:51:28,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:51:28,887 INFO L87 Difference]: Start difference. First operand 2068 states and 2651 transitions. Second operand has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:51:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:29,241 INFO L93 Difference]: Finished difference Result 4103 states and 5249 transitions. [2025-02-06 03:51:29,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:51:29,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-02-06 03:51:29,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:29,251 INFO L225 Difference]: With dead ends: 4103 [2025-02-06 03:51:29,251 INFO L226 Difference]: Without dead ends: 2051 [2025-02-06 03:51:29,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:51:29,256 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 55 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:29,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 414 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:51:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2025-02-06 03:51:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1539. [2025-02-06 03:51:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1360 states have (on average 1.214705882352941) internal successors, (1652), 1378 states have internal predecessors, (1652), 144 states have call successors, (144), 34 states have call predecessors, (144), 34 states have return successors, (144), 126 states have call predecessors, (144), 144 states have call successors, (144) [2025-02-06 03:51:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 1940 transitions. [2025-02-06 03:51:29,345 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 1940 transitions. Word has length 145 [2025-02-06 03:51:29,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:29,346 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 1940 transitions. [2025-02-06 03:51:29,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:51:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1940 transitions. [2025-02-06 03:51:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:51:29,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:29,349 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:51:29,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:51:29,349 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:29,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:29,350 INFO L85 PathProgramCache]: Analyzing trace with hash -367239370, now seen corresponding path program 1 times [2025-02-06 03:51:29,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:29,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554858634] [2025-02-06 03:51:29,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:29,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:29,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:51:29,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:51:29,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:29,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:29,820 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:51:29,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:29,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554858634] [2025-02-06 03:51:29,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554858634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:29,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:29,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:51:29,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717006822] [2025-02-06 03:51:29,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:29,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:51:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:29,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:51:29,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:51:29,824 INFO L87 Difference]: Start difference. First operand 1539 states and 1940 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (18), 1 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:51:30,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:30,184 INFO L93 Difference]: Finished difference Result 3266 states and 4120 transitions. [2025-02-06 03:51:30,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:51:30,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (18), 1 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 145 [2025-02-06 03:51:30,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:30,196 INFO L225 Difference]: With dead ends: 3266 [2025-02-06 03:51:30,196 INFO L226 Difference]: Without dead ends: 1743 [2025-02-06 03:51:30,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:51:30,200 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 74 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:30,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 466 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:51:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-02-06 03:51:30,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1739. [2025-02-06 03:51:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1533 states have (on average 1.20808871493803) internal successors, (1852), 1553 states have internal predecessors, (1852), 166 states have call successors, (166), 39 states have call predecessors, (166), 39 states have return successors, (166), 146 states have call predecessors, (166), 166 states have call successors, (166) [2025-02-06 03:51:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2184 transitions. [2025-02-06 03:51:30,302 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2184 transitions. Word has length 145 [2025-02-06 03:51:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:30,303 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2184 transitions. [2025-02-06 03:51:30,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (18), 1 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:51:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2184 transitions. [2025-02-06 03:51:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:51:30,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:30,305 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:51:30,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:51:30,306 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:30,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash -563752875, now seen corresponding path program 1 times [2025-02-06 03:51:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:30,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759340559] [2025-02-06 03:51:30,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:30,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:51:30,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:51:30,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:30,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:30,453 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:51:30,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:30,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759340559] [2025-02-06 03:51:30,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759340559] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:51:30,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946079485] [2025-02-06 03:51:30,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:30,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:30,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:51:30,457 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:51:30,458 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:51:30,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:51:30,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:51:30,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:30,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:30,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:51:30,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:51:30,690 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:51:30,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:51:30,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946079485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:30,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:51:30,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-02-06 03:51:30,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367708692] [2025-02-06 03:51:30,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:30,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:51:30,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:30,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:51:30,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:51:30,692 INFO L87 Difference]: Start difference. First operand 1739 states and 2184 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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:51:30,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:30,788 INFO L93 Difference]: Finished difference Result 3516 states and 4412 transitions. [2025-02-06 03:51:30,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:51:30,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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:51:30,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:30,796 INFO L225 Difference]: With dead ends: 3516 [2025-02-06 03:51:30,797 INFO L226 Difference]: Without dead ends: 1793 [2025-02-06 03:51:30,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:51:30,800 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:30,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 742 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:51:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2025-02-06 03:51:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1721. [2025-02-06 03:51:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1515 states have (on average 1.2046204620462047) internal successors, (1825), 1535 states have internal predecessors, (1825), 166 states have call successors, (166), 39 states have call predecessors, (166), 39 states have return successors, (166), 146 states have call predecessors, (166), 166 states have call successors, (166) [2025-02-06 03:51:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2157 transitions. [2025-02-06 03:51:30,890 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2157 transitions. Word has length 145 [2025-02-06 03:51:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:30,890 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2157 transitions. [2025-02-06 03:51:30,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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:51:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2157 transitions. [2025-02-06 03:51:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:51:30,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:30,893 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:51:30,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:51:31,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:51:31,094 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:31,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:31,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1612003851, now seen corresponding path program 1 times [2025-02-06 03:51:31,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:31,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685590345] [2025-02-06 03:51:31,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:31,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:31,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:51:31,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:51:31,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:31,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:32,037 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:51:32,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:32,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685590345] [2025-02-06 03:51:32,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685590345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:32,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:32,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:51:32,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743170161] [2025-02-06 03:51:32,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:32,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:51:32,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:32,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:51:32,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:51:32,040 INFO L87 Difference]: Start difference. First operand 1721 states and 2157 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (18), 1 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:51:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:32,523 INFO L93 Difference]: Finished difference Result 2927 states and 3677 transitions. [2025-02-06 03:51:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:51:32,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (18), 1 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 145 [2025-02-06 03:51:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:32,532 INFO L225 Difference]: With dead ends: 2927 [2025-02-06 03:51:32,532 INFO L226 Difference]: Without dead ends: 1751 [2025-02-06 03:51:32,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:51:32,535 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 59 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:32,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1193 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:51:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2025-02-06 03:51:32,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1649. [2025-02-06 03:51:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1454 states have (on average 1.2056396148555708) internal successors, (1753), 1472 states have internal predecessors, (1753), 156 states have call successors, (156), 38 states have call predecessors, (156), 38 states have return successors, (156), 138 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-06 03:51:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2065 transitions. [2025-02-06 03:51:32,621 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2065 transitions. Word has length 145 [2025-02-06 03:51:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:32,621 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2065 transitions. [2025-02-06 03:51:32,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (18), 1 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:51:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2065 transitions. [2025-02-06 03:51:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:51:32,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:32,623 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:51:32,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:51:32,624 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:32,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:32,624 INFO L85 PathProgramCache]: Analyzing trace with hash -583498748, now seen corresponding path program 1 times [2025-02-06 03:51:32,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:32,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442120228] [2025-02-06 03:51:32,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:32,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:32,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:51:32,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:51:32,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:32,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:34,818 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:51:34,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:34,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442120228] [2025-02-06 03:51:34,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442120228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:34,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:34,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-06 03:51:34,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680754355] [2025-02-06 03:51:34,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:34,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:51:34,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:34,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:51:34,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:51:34,820 INFO L87 Difference]: Start difference. First operand 1649 states and 2065 transitions. Second operand has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:51:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:36,196 INFO L93 Difference]: Finished difference Result 3544 states and 4421 transitions. [2025-02-06 03:51:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:51:36,197 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 145 [2025-02-06 03:51:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:36,205 INFO L225 Difference]: With dead ends: 3544 [2025-02-06 03:51:36,205 INFO L226 Difference]: Without dead ends: 1911 [2025-02-06 03:51:36,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:51:36,209 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 226 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:36,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1436 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 03:51:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2025-02-06 03:51:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1611. [2025-02-06 03:51:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1418 states have (on average 1.2094499294781382) internal successors, (1715), 1435 states have internal predecessors, (1715), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-06 03:51:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2019 transitions. [2025-02-06 03:51:36,340 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2019 transitions. Word has length 145 [2025-02-06 03:51:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:36,340 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2019 transitions. [2025-02-06 03:51:36,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:51:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2019 transitions. [2025-02-06 03:51:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 03:51:36,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:36,343 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:51:36,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:51:36,343 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:36,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:36,343 INFO L85 PathProgramCache]: Analyzing trace with hash 876616875, now seen corresponding path program 1 times [2025-02-06 03:51:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:36,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121017707] [2025-02-06 03:51:36,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:36,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:36,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 03:51:36,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 03:51:36,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:36,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:38,923 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:51:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:38,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121017707] [2025-02-06 03:51:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121017707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:38,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:38,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-06 03:51:38,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855467783] [2025-02-06 03:51:38,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:38,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:51:38,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:38,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:51:38,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:51:38,926 INFO L87 Difference]: Start difference. First operand 1611 states and 2019 transitions. Second operand has 19 states, 16 states have (on average 3.625) internal successors, (58), 19 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 03:51:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:41,091 INFO L93 Difference]: Finished difference Result 3226 states and 4037 transitions. [2025-02-06 03:51:41,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 03:51:41,092 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.625) internal successors, (58), 19 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) Word has length 145 [2025-02-06 03:51:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:41,099 INFO L225 Difference]: With dead ends: 3226 [2025-02-06 03:51:41,100 INFO L226 Difference]: Without dead ends: 1618 [2025-02-06 03:51:41,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 03:51:41,104 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 386 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:41,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 862 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:51:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-02-06 03:51:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1601. [2025-02-06 03:51:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1408 states have (on average 1.2066761363636365) internal successors, (1699), 1425 states have internal predecessors, (1699), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-06 03:51:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2003 transitions. [2025-02-06 03:51:41,189 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2003 transitions. Word has length 145 [2025-02-06 03:51:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:41,189 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2003 transitions. [2025-02-06 03:51:41,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.625) internal successors, (58), 19 states have internal predecessors, (58), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 5 states have call successors, (18) [2025-02-06 03:51:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2003 transitions. [2025-02-06 03:51:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-06 03:51:41,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:41,191 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] [2025-02-06 03:51:41,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:51:41,192 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:41,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash 739320050, now seen corresponding path program 1 times [2025-02-06 03:51:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:41,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224346330] [2025-02-06 03:51:41,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:41,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:41,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-06 03:51:41,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-06 03:51:41,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:41,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:43,263 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:51:43,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:43,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224346330] [2025-02-06 03:51:43,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224346330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:43,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:43,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-06 03:51:43,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865688733] [2025-02-06 03:51:43,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:43,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 03:51:43,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:43,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 03:51:43,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:51:43,265 INFO L87 Difference]: Start difference. First operand 1601 states and 2003 transitions. Second operand has 20 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:51:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:45,511 INFO L93 Difference]: Finished difference Result 2752 states and 3448 transitions. [2025-02-06 03:51:45,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:51:45,512 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 146 [2025-02-06 03:51:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:45,519 INFO L225 Difference]: With dead ends: 2752 [2025-02-06 03:51:45,519 INFO L226 Difference]: Without dead ends: 1652 [2025-02-06 03:51:45,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:51:45,523 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 247 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:45,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1737 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1745 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:51:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2025-02-06 03:51:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1609. [2025-02-06 03:51:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1416 states have (on average 1.2055084745762712) internal successors, (1707), 1433 states have internal predecessors, (1707), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-06 03:51:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2011 transitions. [2025-02-06 03:51:45,622 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2011 transitions. Word has length 146 [2025-02-06 03:51:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:45,623 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2011 transitions. [2025-02-06 03:51:45,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 20 states have internal predecessors, (59), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:51:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2011 transitions. [2025-02-06 03:51:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:51:45,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:45,625 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:51:45,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:51:45,626 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:45,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1517740760, now seen corresponding path program 1 times [2025-02-06 03:51:45,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:45,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555912479] [2025-02-06 03:51:45,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:45,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:51:45,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:51:45,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:45,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:48,319 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:51:48,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:48,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555912479] [2025-02-06 03:51:48,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555912479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:48,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:48,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-06 03:51:48,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000369739] [2025-02-06 03:51:48,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:48,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 03:51:48,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:48,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 03:51:48,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:51:48,320 INFO L87 Difference]: Start difference. First operand 1609 states and 2011 transitions. Second operand has 27 states, 24 states have (on average 2.5) internal successors, (60), 27 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:51:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:53,138 INFO L93 Difference]: Finished difference Result 1802 states and 2227 transitions. [2025-02-06 03:51:53,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-02-06 03:51:53,138 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.5) internal successors, (60), 27 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 147 [2025-02-06 03:51:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:53,145 INFO L225 Difference]: With dead ends: 1802 [2025-02-06 03:51:53,145 INFO L226 Difference]: Without dead ends: 1800 [2025-02-06 03:51:53,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=472, Invalid=4358, Unknown=0, NotChecked=0, Total=4830 [2025-02-06 03:51:53,147 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 411 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:53,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1246 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 03:51:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2025-02-06 03:51:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1688. [2025-02-06 03:51:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1688 states, 1495 states have (on average 1.1959866220735786) internal successors, (1788), 1512 states have internal predecessors, (1788), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-06 03:51:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2092 transitions. [2025-02-06 03:51:53,258 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2092 transitions. Word has length 147 [2025-02-06 03:51:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:53,258 INFO L471 AbstractCegarLoop]: Abstraction has 1688 states and 2092 transitions. [2025-02-06 03:51:53,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.5) internal successors, (60), 27 states have internal predecessors, (60), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:51:53,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2092 transitions. [2025-02-06 03:51:53,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:51:53,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:53,260 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:51:53,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:51:53,261 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:53,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:53,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1773697452, now seen corresponding path program 1 times [2025-02-06 03:51:53,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:53,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161648409] [2025-02-06 03:51:53,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:53,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:51:53,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:51:53,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:53,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:54,533 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:51:54,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:54,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161648409] [2025-02-06 03:51:54,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161648409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:54,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:54,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:51:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937672692] [2025-02-06 03:51:54,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:54,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:51:54,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:54,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:51:54,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:51:54,535 INFO L87 Difference]: Start difference. First operand 1688 states and 2092 transitions. Second operand has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:51:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:51:55,278 INFO L93 Difference]: Finished difference Result 3495 states and 4316 transitions. [2025-02-06 03:51:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:51:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-02-06 03:51:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:51:55,285 INFO L225 Difference]: With dead ends: 3495 [2025-02-06 03:51:55,286 INFO L226 Difference]: Without dead ends: 1810 [2025-02-06 03:51:55,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:51:55,289 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 101 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:51:55,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 773 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:51:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-02-06 03:51:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1716. [2025-02-06 03:51:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1523 states have (on average 1.1917268548916613) internal successors, (1815), 1540 states have internal predecessors, (1815), 152 states have call successors, (152), 40 states have call predecessors, (152), 40 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-06 03:51:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2119 transitions. [2025-02-06 03:51:55,418 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2119 transitions. Word has length 147 [2025-02-06 03:51:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:51:55,419 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2119 transitions. [2025-02-06 03:51:55,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 03:51:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2119 transitions. [2025-02-06 03:51:55,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 03:51:55,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:51:55,421 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:51:55,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:51:55,421 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:51:55,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:51:55,423 INFO L85 PathProgramCache]: Analyzing trace with hash -272976279, now seen corresponding path program 1 times [2025-02-06 03:51:55,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:51:55,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209442677] [2025-02-06 03:51:55,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:51:55,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:51:55,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 03:51:55,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 03:51:55,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:51:55,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:51:55,563 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:51:55,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:51:55,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209442677] [2025-02-06 03:51:55,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209442677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:51:55,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:51:55,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:51:55,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132084292] [2025-02-06 03:51:55,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:51:55,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:51:55,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:51:55,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:51:55,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:51:55,565 INFO L87 Difference]: Start difference. First operand 1716 states and 2119 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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)