./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dac49eff911c415c5e3abe3f83531cb71a1bf616fed1a86cc9f731a40011a721 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:52:24,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:52:25,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:52:25,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:52:25,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:52:25,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:52:25,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:52:25,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:52:25,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:52:25,045 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:52:25,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:52:25,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:52:25,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:52:25,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:52:25,046 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:52:25,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:52:25,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:52:25,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:52:25,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:52:25,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:52:25,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:52:25,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:52:25,048 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dac49eff911c415c5e3abe3f83531cb71a1bf616fed1a86cc9f731a40011a721 [2025-03-04 01:52:25,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:52:25,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:52:25,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:52:25,292 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:52:25,292 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:52:25,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i [2025-03-04 01:52:26,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b43d21b/1af58649517746e29cd0eab5e795618e/FLAG391d1236c [2025-03-04 01:52:26,671 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:52:26,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i [2025-03-04 01:52:26,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b43d21b/1af58649517746e29cd0eab5e795618e/FLAG391d1236c [2025-03-04 01:52:26,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b43d21b/1af58649517746e29cd0eab5e795618e [2025-03-04 01:52:26,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:52:26,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:52:26,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:52:26,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:52:27,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:52:27,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:52:26" (1/1) ... [2025-03-04 01:52:27,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab61f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27, skipping insertion in model container [2025-03-04 01:52:27,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:52:26" (1/1) ... [2025-03-04 01:52:27,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:52:27,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i[917,930] [2025-03-04 01:52:27,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:52:27,173 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:52:27,181 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-56.i[917,930] [2025-03-04 01:52:27,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:52:27,224 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:52:27,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27 WrapperNode [2025-03-04 01:52:27,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:52:27,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:52:27,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:52:27,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:52:27,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (1/1) ... [2025-03-04 01:52:27,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (1/1) ... [2025-03-04 01:52:27,288 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 582 [2025-03-04 01:52:27,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:52:27,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:52:27,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:52:27,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:52:27,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (1/1) ... [2025-03-04 01:52:27,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (1/1) ... [2025-03-04 01:52:27,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (1/1) ... [2025-03-04 01:52:27,314 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:52:27,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (1/1) ... [2025-03-04 01:52:27,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (1/1) ... [2025-03-04 01:52:27,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (1/1) ... [2025-03-04 01:52:27,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (1/1) ... [2025-03-04 01:52:27,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (1/1) ... [2025-03-04 01:52:27,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (1/1) ... [2025-03-04 01:52:27,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:52:27,348 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:52:27,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:52:27,353 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:52:27,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (1/1) ... [2025-03-04 01:52:27,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:52:27,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:52:27,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:52:27,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:52:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:52:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:52:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:52:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:52:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:52:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:52:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:52:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:52:27,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:52:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:52:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:52:27,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:52:27,482 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:52:27,484 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:52:27,968 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L139: havoc property_#t~mem90#1;havoc property_#t~bitwise91#1;havoc property_#t~ite119#1;havoc property_#t~mem107#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short123#1;havoc property_#t~ite129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~short141#1;havoc property_#t~ite157#1;havoc property_#t~mem145#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~bitwise144#1;havoc property_#t~ite154#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem149#1;havoc property_#t~mem148#1;havoc property_#t~mem150#1;havoc property_#t~mem153#1;havoc property_#t~mem152#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~short158#1; [2025-03-04 01:52:28,011 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-03-04 01:52:28,011 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:52:28,032 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:52:28,032 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:52:28,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:52:28 BoogieIcfgContainer [2025-03-04 01:52:28,033 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:52:28,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:52:28,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:52:28,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:52:28,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:52:26" (1/3) ... [2025-03-04 01:52:28,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1257e579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:52:28, skipping insertion in model container [2025-03-04 01:52:28,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:52:27" (2/3) ... [2025-03-04 01:52:28,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1257e579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:52:28, skipping insertion in model container [2025-03-04 01:52:28,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:52:28" (3/3) ... [2025-03-04 01:52:28,039 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-56.i [2025-03-04 01:52:28,048 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:52:28,049 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-56.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:52:28,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:52:28,101 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;@54fda0a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:52:28,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:52:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:52:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:52:28,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:28,129 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:28,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:28,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash -807210912, now seen corresponding path program 1 times [2025-03-04 01:52:28,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:28,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915602372] [2025-03-04 01:52:28,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:28,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:52:28,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:52:28,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:28,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:52:28,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:28,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915602372] [2025-03-04 01:52:28,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915602372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:52:28,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469513818] [2025-03-04 01:52:28,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:28,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:52:28,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:52:28,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:52:28,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:52:28,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:52:28,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:52:28,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:28,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:28,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:52:28,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:52:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 01:52:28,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:52:28,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469513818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:28,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:52:28,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:52:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040331064] [2025-03-04 01:52:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:28,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:52:28,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:28,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:52:28,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:52:28,758 INFO L87 Difference]: Start difference. First operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:52:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:28,785 INFO L93 Difference]: Finished difference Result 244 states and 384 transitions. [2025-03-04 01:52:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:52:28,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-03-04 01:52:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:28,813 INFO L225 Difference]: With dead ends: 244 [2025-03-04 01:52:28,813 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:52:28,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-03-04 01:52:28,820 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:28,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:52:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:52:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 01:52:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:52:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2025-03-04 01:52:28,859 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2025-03-04 01:52:28,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:28,859 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2025-03-04 01:52:28,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 01:52:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2025-03-04 01:52:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:52:28,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:28,863 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:28,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:52:29,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:52:29,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:29,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1867327191, now seen corresponding path program 1 times [2025-03-04 01:52:29,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:29,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124913992] [2025-03-04 01:52:29,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:29,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:29,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:52:29,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:52:29,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:29,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:31,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124913992] [2025-03-04 01:52:31,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124913992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:31,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:31,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:52:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763632252] [2025-03-04 01:52:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:31,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:52:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:31,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:52:31,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:52:31,264 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:32,938 INFO L93 Difference]: Finished difference Result 481 states and 716 transitions. [2025-03-04 01:52:32,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:52:32,939 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-04 01:52:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:32,943 INFO L225 Difference]: With dead ends: 481 [2025-03-04 01:52:32,944 INFO L226 Difference]: Without dead ends: 362 [2025-03-04 01:52:32,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:52:32,946 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 480 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:32,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1210 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 01:52:32,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-04 01:52:32,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 199. [2025-03-04 01:52:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 158 states have (on average 1.3924050632911393) internal successors, (220), 158 states have internal predecessors, (220), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:52:32,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 296 transitions. [2025-03-04 01:52:32,984 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 296 transitions. Word has length 151 [2025-03-04 01:52:32,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:32,985 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 296 transitions. [2025-03-04 01:52:32,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 296 transitions. [2025-03-04 01:52:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:52:32,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:32,988 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:32,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:52:32,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:32,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:32,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1923212252, now seen corresponding path program 1 times [2025-03-04 01:52:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:32,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812723513] [2025-03-04 01:52:32,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:32,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:33,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:52:33,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:52:33,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:33,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:33,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:33,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812723513] [2025-03-04 01:52:33,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812723513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:33,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:33,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:52:33,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21235488] [2025-03-04 01:52:33,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:33,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:52:33,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:33,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:52:33,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:52:33,119 INFO L87 Difference]: Start difference. First operand 199 states and 296 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:33,192 INFO L93 Difference]: Finished difference Result 319 states and 475 transitions. [2025-03-04 01:52:33,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:52:33,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:52:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:33,195 INFO L225 Difference]: With dead ends: 319 [2025-03-04 01:52:33,195 INFO L226 Difference]: Without dead ends: 200 [2025-03-04 01:52:33,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:52:33,197 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:33,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:52:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-04 01:52:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-04 01:52:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 159 states have (on average 1.3836477987421383) internal successors, (220), 159 states have internal predecessors, (220), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:52:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 296 transitions. [2025-03-04 01:52:33,223 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 296 transitions. Word has length 152 [2025-03-04 01:52:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:33,223 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 296 transitions. [2025-03-04 01:52:33,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 296 transitions. [2025-03-04 01:52:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:52:33,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:33,226 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:33,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:52:33,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:33,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1756499512, now seen corresponding path program 1 times [2025-03-04 01:52:33,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:33,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646778574] [2025-03-04 01:52:33,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:33,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:33,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:52:33,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:52:33,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:33,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:33,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:33,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646778574] [2025-03-04 01:52:33,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646778574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:33,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:33,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:52:33,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512759587] [2025-03-04 01:52:33,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:33,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:52:33,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:33,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:52:33,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:52:33,321 INFO L87 Difference]: Start difference. First operand 200 states and 296 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:33,378 INFO L93 Difference]: Finished difference Result 321 states and 476 transitions. [2025-03-04 01:52:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:52:33,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:52:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:33,381 INFO L225 Difference]: With dead ends: 321 [2025-03-04 01:52:33,382 INFO L226 Difference]: Without dead ends: 201 [2025-03-04 01:52:33,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:52:33,384 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:33,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:52:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-04 01:52:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-04 01:52:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.375) internal successors, (220), 160 states have internal predecessors, (220), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:52:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2025-03-04 01:52:33,400 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 152 [2025-03-04 01:52:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:33,401 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2025-03-04 01:52:33,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2025-03-04 01:52:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:52:33,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:33,403 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:33,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:52:33,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:33,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash -663990423, now seen corresponding path program 1 times [2025-03-04 01:52:33,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:33,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169243222] [2025-03-04 01:52:33,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:33,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:33,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:52:33,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:52:33,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:33,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:33,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:33,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169243222] [2025-03-04 01:52:33,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169243222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:33,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:33,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:52:33,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987926357] [2025-03-04 01:52:33,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:33,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:52:33,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:33,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:52:33,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:52:33,487 INFO L87 Difference]: Start difference. First operand 201 states and 296 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:33,560 INFO L93 Difference]: Finished difference Result 322 states and 475 transitions. [2025-03-04 01:52:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:52:33,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:52:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:33,562 INFO L225 Difference]: With dead ends: 322 [2025-03-04 01:52:33,562 INFO L226 Difference]: Without dead ends: 201 [2025-03-04 01:52:33,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:52:33,568 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:33,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:52:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-04 01:52:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-04 01:52:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.36875) internal successors, (219), 160 states have internal predecessors, (219), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:52:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 295 transitions. [2025-03-04 01:52:33,579 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 295 transitions. Word has length 152 [2025-03-04 01:52:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:33,580 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 295 transitions. [2025-03-04 01:52:33,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 295 transitions. [2025-03-04 01:52:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:52:33,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:33,581 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:33,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:52:33,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:33,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:33,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1422553372, now seen corresponding path program 1 times [2025-03-04 01:52:33,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:33,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309500018] [2025-03-04 01:52:33,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:33,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:33,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:52:33,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:52:33,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:33,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:33,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:33,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309500018] [2025-03-04 01:52:33,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309500018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:33,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:33,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:52:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571149788] [2025-03-04 01:52:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:33,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:52:33,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:33,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:52:33,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:52:33,669 INFO L87 Difference]: Start difference. First operand 201 states and 295 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:33,743 INFO L93 Difference]: Finished difference Result 322 states and 473 transitions. [2025-03-04 01:52:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:52:33,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-03-04 01:52:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:33,747 INFO L225 Difference]: With dead ends: 322 [2025-03-04 01:52:33,747 INFO L226 Difference]: Without dead ends: 201 [2025-03-04 01:52:33,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:52:33,748 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:33,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:52:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-04 01:52:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-04 01:52:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.3625) internal successors, (218), 160 states have internal predecessors, (218), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:52:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 294 transitions. [2025-03-04 01:52:33,759 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 294 transitions. Word has length 152 [2025-03-04 01:52:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:33,759 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 294 transitions. [2025-03-04 01:52:33,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 294 transitions. [2025-03-04 01:52:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:52:33,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:33,761 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:33,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:52:33,762 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:33,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1343575892, now seen corresponding path program 1 times [2025-03-04 01:52:33,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:33,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202739421] [2025-03-04 01:52:33,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:33,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:33,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:52:33,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:52:33,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:33,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-04 01:52:33,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:33,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202739421] [2025-03-04 01:52:33,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202739421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:52:33,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538101408] [2025-03-04 01:52:33,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:33,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:52:33,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:52:33,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:52:33,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:52:34,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:52:34,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:52:34,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:34,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:34,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:52:34,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:52:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:34,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:52:34,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538101408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:34,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:52:34,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:52:34,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711757519] [2025-03-04 01:52:34,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:34,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:52:34,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:34,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:52:34,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:52:34,194 INFO L87 Difference]: Start difference. First operand 201 states and 294 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:34,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:34,228 INFO L93 Difference]: Finished difference Result 325 states and 475 transitions. [2025-03-04 01:52:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:52:34,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:52:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:34,231 INFO L225 Difference]: With dead ends: 325 [2025-03-04 01:52:34,231 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 01:52:34,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 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-03-04 01:52:34,231 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:34,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:52:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 01:52:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-04 01:52:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 163 states have (on average 1.3558282208588956) internal successors, (221), 163 states have internal predecessors, (221), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:52:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 297 transitions. [2025-03-04 01:52:34,246 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 297 transitions. Word has length 153 [2025-03-04 01:52:34,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:34,246 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 297 transitions. [2025-03-04 01:52:34,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 297 transitions. [2025-03-04 01:52:34,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:52:34,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:34,247 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:34,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:52:34,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 01:52:34,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:34,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:34,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1463848332, now seen corresponding path program 1 times [2025-03-04 01:52:34,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:34,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750246451] [2025-03-04 01:52:34,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:34,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:34,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:52:34,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:52:34,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:34,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:38,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:38,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750246451] [2025-03-04 01:52:38,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750246451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:38,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:38,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:52:38,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576648422] [2025-03-04 01:52:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:38,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:52:38,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:38,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:52:38,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:52:38,075 INFO L87 Difference]: Start difference. First operand 204 states and 297 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:52:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:40,323 INFO L93 Difference]: Finished difference Result 501 states and 726 transitions. [2025-03-04 01:52:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:52:40,324 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-04 01:52:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:40,326 INFO L225 Difference]: With dead ends: 501 [2025-03-04 01:52:40,326 INFO L226 Difference]: Without dead ends: 377 [2025-03-04 01:52:40,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:52:40,327 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 530 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:40,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1075 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 01:52:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-04 01:52:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 225. [2025-03-04 01:52:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 184 states have (on average 1.3858695652173914) internal successors, (255), 184 states have internal predecessors, (255), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:52:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 331 transitions. [2025-03-04 01:52:40,339 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 331 transitions. Word has length 153 [2025-03-04 01:52:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:40,340 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 331 transitions. [2025-03-04 01:52:40,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:52:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 331 transitions. [2025-03-04 01:52:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:52:40,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:40,341 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:40,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:52:40,341 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:40,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:40,342 INFO L85 PathProgramCache]: Analyzing trace with hash 43703477, now seen corresponding path program 1 times [2025-03-04 01:52:40,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:40,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732164103] [2025-03-04 01:52:40,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:40,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:40,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:52:40,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:52:40,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:40,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:40,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:40,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732164103] [2025-03-04 01:52:40,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732164103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:40,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:40,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:52:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665885476] [2025-03-04 01:52:40,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:40,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:52:40,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:40,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:52:40,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:52:40,603 INFO L87 Difference]: Start difference. First operand 225 states and 331 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:40,840 INFO L93 Difference]: Finished difference Result 392 states and 570 transitions. [2025-03-04 01:52:40,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:52:40,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:52:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:40,842 INFO L225 Difference]: With dead ends: 392 [2025-03-04 01:52:40,842 INFO L226 Difference]: Without dead ends: 268 [2025-03-04 01:52:40,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:52:40,843 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 49 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:40,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 555 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:52:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-04 01:52:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 228. [2025-03-04 01:52:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 187 states have (on average 1.3903743315508021) internal successors, (260), 187 states have internal predecessors, (260), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:52:40,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 336 transitions. [2025-03-04 01:52:40,855 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 336 transitions. Word has length 153 [2025-03-04 01:52:40,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:40,855 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 336 transitions. [2025-03-04 01:52:40,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 336 transitions. [2025-03-04 01:52:40,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:52:40,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:40,857 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:40,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:52:40,857 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:40,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:40,857 INFO L85 PathProgramCache]: Analyzing trace with hash -249699530, now seen corresponding path program 1 times [2025-03-04 01:52:40,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:40,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105277447] [2025-03-04 01:52:40,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:40,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:40,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:52:40,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:52:40,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:40,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:43,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:43,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105277447] [2025-03-04 01:52:43,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105277447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:43,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:43,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-04 01:52:43,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140424940] [2025-03-04 01:52:43,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:43,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 01:52:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:43,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 01:52:43,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:52:43,910 INFO L87 Difference]: Start difference. First operand 228 states and 336 transitions. Second operand has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:52:46,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:46,022 INFO L93 Difference]: Finished difference Result 507 states and 732 transitions. [2025-03-04 01:52:46,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:52:46,022 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2025-03-04 01:52:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:46,024 INFO L225 Difference]: With dead ends: 507 [2025-03-04 01:52:46,024 INFO L226 Difference]: Without dead ends: 381 [2025-03-04 01:52:46,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 01:52:46,025 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 635 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:46,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1282 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 01:52:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-04 01:52:46,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 232. [2025-03-04 01:52:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 190 states have (on average 1.3842105263157896) internal successors, (263), 190 states have internal predecessors, (263), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:52:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 339 transitions. [2025-03-04 01:52:46,040 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 339 transitions. Word has length 153 [2025-03-04 01:52:46,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:46,041 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 339 transitions. [2025-03-04 01:52:46,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.388888888888889) internal successors, (61), 20 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:52:46,041 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 339 transitions. [2025-03-04 01:52:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:52:46,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:46,042 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:46,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:52:46,042 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:46,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:46,042 INFO L85 PathProgramCache]: Analyzing trace with hash 595064806, now seen corresponding path program 1 times [2025-03-04 01:52:46,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:46,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904558901] [2025-03-04 01:52:46,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:46,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:52:46,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:52:46,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:46,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:46,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:46,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904558901] [2025-03-04 01:52:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904558901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:46,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:46,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:52:46,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212312031] [2025-03-04 01:52:46,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:46,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:52:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:46,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:52:46,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:52:46,492 INFO L87 Difference]: Start difference. First operand 232 states and 339 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:46,873 INFO L93 Difference]: Finished difference Result 416 states and 608 transitions. [2025-03-04 01:52:46,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:52:46,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:52:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:46,874 INFO L225 Difference]: With dead ends: 416 [2025-03-04 01:52:46,874 INFO L226 Difference]: Without dead ends: 290 [2025-03-04 01:52:46,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:52:46,875 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 200 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:46,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 400 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:52:46,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-04 01:52:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 248. [2025-03-04 01:52:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 206 states have (on average 1.3932038834951457) internal successors, (287), 206 states have internal predecessors, (287), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:52:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 363 transitions. [2025-03-04 01:52:46,896 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 363 transitions. Word has length 153 [2025-03-04 01:52:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:46,897 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 363 transitions. [2025-03-04 01:52:46,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:52:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 363 transitions. [2025-03-04 01:52:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:52:46,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:46,898 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:46,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:52:46,898 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:46,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1504888038, now seen corresponding path program 1 times [2025-03-04 01:52:46,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:46,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199132287] [2025-03-04 01:52:46,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:46,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:46,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:52:47,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:52:47,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:47,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:50,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199132287] [2025-03-04 01:52:50,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199132287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:50,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:50,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 01:52:50,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794650424] [2025-03-04 01:52:50,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:50,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:52:50,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:50,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:52:50,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:52:50,654 INFO L87 Difference]: Start difference. First operand 248 states and 363 transitions. Second operand has 19 states, 16 states have (on average 3.8125) internal successors, (61), 19 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:52:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:53,589 INFO L93 Difference]: Finished difference Result 521 states and 763 transitions. [2025-03-04 01:52:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:52:53,590 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.8125) internal successors, (61), 19 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2025-03-04 01:52:53,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:53,591 INFO L225 Difference]: With dead ends: 521 [2025-03-04 01:52:53,592 INFO L226 Difference]: Without dead ends: 379 [2025-03-04 01:52:53,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:52:53,592 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 480 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:53,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1285 Invalid, 2324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 01:52:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-04 01:52:53,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 270. [2025-03-04 01:52:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 228 states have (on average 1.4078947368421053) internal successors, (321), 228 states have internal predecessors, (321), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:52:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 397 transitions. [2025-03-04 01:52:53,613 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 397 transitions. Word has length 153 [2025-03-04 01:52:53,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:53,616 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 397 transitions. [2025-03-04 01:52:53,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.8125) internal successors, (61), 19 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:52:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 397 transitions. [2025-03-04 01:52:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:52:53,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:53,618 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:53,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:52:53,618 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:53,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:53,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1798291045, now seen corresponding path program 1 times [2025-03-04 01:52:53,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:53,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502545441] [2025-03-04 01:52:53,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:53,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:53,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:52:53,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:52:53,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:53,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:55,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:55,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502545441] [2025-03-04 01:52:55,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502545441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:55,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:55,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:52:55,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654062849] [2025-03-04 01:52:55,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:55,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:52:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:55,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:52:55,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:52:55,237 INFO L87 Difference]: Start difference. First operand 270 states and 397 transitions. Second operand has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:52:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:56,062 INFO L93 Difference]: Finished difference Result 518 states and 754 transitions. [2025-03-04 01:52:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:52:56,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-04 01:52:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:56,064 INFO L225 Difference]: With dead ends: 518 [2025-03-04 01:52:56,064 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 01:52:56,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:52:56,065 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 518 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:56,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 557 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:52:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 01:52:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 369. [2025-03-04 01:52:56,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 321 states have (on average 1.4080996884735202) internal successors, (452), 322 states have internal predecessors, (452), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:52:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 536 transitions. [2025-03-04 01:52:56,088 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 536 transitions. Word has length 153 [2025-03-04 01:52:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:56,089 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 536 transitions. [2025-03-04 01:52:56,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:52:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 536 transitions. [2025-03-04 01:52:56,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:52:56,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:56,090 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:56,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:52:56,090 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:56,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:56,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1718584877, now seen corresponding path program 1 times [2025-03-04 01:52:56,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:56,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368853441] [2025-03-04 01:52:56,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:56,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:52:56,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:52:56,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:56,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:52:57,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:52:57,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368853441] [2025-03-04 01:52:57,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368853441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:52:57,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:52:57,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:52:57,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301864127] [2025-03-04 01:52:57,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:52:57,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:52:57,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:52:57,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:52:57,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:52:57,474 INFO L87 Difference]: Start difference. First operand 369 states and 536 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:52:58,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:58,160 INFO L93 Difference]: Finished difference Result 625 states and 905 transitions. [2025-03-04 01:52:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:52:58,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-04 01:52:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:58,164 INFO L225 Difference]: With dead ends: 625 [2025-03-04 01:52:58,164 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 01:52:58,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:52:58,165 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 522 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:58,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 471 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:52:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 01:52:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 348. [2025-03-04 01:52:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 300 states have (on average 1.39) internal successors, (417), 301 states have internal predecessors, (417), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:52:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 501 transitions. [2025-03-04 01:52:58,206 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 501 transitions. Word has length 153 [2025-03-04 01:52:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:58,206 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 501 transitions. [2025-03-04 01:52:58,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:52:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 501 transitions. [2025-03-04 01:52:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:52:58,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:58,208 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:52:58,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:52:58,208 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:58,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash -504436075, now seen corresponding path program 1 times [2025-03-04 01:52:58,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:52:58,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311664779] [2025-03-04 01:52:58,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:58,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:52:58,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:52:58,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:52:58,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:58,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:00,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311664779] [2025-03-04 01:53:00,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311664779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:00,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:00,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:53:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136398481] [2025-03-04 01:53:00,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:00,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:53:00,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:00,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:53:00,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:53:00,560 INFO L87 Difference]: Start difference. First operand 348 states and 501 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:53:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:02,937 INFO L93 Difference]: Finished difference Result 720 states and 1041 transitions. [2025-03-04 01:53:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:53:02,938 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-04 01:53:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:02,941 INFO L225 Difference]: With dead ends: 720 [2025-03-04 01:53:02,942 INFO L226 Difference]: Without dead ends: 506 [2025-03-04 01:53:02,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:53:02,944 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 451 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 2322 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:02,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1397 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2322 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 01:53:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-04 01:53:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 348. [2025-03-04 01:53:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 300 states have (on average 1.3866666666666667) internal successors, (416), 301 states have internal predecessors, (416), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 500 transitions. [2025-03-04 01:53:02,971 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 500 transitions. Word has length 153 [2025-03-04 01:53:02,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:02,972 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 500 transitions. [2025-03-04 01:53:02,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:53:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 500 transitions. [2025-03-04 01:53:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:53:02,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:02,973 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:02,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:53:02,973 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:02,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2053027590, now seen corresponding path program 1 times [2025-03-04 01:53:02,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:02,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062487542] [2025-03-04 01:53:02,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:02,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:53:03,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:53:03,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:03,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:03,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062487542] [2025-03-04 01:53:03,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062487542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:03,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:03,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:53:03,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910055498] [2025-03-04 01:53:03,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:03,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:53:03,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:03,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:53:03,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:53:03,767 INFO L87 Difference]: Start difference. First operand 348 states and 500 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:53:04,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:04,286 INFO L93 Difference]: Finished difference Result 562 states and 812 transitions. [2025-03-04 01:53:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:53:04,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-03-04 01:53:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:04,289 INFO L225 Difference]: With dead ends: 562 [2025-03-04 01:53:04,289 INFO L226 Difference]: Without dead ends: 348 [2025-03-04 01:53:04,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:53:04,291 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 141 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:04,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 472 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:53:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-04 01:53:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2025-03-04 01:53:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 300 states have (on average 1.3833333333333333) internal successors, (415), 301 states have internal predecessors, (415), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 499 transitions. [2025-03-04 01:53:04,313 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 499 transitions. Word has length 153 [2025-03-04 01:53:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:04,313 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 499 transitions. [2025-03-04 01:53:04,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:53:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 499 transitions. [2025-03-04 01:53:04,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:53:04,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:04,316 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:04,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:53:04,316 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:04,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:04,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2022007783, now seen corresponding path program 1 times [2025-03-04 01:53:04,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:04,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236575964] [2025-03-04 01:53:04,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:04,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:04,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:53:04,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:53:04,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:04,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:09,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:09,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236575964] [2025-03-04 01:53:09,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236575964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:09,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:09,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-04 01:53:09,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849027797] [2025-03-04 01:53:09,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:09,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 01:53:09,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:09,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 01:53:09,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:53:09,559 INFO L87 Difference]: Start difference. First operand 348 states and 499 transitions. Second operand has 23 states, 20 states have (on average 3.05) internal successors, (61), 23 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:53:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:14,873 INFO L93 Difference]: Finished difference Result 774 states and 1117 transitions. [2025-03-04 01:53:14,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 01:53:14,874 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 3.05) internal successors, (61), 23 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2025-03-04 01:53:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:14,876 INFO L225 Difference]: With dead ends: 774 [2025-03-04 01:53:14,876 INFO L226 Difference]: Without dead ends: 560 [2025-03-04 01:53:14,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=308, Invalid=1672, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 01:53:14,877 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 444 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 2812 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:14,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1755 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2812 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-04 01:53:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-04 01:53:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 370. [2025-03-04 01:53:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 322 states have (on average 1.3881987577639752) internal successors, (447), 323 states have internal predecessors, (447), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 531 transitions. [2025-03-04 01:53:14,900 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 531 transitions. Word has length 153 [2025-03-04 01:53:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:14,901 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 531 transitions. [2025-03-04 01:53:14,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 3.05) internal successors, (61), 23 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-04 01:53:14,901 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 531 transitions. [2025-03-04 01:53:14,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:53:14,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:14,902 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:14,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:53:14,902 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:14,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1020125751, now seen corresponding path program 1 times [2025-03-04 01:53:14,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:14,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424405536] [2025-03-04 01:53:14,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:14,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:14,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:53:14,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:53:14,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:14,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:15,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:15,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424405536] [2025-03-04 01:53:15,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424405536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:15,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:15,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:53:15,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880882289] [2025-03-04 01:53:15,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:15,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:53:15,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:15,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:53:15,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:53:15,263 INFO L87 Difference]: Start difference. First operand 370 states and 531 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:15,713 INFO L93 Difference]: Finished difference Result 626 states and 900 transitions. [2025-03-04 01:53:15,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:53:15,714 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-03-04 01:53:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:15,715 INFO L225 Difference]: With dead ends: 626 [2025-03-04 01:53:15,715 INFO L226 Difference]: Without dead ends: 412 [2025-03-04 01:53:15,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:53:15,716 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 275 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:15,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 536 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:53:15,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-04 01:53:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 372. [2025-03-04 01:53:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 324 states have (on average 1.3858024691358024) internal successors, (449), 325 states have internal predecessors, (449), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 533 transitions. [2025-03-04 01:53:15,740 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 533 transitions. Word has length 153 [2025-03-04 01:53:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:15,740 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 533 transitions. [2025-03-04 01:53:15,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 533 transitions. [2025-03-04 01:53:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:53:15,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:15,741 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:15,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:53:15,742 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:15,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash -442061096, now seen corresponding path program 1 times [2025-03-04 01:53:15,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:15,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469112024] [2025-03-04 01:53:15,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:15,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:15,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:53:15,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:53:15,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:15,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:15,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:15,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469112024] [2025-03-04 01:53:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469112024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:53:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223886733] [2025-03-04 01:53:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:15,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:53:15,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:15,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:53:15,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:53:15,917 INFO L87 Difference]: Start difference. First operand 372 states and 533 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:16,108 INFO L93 Difference]: Finished difference Result 639 states and 908 transitions. [2025-03-04 01:53:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:53:16,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-03-04 01:53:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:16,111 INFO L225 Difference]: With dead ends: 639 [2025-03-04 01:53:16,111 INFO L226 Difference]: Without dead ends: 393 [2025-03-04 01:53:16,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:53:16,112 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 5 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:16,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 520 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:53:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-04 01:53:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 379. [2025-03-04 01:53:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 331 states have (on average 1.3776435045317221) internal successors, (456), 332 states have internal predecessors, (456), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 540 transitions. [2025-03-04 01:53:16,137 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 540 transitions. Word has length 154 [2025-03-04 01:53:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:16,137 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 540 transitions. [2025-03-04 01:53:16,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:16,138 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 540 transitions. [2025-03-04 01:53:16,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:53:16,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:16,139 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:16,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:53:16,139 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:16,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:16,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1286532967, now seen corresponding path program 1 times [2025-03-04 01:53:16,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:16,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189451176] [2025-03-04 01:53:16,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:16,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:16,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:53:16,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:53:16,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:16,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:17,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:17,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189451176] [2025-03-04 01:53:17,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189451176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:17,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:17,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:53:17,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42580574] [2025-03-04 01:53:17,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:17,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:53:17,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:17,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:53:17,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:53:17,487 INFO L87 Difference]: Start difference. First operand 379 states and 540 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:18,594 INFO L93 Difference]: Finished difference Result 882 states and 1262 transitions. [2025-03-04 01:53:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:53:18,594 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 154 [2025-03-04 01:53:18,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:18,598 INFO L225 Difference]: With dead ends: 882 [2025-03-04 01:53:18,598 INFO L226 Difference]: Without dead ends: 663 [2025-03-04 01:53:18,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:53:18,599 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 299 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:18,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 854 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:53:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-03-04 01:53:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 447. [2025-03-04 01:53:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 399 states have (on average 1.4210526315789473) internal successors, (567), 400 states have internal predecessors, (567), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 651 transitions. [2025-03-04 01:53:18,647 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 651 transitions. Word has length 154 [2025-03-04 01:53:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:18,648 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 651 transitions. [2025-03-04 01:53:18,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-04 01:53:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 651 transitions. [2025-03-04 01:53:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:53:18,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:18,649 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:18,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:53:18,649 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:18,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash 931224986, now seen corresponding path program 1 times [2025-03-04 01:53:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:18,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340911652] [2025-03-04 01:53:18,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:18,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:18,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:53:18,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:53:18,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:18,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:19,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:19,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340911652] [2025-03-04 01:53:19,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340911652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:19,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:19,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:53:19,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815316465] [2025-03-04 01:53:19,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:19,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:53:19,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:19,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:53:19,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:53:19,738 INFO L87 Difference]: Start difference. First operand 447 states and 651 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:21,097 INFO L93 Difference]: Finished difference Result 968 states and 1382 transitions. [2025-03-04 01:53:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:53:21,098 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-03-04 01:53:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:21,100 INFO L225 Difference]: With dead ends: 968 [2025-03-04 01:53:21,100 INFO L226 Difference]: Without dead ends: 749 [2025-03-04 01:53:21,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:53:21,102 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 338 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:21,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1360 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:53:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-03-04 01:53:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 453. [2025-03-04 01:53:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 405 states have (on average 1.4246913580246914) internal successors, (577), 406 states have internal predecessors, (577), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 661 transitions. [2025-03-04 01:53:21,134 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 661 transitions. Word has length 154 [2025-03-04 01:53:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:21,134 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 661 transitions. [2025-03-04 01:53:21,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 661 transitions. [2025-03-04 01:53:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:53:21,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:21,135 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:21,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:53:21,136 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:21,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash 620818986, now seen corresponding path program 1 times [2025-03-04 01:53:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:21,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421892595] [2025-03-04 01:53:21,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:21,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:21,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:53:21,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:53:21,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:21,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:21,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:21,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421892595] [2025-03-04 01:53:21,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421892595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:21,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:21,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:53:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802888899] [2025-03-04 01:53:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:21,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:53:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:21,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:53:21,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:53:21,679 INFO L87 Difference]: Start difference. First operand 453 states and 661 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:22,272 INFO L93 Difference]: Finished difference Result 845 states and 1212 transitions. [2025-03-04 01:53:22,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:53:22,273 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-04 01:53:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:22,277 INFO L225 Difference]: With dead ends: 845 [2025-03-04 01:53:22,277 INFO L226 Difference]: Without dead ends: 626 [2025-03-04 01:53:22,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:53:22,279 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 501 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:22,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 728 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:53:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-04 01:53:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 582. [2025-03-04 01:53:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 534 states have (on average 1.408239700374532) internal successors, (752), 535 states have internal predecessors, (752), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 836 transitions. [2025-03-04 01:53:22,307 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 836 transitions. Word has length 155 [2025-03-04 01:53:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:22,307 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 836 transitions. [2025-03-04 01:53:22,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 836 transitions. [2025-03-04 01:53:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:53:22,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:22,308 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:22,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:53:22,308 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:22,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:22,309 INFO L85 PathProgramCache]: Analyzing trace with hash 651838793, now seen corresponding path program 1 times [2025-03-04 01:53:22,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:22,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567375157] [2025-03-04 01:53:22,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:22,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:22,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:53:22,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:53:22,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:22,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:23,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:23,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567375157] [2025-03-04 01:53:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567375157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:23,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:23,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 01:53:23,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114550544] [2025-03-04 01:53:23,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:23,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:53:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:23,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:53:23,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:53:23,774 INFO L87 Difference]: Start difference. First operand 582 states and 836 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:53:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:25,881 INFO L93 Difference]: Finished difference Result 1123 states and 1605 transitions. [2025-03-04 01:53:25,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:53:25,882 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-03-04 01:53:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:25,884 INFO L225 Difference]: With dead ends: 1123 [2025-03-04 01:53:25,884 INFO L226 Difference]: Without dead ends: 805 [2025-03-04 01:53:25,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=934, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 01:53:25,885 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 535 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:25,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1604 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 01:53:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-04 01:53:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 611. [2025-03-04 01:53:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 563 states have (on average 1.4049733570159857) internal successors, (791), 564 states have internal predecessors, (791), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 875 transitions. [2025-03-04 01:53:25,915 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 875 transitions. Word has length 155 [2025-03-04 01:53:25,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:25,915 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 875 transitions. [2025-03-04 01:53:25,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:53:25,915 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 875 transitions. [2025-03-04 01:53:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:53:25,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:25,916 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:25,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:53:25,916 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:25,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:25,917 INFO L85 PathProgramCache]: Analyzing trace with hash 537625079, now seen corresponding path program 1 times [2025-03-04 01:53:25,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:25,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432762707] [2025-03-04 01:53:25,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:25,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:25,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:53:26,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:53:26,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:26,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:32,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432762707] [2025-03-04 01:53:32,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432762707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:32,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:32,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-03-04 01:53:32,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910457356] [2025-03-04 01:53:32,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:32,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 01:53:32,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:32,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 01:53:32,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:53:32,247 INFO L87 Difference]: Start difference. First operand 611 states and 875 transitions. Second operand has 29 states, 25 states have (on average 2.52) internal successors, (63), 29 states have internal predecessors, (63), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-04 01:53:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:38,615 INFO L93 Difference]: Finished difference Result 1186 states and 1696 transitions. [2025-03-04 01:53:38,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 01:53:38,615 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.52) internal successors, (63), 29 states have internal predecessors, (63), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 6 states have call successors, (19) Word has length 155 [2025-03-04 01:53:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:38,618 INFO L225 Difference]: With dead ends: 1186 [2025-03-04 01:53:38,618 INFO L226 Difference]: Without dead ends: 868 [2025-03-04 01:53:38,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=314, Invalid=2338, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 01:53:38,620 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 454 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 3719 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 3719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:38,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 2143 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 3719 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-04 01:53:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-03-04 01:53:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 658. [2025-03-04 01:53:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 610 states have (on average 1.4065573770491804) internal successors, (858), 611 states have internal predecessors, (858), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 942 transitions. [2025-03-04 01:53:38,651 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 942 transitions. Word has length 155 [2025-03-04 01:53:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:38,652 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 942 transitions. [2025-03-04 01:53:38,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.52) internal successors, (63), 29 states have internal predecessors, (63), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 6 states have call successors, (19) [2025-03-04 01:53:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 942 transitions. [2025-03-04 01:53:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:53:38,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:38,654 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:38,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:53:38,654 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:38,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash 244222072, now seen corresponding path program 1 times [2025-03-04 01:53:38,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:38,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479682125] [2025-03-04 01:53:38,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:38,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:53:38,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:53:38,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:38,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:38,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479682125] [2025-03-04 01:53:38,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479682125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:38,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:38,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:53:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498205814] [2025-03-04 01:53:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:38,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:53:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:38,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:53:38,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:53:38,832 INFO L87 Difference]: Start difference. First operand 658 states and 942 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:39,047 INFO L93 Difference]: Finished difference Result 1019 states and 1459 transitions. [2025-03-04 01:53:39,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:53:39,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-04 01:53:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:39,050 INFO L225 Difference]: With dead ends: 1019 [2025-03-04 01:53:39,050 INFO L226 Difference]: Without dead ends: 701 [2025-03-04 01:53:39,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:53:39,050 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 51 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:39,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 496 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:53:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-04 01:53:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 658. [2025-03-04 01:53:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 610 states have (on average 1.3983606557377048) internal successors, (853), 611 states have internal predecessors, (853), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 937 transitions. [2025-03-04 01:53:39,081 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 937 transitions. Word has length 155 [2025-03-04 01:53:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:39,081 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 937 transitions. [2025-03-04 01:53:39,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 937 transitions. [2025-03-04 01:53:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:53:39,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:39,083 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:39,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:53:39,083 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:39,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash 282888534, now seen corresponding path program 1 times [2025-03-04 01:53:39,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:39,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280244936] [2025-03-04 01:53:39,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:39,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:53:39,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:53:39,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:39,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:39,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280244936] [2025-03-04 01:53:39,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280244936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:39,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:39,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:53:39,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636110962] [2025-03-04 01:53:39,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:39,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:53:39,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:39,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:53:39,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:53:39,254 INFO L87 Difference]: Start difference. First operand 658 states and 937 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:39,459 INFO L93 Difference]: Finished difference Result 976 states and 1395 transitions. [2025-03-04 01:53:39,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:53:39,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-03-04 01:53:39,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:39,462 INFO L225 Difference]: With dead ends: 976 [2025-03-04 01:53:39,462 INFO L226 Difference]: Without dead ends: 618 [2025-03-04 01:53:39,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:53:39,467 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 7 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:39,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 525 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:53:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-03-04 01:53:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2025-03-04 01:53:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 570 states have (on average 1.3912280701754387) internal successors, (793), 571 states have internal predecessors, (793), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 877 transitions. [2025-03-04 01:53:39,500 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 877 transitions. Word has length 155 [2025-03-04 01:53:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:39,500 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 877 transitions. [2025-03-04 01:53:39,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 01:53:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 877 transitions. [2025-03-04 01:53:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:53:39,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:39,501 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:39,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:53:39,502 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:39,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:39,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1508353463, now seen corresponding path program 1 times [2025-03-04 01:53:39,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:39,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540199059] [2025-03-04 01:53:39,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:39,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:39,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:53:39,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:53:39,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:39,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:53:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 01:53:41,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:53:41,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540199059] [2025-03-04 01:53:41,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540199059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:53:41,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:53:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-04 01:53:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371614383] [2025-03-04 01:53:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:53:41,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 01:53:41,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:53:41,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 01:53:41,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:53:41,823 INFO L87 Difference]: Start difference. First operand 618 states and 877 transitions. Second operand has 20 states, 18 states have (on average 3.5) internal successors, (63), 20 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:53:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:53:43,841 INFO L93 Difference]: Finished difference Result 1040 states and 1481 transitions. [2025-03-04 01:53:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:53:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 20 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-03-04 01:53:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:53:43,844 INFO L225 Difference]: With dead ends: 1040 [2025-03-04 01:53:43,844 INFO L226 Difference]: Without dead ends: 722 [2025-03-04 01:53:43,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:53:43,845 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 280 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:53:43,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1566 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 01:53:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-04 01:53:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 661. [2025-03-04 01:53:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 613 states have (on average 1.398042414355628) internal successors, (857), 614 states have internal predecessors, (857), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-04 01:53:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 941 transitions. [2025-03-04 01:53:43,878 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 941 transitions. Word has length 155 [2025-03-04 01:53:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:53:43,878 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 941 transitions. [2025-03-04 01:53:43,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 20 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-04 01:53:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 941 transitions. [2025-03-04 01:53:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:53:43,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:53:43,879 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:53:43,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:53:43,879 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:53:43,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:53:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1816700090, now seen corresponding path program 1 times [2025-03-04 01:53:43,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:53:43,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544059681] [2025-03-04 01:53:43,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:53:43,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:53:43,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:53:43,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:53:43,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:53:43,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat